Title |
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
|
---|---|
Published in |
Algorithms for Molecular Biology, July 2016
|
DOI | 10.1186/s13015-016-0083-7 |
Pubmed ID | |
Authors |
Timo Beller, Enno Ohlebusch |
Abstract |
Recently, Marcus et al. (Bioinformatics 30:3476-83, 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 [Formula: see text] time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where n is the total length of the genomes and g is the length of the longest genome. Baier et al. (Bioinformatics 32:497-504, 2016) improved their result. In this paper, we propose a new space-efficient representation of the compressed de Bruijn graph that adds the possibility to search for a pattern (e.g. an allele-a variant form of a gene) within the pan-genome. The ability to search within the pan-genome graph is of utmost importance and is a design goal of pan-genome data structures. |
X Demographics
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Type | Count | As % |
---|---|---|
Members of the public | 2 | 67% |
Scientists | 1 | 33% |
Mendeley readers
Geographical breakdown
Country | Count | As % |
---|---|---|
France | 1 | 2% |
Unknown | 41 | 98% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 13 | 31% |
Student > Ph. D. Student | 10 | 24% |
Researcher | 7 | 17% |
Professor | 3 | 7% |
Student > Bachelor | 2 | 5% |
Other | 2 | 5% |
Unknown | 5 | 12% |
Readers by discipline | Count | As % |
---|---|---|
Biochemistry, Genetics and Molecular Biology | 13 | 31% |
Computer Science | 12 | 29% |
Agricultural and Biological Sciences | 8 | 19% |
Medicine and Dentistry | 2 | 5% |
Neuroscience | 1 | 2% |
Other | 1 | 2% |
Unknown | 5 | 12% |