Linear-time suffix sorting -- a new approach for suffix array construction
From MaRDI portal
(Redirected from Publication:5369558)
Recommendations
Cited in
(20)- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Lyndon array construction during Burrows-Wheeler inversion
- Reconstructing a string from its Lyndon arrays
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order
- An elegant algorithm for the construction of suffix arrays
- More properties of the Fibonacci word on an infinite alphabet
- The parameterized suffix tray
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Inducing enhanced suffix arrays for string collections
- On the optimisation of the GSACA suffix array construction algorithm
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- Inducing the Lyndon array
- Matching statistics -- a survey
- Space efficient construction of Lyndon arrays in linear time
- Sorting circular suffixes in linear time
- Lyndon arrays simplified
- Generic non-recursive suffix array construction
- Simple (invited talk)
- Fast and lightweight distributed suffix array construction
- Fast and memory-efficient bwt construction of repetitive texts using Lyndon grammars
This page was built for publication: Linear-time suffix sorting -- a new approach for suffix array construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369558)
