Permuted Longest-Common-Prefix Array
From MaRDI portal
Recommendations
- Sampled Longest Common Prefix Array
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Longest Common Separable Pattern Among Permutations
- Low space external memory construction of the succinct permuted longest common prefix array
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- String inference from longest-common-prefix array
- String inference from longest-common-prefix array
- scientific article; zbMATH DE number 1786458
- The colored longest common prefix array computed via sequential scans
Cites work
- Algorithm Theory - SWAT 2004
- Algorithms on Strings, Trees and Sequences
- An(other) Entropy-Bounded Compressed Suffix Tree
- Better external memory suffix array construction
- Compressed representations of sequences and full-text indexes
- Fast BWT in small space by blockwise suffix sorting
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- New text indexing functionalities of the compressed suffix arrays
- Replacing suffix trees with enhanced suffix arrays
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Suffix Arrays: A New Method for On-Line String Searches
- The string B-tree
Cited in
(49)- Extended suffix array construction using Lyndon factors
- Practical compressed suffix trees
- Computing regularities in strings: a survey
- Variations of the parameterized longest previous factor
- Computing longest previous non-overlapping factors
- Faster online computation of the succinct longest previous factor array
- String inference from longest-common-prefix array
- r-indexing the eBWT
- Space-efficient algorithms for computing minimal/shortest unique substrings
- Space-efficient construction of compressed suffix trees
- Tight upper and lower bounds on suffix tree breadth
- Refining the \(r\)-index
- Lightweight merging of compressed indices based on BWT variants
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel
- Lightweight LCP construction for very large collections of strings
- Tighter bounds for the sum of irreducible LCP values
- Longest common prefix with mismatches
- Lempel-Ziv Factorization Revisited
- Optimal suffix sorting and LCP array construction for constant alphabets
- Sampled Longest Common Prefix Array
- Parameterized longest previous factor
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- Better external memory LCP array construction
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- Tighter bounds for the sum of irreducible LCP values
- Bidirectional Text Compression in External Memory
- Dichotomic Selection on Words: A Probabilistic Analysis
- Practical Wavelet Tree Construction
- String inference from longest-common-prefix array
- Burrows-Wheeler transform and LCP array construction in constant space
- On suffix tree breadth
- Lightweight BWT and LCP merging via the gap algorithm
- Inducing the LCP-array
- Inducing suffix and LCP arrays in external memory
- Lazy Lempel-Ziv factorization algorithms
- LCP array construction in external memory
- Inducing enhanced suffix arrays for string collections
- Space-efficient parallel construction of succinct representations of suffix tree topologies
- Bidirectional Variable-Order de Bruijn Graphs
- Property Suffix Array with Applications in Indexing Weighted Sequences
- The colored longest common prefix array computed via sequential scans
- Computational graph pangenomics: a tutorial on data structures and their applications
- Accessing the suffix array via \(\phi^{-1}\)-forest
- r-indexing the eBWT
- Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
- Exploiting new properties of string net frequency for efficient computation
- Optimal-time queries on BWT-runs compressed indexes
- Wee LCP
This page was built for publication: Permuted Longest-Common-Prefix Array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637112)
