2 papers
cs.DS2021
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs
Sangsoo Park, Sung Gwan Park, Bastien Cazaux +2
The hierarchical overlap graph (HOG) is a graph that encodes overlaps from a given set P of n strings, as the overlap graph does. A best known algorithm constructs HOG in O(||P|| l…
cs.DS2017
The Compressed Overlap Index
Rodrigo Canovas, Bastien Cazaux, Eric Rivals
For analysing text algorithms, for computing superstrings, or for testing random number generators, one needs to compute all overlaps between any pairs of words in a given set. The…