2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 2 cited
A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings
Paola Bonizzoni, Gianluca Della Vedova, Serena Nicosia +2
Indexing of very large collections of strings such as those produced by the widespread sequencing technologies, heavily relies on multi-string generalizations of the Burrows-Wheele…
cs.DS2016
Fully Dynamic de Bruijn Graphs
Djamal Belazzougui, Travis Gagie, Veli Mäkinen +1
We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.