Space-Time Tradeoffs for Longest-Common-Prefix Array Computation

DOI10.1007/978-3-540-92182-0_14zbMath1183.68216OpenAlexW2167406488MaRDI QIDQ3596712

Andrew Turpin, Simon J. Puglisi

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_14

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (15)

Lightweight LCP construction for very large collections of strings ⋮ Time-Space Trade-Offs for Longest Common Extensions ⋮ Variations of the parameterized longest previous factor ⋮ Fast, practical algorithms for computing all the repeats in a string ⋮ Parameterized longest previous factor ⋮ Time-space trade-offs for longest common extensions ⋮ Faster semi-external suffix sorting ⋮ Space-efficient construction of compressed suffix trees ⋮ Better External Memory LCP Array Construction ⋮ Practical compressed suffix trees ⋮ Computing regularities in strings: a survey ⋮ Permuted Longest-Common-Prefix Array ⋮ Small-space LCE data structure with constant-time queries ⋮ Faster online computation of the succinct longest previous factor array ⋮ LCP Array Construction in External Memory

This page was built for publication: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation