Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Ohlebusch Enno"'
Autor:
Dede Kadir, Ohlebusch Enno
Publikováno v:
Open Computer Science, Vol 10, Iss 1, Pp 82-96 (2020)
Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph as a description of a pan-genome, comprising the genomes of many individuals/strains of the same or closely related species. Subsequent work improved the construction of
Externí odkaz:
https://doaj.org/article/0159213ca2d640b8ada2d0be7b299629
Autor:
Beckstette Michael, Mailänder Jens T., Marhöfer Richard J., Sczyrba Alexander, Ohlebusch Enno, Giegerich Robert, Selzer Paul M.
Publikováno v:
Journal of Integrative Bioinformatics, Vol 1, Iss 1, Pp 90-107 (2004)
With rising numbers of fully sequenced genomes the importance of comparative genomics is constantly increasing. Although several software systems for genome comparison analyses do exist, their functionality and flexibility is still limited, compared
Externí odkaz:
https://doaj.org/article/dd12fd31fd7d4f8c8ba8fb805d5ec6ad
The suffix array is arguably one of the most important data structures in sequence analysis and consequently there is a multitude of suffix sorting algorithms. However, to this date the GSACA algorithm introduced in 2015 is the only known non-recursi
Externí odkaz:
http://arxiv.org/abs/2206.12222
Publikováno v:
BMC Bioinformatics, Vol 9, Iss 1, p 516 (2008)
Abstract Background Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. However, this phylogenetic reconstruction is a very challenging tas
Externí odkaz:
https://doaj.org/article/ad45ca112d2942ecb2e91fc5cbddbf64
Publikováno v:
BMC Bioinformatics, Vol 9, Iss 1, p 476 (2008)
Abstract Background Comparative genomics is the analysis and comparison of genomes from different species. This area of research is driven by the large number of sequenced genomes and heavily relies on efficient algorithms and software to perform pai
Externí odkaz:
https://doaj.org/article/02c94a82f3ea4635841bc0dfe59ac6fa
This paper introduces the de Bruijn graph edge minimization problem, which is related to the compression of de Bruijn graphs: find the order-k de Bruijn graph with minimum edge count among all orders. We describe an efficient algorithm that solves th
Externí odkaz:
http://arxiv.org/abs/1911.00044
Publikováno v:
In Information and Computation May 2022 285 Part B
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Beller, Timo, Ohlebusch, Enno
Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an $O(n \log g)$ time algorit
Externí odkaz:
http://arxiv.org/abs/1602.03333