2 citations · 2 across the 2 of their papers we have counts for
5 papers
Compact Path Representation in DAGs via Colored Edge Pebbling
Paola Bonizzoni, Alessio Conte, Gianluca Della Vedova +3
Compactly representing a variation graph is a core problem in computational pangenomics that is usually attacked with techniques that have been originated on texts and adapted to g…
Computing the BWT and LCP array of a Set of Strings in External Memory
Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola +2
Indexing very large collections of strings, such as those produced by the widespread next generation sequencing technologies, heavily relies on multistring generalization of the Bu…
On Computing the Dollo-1 phylogeny in polynomial time
Paola Bonizzoni, Gianluca Della Vedova, Mauricio Soto Gomez +1
The Dollo model for reconstructing evolutionary trees from binary characters has been proposed as a generalization of the infinite sites model, also known as the Perfect Phylogeny.…
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…
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…