Dynamic construction of pan-genome subgraphs
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 the compressed de Bruijn graph in terms of run-ti...
Main Authors: | Dede Kadir, Ohlebusch Enno |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2020-04-01
|
Series: | Open Computer Science |
Subjects: | |
Online Access: | https://doi.org/10.1515/comp-2020-0018 |
Similar Items
-
Buffering updates enables efficient dynamic de Bruijn graphs
by: Jarno Alanko, et al.
Published: (2021-01-01) -
Prefix-free parsing for building big BWTs
by: Christina Boucher, et al.
Published: (2019-05-01) -
Linear time minimum segmentation enables scalable founder reconstruction
by: Tuukka Norri, et al.
Published: (2019-05-01) -
ANALISIS ALGORITMA MTF, MTF-1 DAN MTF-2 PADA BURROWS WHEELER COMPRESSION ALGORITHM
by: Sagara Mahardika Sunaryo, et al.
Published: (2019-07-01) -
External memory BWT and LCP computation for sequence collections with applications
by: Lavinia Egidi, et al.
Published: (2019-03-01)