Fully Dynamic de Bruijn Graphs

Simple item page
dc.contributor.authorBelazzougui, Djamal
dc.contributor.authorGagie, Travis
dc.contributor.authorMäkinen, Veli
dc.contributor.authorPrevitali, Marco
dc.date.accessioned2016-12-08T16:38:45Z
dc.date.available2016-12-08T16:38:45Z
dc.date.issued2016-09-21
dc.description.abstractWe present a space- and time-efficient fully dynamic implementation of de Bruijn graphs, which can also support fixed-length jumbled pattern matching.fr_FR
dc.identifier.isbn978-3-319-46049-9fr_FR
dc.identifier.isbn978-3-319-46048-2fr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/871
dc.publisherSpringer International Publishingfr_FR
dc.relation.ispartofseries23rd International Symposium String Processing and Information Retrieval (SPIRE 2016);
dc.relation.pages145-152fr_FR
dc.relation.placeBeppu, Japanfr_FR
dc.structureCalcul pervasif et mobile (Pervasive and Mobile Computing group)fr_FR
dc.subjectde Bruijn Graphsfr_FR
dc.subjectHashingfr_FR
dc.subjectFully dynamic data structuresfr_FR
dc.subjectJumbled pattern matchingfr_FR
dc.titleFully Dynamic de Bruijn Graphsfr_FR
dc.typeConference paper
Files
Collections
International Conference Papers