Pages that link to "Item:Q3637112"
From MaRDI portal
The following pages link to Permuted Longest-Common-Prefix Array (Q3637112):
Displaying 38 items.
- Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- Wee LCP (Q991794) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- Computing longest previous non-overlapping factors (Q1944092) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Tight upper and lower bounds on suffix tree breadth (Q2220861) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel (Q2442813) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
- Longest Common Prefix with Mismatches (Q2949838) (← links)
- Lempel-Ziv Factorization Revisited (Q3011840) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- Dichotomic Selection on Words: A Probabilistic Analysis (Q5088910) (← links)
- Practical Wavelet Tree Construction (Q5102058) (← links)
- On Suffix Tree Breadth (Q5150919) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
