34 citations · 112 across the 32 of their papers we have counts for
37 papers
Better space-time-robustness trade-offs for set reconciliation
Djamal Belazzougui, Gregory Kucherov, Stefan Walzer
We consider the problem of reconstructing the symmetric difference between similar sets from their representations (sketches) of size linear in the number of differences. Exact sol…
Weighted Ancestors in Suffix Trees Revisited
Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi +1
The weighted ancestor problem is a well-known generalization of the predecessor problem to trees. It is known to require time for queries provided $O(n\mathop{\math…
Efficient tree-structured categorical retrieval
Djamal Belazzougui, Gregory Kucherov
We study a document retrieval problem in the new framework where text documents are organized in a {\em category tree} with a pre-defined number of categories. This situati…
Fully-functional bidirectional Burrows-Wheeler indexes
Fabio Cunial, Djamal Belazzougui
Given a string on an alphabet of size , we describe a bidirectional Burrows-Wheeler index that takes bits of space, and that supports the addition \emph{and re…
Assembling Omnitigs using Hidden-Order de Bruijn Graphs
Diego Díaz-Domínguez, Djamal Belazzougui, Travis Gagie +3
De novo DNA assembly is a fundamental task in Bioinformatics, and finding Eulerian paths on de Bruijn graphs is one of the dominant approaches to it. In most of the cases, there ma…
Fast Prefix Search in Little Space, with Applications
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh +1
It has been shown in the indexing literature that there is an essential difference between prefix/range searches on the one hand, and predecessor/rank searches on the other hand, i…