Pages that link to "Item:Q3637104"
From MaRDI portal
The following pages link to Linear Time Suffix Array Construction Using D-Critical Substrings (Q3637104):
Displaying 11 items.
- Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation (Q1944955) (← links)
- Optimal in-place suffix sorting (Q2672235) (← links)
- Lightweight BWT Construction for Very Large String Collections (Q3011856) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
