Bidirectional Variable-Order de Bruijn Graphs
| dc.contributor.author | Belazzougui, Djamal | |
| dc.contributor.author | Gagie, Travis | |
| dc.contributor.author | Mäkinen, Veli | |
| dc.contributor.author | Previtali, Marco | |
| dc.contributor.author | Puglisi, Simon J. | |
| dc.date.accessioned | 2016-12-08T15:27:50Z | |
| dc.date.available | 2016-12-08T15:27:50Z | |
| dc.date.issued | 2016-03-22 | |
| dc.description.abstract | Implementing de Bruijn graphs compactly is an important problem because of their role in genome assembly. There are currently two main approaches, one using Bloom filters and the other using a kind of Burrows-Wheeler Transform on the edge labels of the graph. The second representation is more elegant and can even handle many graph-orders at once, but it does not cleanly support traversing edges backwards or inserting new nodes or edges. In this paper we resolve the first of these issues and partially address the second. | fr_FR |
| dc.identifier.isbn | 978-3-662-49529-2 | fr_FR |
| dc.identifier.isbn | 978-3-662-49528-5 | fr_FR |
| dc.identifier.uri | http://dl.cerist.dz/handle/CERIST/870 | |
| dc.publisher | Springer International Publishing | fr_FR |
| dc.relation.ispartofseries | LATIN 2016: Theoretical Informatics: 12th Latin American Symposium;Volume 9644 of the book series Lecture Notes in Computer Science (LNCS) | |
| dc.relation.pages | 164-178 | fr_FR |
| dc.relation.place | Ensenada, Mexico | fr_FR |
| dc.structure | Calcul pervasif et mobile (Pervasive and Mobile Computing group) | fr_FR |
| dc.subject | de Bruijn Graphs | fr_FR |
| dc.subject | Bidirectional navigation | fr_FR |
| dc.subject | Burrows-Wheeler transform | fr_FR |
| dc.subject | Variable order | fr_FR |
| dc.title | Bidirectional Variable-Order de Bruijn Graphs | fr_FR |
| dc.type | Conference paper |