RECONSTRUCTING A SUFFIX ARRAY
From MaRDI portal
Publication:3421844
DOI10.1142/S0129054106004418zbMath1169.68381OpenAlexW2058305583MaRDI QIDQ3421844
Publication date: 8 February 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054106004418
Related Items (5)
On left and right seeds of a string ⋮ Constructing an indeterminate string from its associated graph ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ Inferring an indeterminate string from a prefix graph
Cites Work
This page was built for publication: RECONSTRUCTING A SUFFIX ARRAY
