9 citations · 18 across the 5 of their papers we have counts for
3 papers · 2 filters
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…
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.
FSG: Fast String Graph Construction for De Novo Assembly of Reads Data
Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola +2
The string graph for a collection of next-generation reads is a lossless data representation that is fundamental for de novo assemblers based on the overlap-layout-consensus paradi…