Lightweight parameterized suffix array construction
From MaRDI portal
Recommendations
- Engineering a lightweight suffix array construction algorithm
- scientific article; zbMATH DE number 1947433
- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
- Fast lightweight suffix array construction and checking
- Engineering a lightweight external memory suffix array construction algorithm
Cited in
(19)- The structural border array
- Parameterized longest previous factor
- Towards a real time algorithm for parameterized longest common prefix computation
- Variations of the parameterized longest previous factor
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches
- Extended suffix array construction using Lyndon factors
- Computing the parameterized Burrows-Wheeler transform online
- Reconstructing parameterized strings from parameterized suffix and LCP arrays
- p-suffix sorting as arithmetic coding
- p-suffix sorting as arithmetic coding
- Compressed parameterized pattern matching
- Fast and Lightweight LCP-Array Construction Algorithms
- On-line construction of parameterized suffix trees for large alphabets
- Breaking a barrier in constructing compact indexes for parameterized pattern matching
- Efficient pattern matching for RNA secondary structures
- A brief history of parameterized matching problems
- Verifying and enumerating parameterized border arrays
- A prefix array for parameterized strings
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
This page was built for publication: Lightweight parameterized suffix array construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651558)
