Linear-time construction of suffix arrays (extended abstract)
From MaRDI portal
Publication:3550835
Recommendations
Cited in
(44)- Space efficient linear time construction of suffix arrays
- An elegant algorithm for the construction of suffix arrays
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Computing regularities in strings: a survey
- Fast profile matching algorithms - A survey
- Period recovery of strings over the Hamming and edit distances
- Dynamic extended suffix arrays
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- The ``runs theorem
- A note on the Burrows-Wheeler transformation
- Lightweight BWT construction for very large string collections
- On demand string sorting over unbounded alphabets
- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
- Parallel suffix sorting for large string analytics
- A quick tour on suffix arrays and compressed suffix arrays
- Computing suffix links for suffix trees and arrays
- Extended suffix array construction using Lyndon factors
- Efficient algorithms for three variants of the LPF table
- Computing the longest previous factor
- Construction of Aho Corasick automaton in linear time for integer alphabets
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- Faster entropy-bounded compressed suffix trees
- A metric index for approximate string matching
- Constructing suffix arrays in linear time
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Algorithms for indexing highly similar DNA sequences
- Lossless filter for multiple repetitions with Hamming distance
- A theoretical and experimental study on the construction of suffix arrays in external memory
- On the combinatorics of suffix arrays
- Linear-time suffix sorting -- a new approach for suffix array construction
- Replacing suffix trees with enhanced suffix arrays
- Optimal in-place suffix sorting
- Text indexing with errors
- Space efficient linear time construction of suffix arrays
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Faster suffix sorting
- Approximate string matching using compressed suffix arrays
- Linear-time period computation of a string with suffix trees
- Locating maximal approximate runs in a string
- The affix array data structure and its applications to RNA secondary structure analysis
- scientific article; zbMATH DE number 7559194 (Why is no real title available?)
- Linear time algorithms for generalizations of the longest common substring problem
This page was built for publication: Linear-time construction of suffix arrays (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550835)
