Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
From MaRDI portal
Publication:3596712
DOI10.1007/978-3-540-92182-0_14zbMath1183.68216MaRDI 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
Related Items
Better External Memory LCP Array Construction, Small-space LCE data structure with constant-time queries, LCP Array Construction in External Memory, Parameterized longest previous factor, Fast, practical algorithms for computing all the repeats in a string, Practical compressed suffix trees, Computing regularities in strings: a survey, Variations of the parameterized longest previous factor, Faster online computation of the succinct longest previous factor array, Space-efficient construction of compressed suffix trees, Time-space trade-offs for longest common extensions, Faster semi-external suffix sorting, Lightweight LCP construction for very large collections of strings, Time-Space Trade-Offs for Longest Common Extensions, Permuted Longest-Common-Prefix Array