Name
Abstract | ||
|---|---|---|
We propose a new algorithm for merging succinct representations of de Bruijn graphs introduced in [Bowe et al. WABI 2012]. Our algorithm is based on the lightweight BWT merging approach by Holt and McMillan [Bionformatics 2014, ACM-BCB 2014]. Our algorithm has the same asymptotic cost of the state of the art tool for the same problem presented by Muggli et al. [bioRxiv 2017, 2019], but it is more space efficient. A novel feature of our algorithm not found in the existing tools is that it can compute the Variable Order succinct representation of the union graph starting from the plain representation of the input graphs. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-32686-9_24 | SPIRE |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Colored,Working space,De Bruijn graph,De Bruijn sequence,Merge (version control),Mathematics,Auxiliary memory | Journal | abs/1902.02889 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lavinia Egidi | 1 | 91 | 10.21 |
| Felipe Alves da Louza | 2 | 40 | 9.13 |
| Giovanni Manzini | 3 | 1584 | 111.42 |