Fast lightweight suffix array construction and checking
From MaRDI portal
Recommendations
Cited in
(35)- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Suffix-sorting via Shannon-Fano-Elias codes
- Engineering a lightweight suffix array construction algorithm
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
- Dynamic and internal longest common substring
- An elegant algorithm for the construction of suffix arrays
- Faster semi-external suffix sorting
- The complexity of minimum difference cover
- Fast BWT in small space by blockwise suffix sorting
- Faster suffix sorting
- Constructing suffix arrays in linear time
- Distributed suffix trees
- Tight lower bounds for the longest common extension problem
- Optimal in-place suffix sorting
- Faster lightweight Lempel-Ziv parsing
- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
- Lightweight parameterized suffix array construction
- Checking Big Suffix and LCP Arrays by Probabilistic Methods
- Longest common substring made fully dynamic
- External memory BWT and LCP computation for sequence collections with applications
- Small-space LCE data structure with constant-time queries
- Linear-time algorithm for long LCF with k mismatches
- Lightweight BWT and LCP merging via the gap algorithm
- Fast and Lightweight LCP-Array Construction Algorithms
- A quick tour on suffix arrays and compressed suffix arrays
- Space efficient algorithms for the Burrows-Wheeler backtransformation
- Parallel suffix sorting for large string analytics
- Near-optimal quantum algorithms for string problems
- Quantum algorithms for longest common and palindromic substrings in the circuit model
- Locally consistent parsing for text indexing in small space
- Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching
- Longest common substring with gaps and related problems
- Title not available (Why is no real title available?)
- Computing runs on a general alphabet
- Counting suffix arrays and strings
This page was built for publication: Fast lightweight suffix array construction and checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550827)
