Permuted Longest-Common-Prefix Array
From MaRDI portal
Publication:3637112
DOI10.1007/978-3-642-02441-2_17zbMath1247.68336OpenAlexW2143469992MaRDI QIDQ3637112
Juha Kärkkäinen, Giovanni Manzini, Simon J. Puglisi
Publication date: 7 July 2009
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_17
Related Items
Extended suffix array construction using Lyndon factors ⋮ Lightweight LCP construction for very large collections of strings ⋮ r-indexing the eBWT ⋮ Bidirectional Variable-Order de Bruijn Graphs ⋮ Optimal suffix sorting and LCP array construction for constant alphabets ⋮ In-place algorithms for exact and approximate shortest unique substring problems ⋮ Tighter Bounds for the Sum of Irreducible LCP Values ⋮ Longest Common Prefix with Mismatches ⋮ Variations of the parameterized longest previous factor ⋮ Property Suffix Array with Applications in Indexing Weighted Sequences ⋮ Practical Wavelet Tree Construction ⋮ Computational graph pangenomics: a tutorial on data structures and their applications ⋮ Accessing the suffix array via \(\phi^{-1}\)-forest ⋮ Computing longest previous non-overlapping factors ⋮ Space-efficient algorithms for computing minimal/shortest unique substrings ⋮ Parameterized longest previous factor ⋮ Computing the Burrows-Wheeler transform of a string and its reverse in parallel ⋮ Space-efficient construction of compressed suffix trees ⋮ Tight upper and lower bounds on suffix tree breadth ⋮ Better External Memory LCP Array Construction ⋮ Using static suffix array in dynamic application: case of text compression by longest first substitution ⋮ Practical compressed suffix trees ⋮ Alphabet-independent algorithms for finding context-sensitive repeats in linear time ⋮ On Suffix Tree Breadth ⋮ Lightweight BWT and LCP Merging via the Gap Algorithm ⋮ Tighter bounds for the sum of irreducible LCP values ⋮ Lempel-Ziv Factorization Revisited ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Inducing enhanced suffix arrays for string collections ⋮ Computing regularities in strings: a survey ⋮ Wee LCP ⋮ Bidirectional Text Compression in External Memory ⋮ Refining the \(r\)-index ⋮ Lightweight merging of compressed indices based on BWT variants ⋮ Dichotomic Selection on Words: A Probabilistic Analysis ⋮ Faster online computation of the succinct longest previous factor array ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ Lazy Lempel-Ziv Factorization Algorithms ⋮ LCP Array Construction in External Memory ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
Cites Work
- Replacing suffix trees with enhanced suffix arrays
- Fast BWT in small space by blockwise suffix sorting
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- The string B-tree
- An(other) Entropy-Bounded Compressed Suffix Tree
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Algorithms on Strings, Trees and Sequences
- New text indexing functionalities of the compressed suffix arrays
- Better external memory suffix array construction
- Algorithm Theory - SWAT 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Permuted Longest-Common-Prefix Array
