Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Miika Leinonen"'
Publikováno v:
Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-23 (2024)
Abstract Computing k-mer frequencies in a collection of reads is a common procedure in many genomic applications. Several state-of-the-art k-mer counters rely on hash tables to carry out this task but they are often optimised for small k as a hash ta
Externí odkaz:
https://doaj.org/article/16986cd5151b494f8473d4024d0ad023
Autor:
Miika Leinonen, Leena Salmela
Publikováno v:
PLoS ONE, Vol 18, Iss 11 (2023)
Externí odkaz:
https://doaj.org/article/0c1d3e599e6b4425a08f6eb2b393a4a6
Autor:
Miika Leinonen, Leena Salmela
Publikováno v:
BMC Bioinformatics, Vol 21, Iss 1, Pp 1-19 (2020)
Abstract Background The long reads produced by third generation sequencing technologies have significantly boosted the results of genome assembly but still, genome-wide assemblies solely based on read data cannot be produced. Thus, for example, optic
Externí odkaz:
https://doaj.org/article/c818d131744f42058bb5d8c9bcaddf9f
Autor:
Leena Salmela, Miika Leinonen
Publikováno v:
BMC Bioinformatics, Vol 21, Iss 1, Pp 1-19 (2020)
BMC Bioinformatics
BMC Bioinformatics
Background The long reads produced by third generation sequencing technologies have significantly boosted the results of genome assembly but still, genome-wide assemblies solely based on read data cannot be produced. Thus, for example, optical mappin
Autor:
Leena Salmela, Miika Leinonen
Publikováno v:
IEEE/ACM transactions on computational biology and bioinformatics.
The extraction of k-mers from sequencing reads is an important task in many bioinformatics applications, such as all DNA sequence analysis methods based on de Bruijn graphs. These methods tend to be more accurate when the used k-mers are unique in th