Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315389
DOI10.1007/b98413zbMath1095.68755OpenAlexW2615963353MaRDI QIDQ5315389
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98413
Related Items
Tighter Bounds for the Sum of Irreducible LCP Values, Variations of the parameterized longest previous factor, On the number of elements to reorder when updating a suffix array, Fast, practical algorithms for computing all the repeats in a string, Parameterized longest previous factor, Computing the Burrows-Wheeler transform of a string and its reverse in parallel, Space-efficient construction of compressed suffix trees, Better External Memory LCP Array Construction, Lightweight BWT and LCP Merging via the Gap Algorithm, Tighter bounds for the sum of irreducible LCP values, Burrows-Wheeler transform and LCP array construction in constant space, Inducing enhanced suffix arrays for string collections, Computing regularities in strings: a survey, Unnamed Item, Wee LCP, Permuted Longest-Common-Prefix Array, Dichotomic Selection on Words: A Probabilistic Analysis, Inducing Suffix and LCP Arrays in External Memory, LCP Array Construction in External Memory
