The following pages link to Algorithm Theory - SWAT 2004 (Q5315389):
Displaying 19 items.
- On the number of elements to reorder when updating a suffix array (Q414460) (← links)
- Parameterized longest previous factor (Q441845) (← 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)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- Wee LCP (Q991794) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel (Q2442813) (← links)
- Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- Dichotomic Selection on Words: A Probabilistic Analysis (Q5088910) (← links)
- (Q5090335) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
