13 citations · 26 across the 6 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Fast Label Extraction in the CDAWG
Djamal Belazzougui, Fabio Cunial
The compact directed acyclic word graph (CDAWG) of a string of length takes space proportional just to the number of right extensions of the maximal repeats of , and…
cs.DS2017★ 7 cited
Representing the suffix tree with the CDAWG
Djamal Belazzougui, Fabio Cunial
Given a string , it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with arcs, taking overall $O(e_T+e_{\overline{T}…