Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Jarno N. Alanko"'
Autor:
Sebastian Schmidt, Jarno N. Alanko
Publikováno v:
Algorithms for Molecular Biology, Vol 18, Iss 1, Pp 1-21 (2023)
Abstract A fundamental operation in computational genomics is to reduce the input sequences to their constituent k-mers. For maximum performance of downstream applications it is important to store the k-mers in small space, while keeping the represen
Externí odkaz:
https://doaj.org/article/2adedb00ad7f47d09c675a1b77b83a20
Publikováno v:
Genome Biology, Vol 24, Iss 1, Pp 1-32 (2023)
Abstract We propose a polynomial algorithm computing a minimum plain-text representation of k-mer sets, as well as an efficient near-minimum greedy heuristic. When compressing read sets of large model organisms or bacterial pangenomes, with only a mi
Externí odkaz:
https://doaj.org/article/a58fe2d18cc44bdfa56a3c93873dd863
Publikováno v:
Sensors, Vol 24, Iss 2, p 404 (2024)
We present Galileo Open Service Navigation Message Authentication (OSNMA) observed operational information and key performance indicators (KPIs) from the analysis of a ten-day-long dataset collected in static open-sky conditions in southern Finland a
Externí odkaz:
https://doaj.org/article/2ad00a2948eb4c329ea2e2c4aebe40b0
MotivationHuge data sets containing whole-genome sequences of bacterial strains are now commonplace and represent a rich and important resource for modern genomic epidemiology and metagenomics. In order to efficiently make use of these data sets, eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0278583b659090b9b352de4d9acee644
https://doi.org/10.1101/2023.02.24.529942
https://doi.org/10.1101/2023.02.24.529942
Autor:
Benedikt Kirsch-Gerweck, Leonard Bohnenkämper, Michel T Henrichs, Jarno N Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Joachim Burger, Jens Stoye, Yoan Diekmann
Genomic regions under positive selection harbour variation linked for example to adaptation. Most tools for detecting positively selected variants have computational resource requirements rendering them impractical on population genomic datasets with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d59660f5ce90353d37a056eb34510874
https://pub.uni-bielefeld.de/record/2969065
https://pub.uni-bielefeld.de/record/2969065
Publikováno v:
SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23) ISBN: 9781611977714
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5431b24181a2473aa1afb1b64d6a2210
https://doi.org/10.1137/1.9781611977714.20
https://doi.org/10.1137/1.9781611977714.20
Autor:
Jarno N Alanko, Ilya B Slizovskiy, Daniel Lokshtanov, Travis Gagie, Noelle R Noyes, Christina Boucher
Motivation Bait enrichment is a protocol that is becoming increasingly ubiquitous as it has been shown to successfully amplify regions of interest in metagenomic samples. In this method, a set of synthetic probes (‘baits’) are designed, manufactu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca7520404a2b445e955631a2dbe901bc
http://hdl.handle.net/10138/345967
http://hdl.handle.net/10138/345967
The k-spectrum of a string is the set of all distinct substrings of length k occurring in the string. This is a lossy but computationally convenient representation of the information in the string, with many applications in high-throughput bioinforma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f287d70835bc36d36549165073d6bbc
https://doi.org/10.1101/2022.05.19.492613
https://doi.org/10.1101/2022.05.19.492613