Bidirectional Variable-Order de Bruijn Graphs

dc.contributor.authorBelazzougui, Djamal
dc.contributor.authorGagie, Travis
dc.contributor.authorMäkinen, Veli
dc.contributor.authorPrevitali, Marco
dc.contributor.authorPuglisi, Simon J.
dc.date.accessioned2016-12-08T15:27:50Z
dc.date.available2016-12-08T15:27:50Z
dc.date.issued2016-03-22
dc.description.abstractImplementing 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.isbn978-3-662-49529-2fr_FR
dc.identifier.isbn978-3-662-49528-5fr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/870
dc.publisherSpringer International Publishingfr_FR
dc.relation.ispartofseriesLATIN 2016: Theoretical Informatics: 12th Latin American Symposium;Volume 9644 of the book series Lecture Notes in Computer Science (LNCS)
dc.relation.pages164-178fr_FR
dc.relation.placeEnsenada, Mexicofr_FR
dc.structureCalcul pervasif et mobile (Pervasive and Mobile Computing group)fr_FR
dc.subjectde Bruijn Graphsfr_FR
dc.subjectBidirectional navigationfr_FR
dc.subjectBurrows-Wheeler transformfr_FR
dc.subjectVariable orderfr_FR
dc.titleBidirectional Variable-Order de Bruijn Graphsfr_FR
dc.typeConference paper
Files