Space Efficient Linear Time Construction of Suffix Arrays
From MaRDI portal
Publication:3550836
DOI10.1007/3-540-44888-8_15zbMath1279.68069OpenAlexW117230746MaRDI QIDQ3550836
Publication date: 6 April 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44888-8_15
Related Items
Approximate string matching using compressed suffix arrays, A metric index for approximate string matching, Indeterminate string factorizations and degenerate text transformations, Construction of Aho Corasick automaton in linear time for integer alphabets, Computing suffix links for suffix trees and arrays, \(V\)-order: new combinatorial properties \& a simple comparison algorithm, Replacing suffix trees with enhanced suffix arrays, A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm, EERTREE: an efficient data structure for processing palindromes in strings, Extracting powers and periods in a word from its runs structure, Efficient seed computation revisited, Optimal in-place suffix sorting, Efficient algorithms for three variants of the LPF table, On the number of elements to reorder when updating a suffix array, Fast, practical algorithms for computing all the repeats in a string, On demand string sorting over unbounded alphabets, A survey of string orderings and their application to the Burrows-Wheeler transform, A bijective variant of the Burrows-Wheeler transform using \(V\)-order, On the combinatorics of suffix arrays, Text indexing with errors, Fast profile matching algorithms - A survey, Algorithms for Indexing Highly Similar DNA Sequences, Faster suffix sorting, Binary block order Rouen transform, An elegant algorithm for the construction of suffix arrays, Computing regularities in strings: a survey, Computing the longest previous factor, Linear time algorithms for generalizations of the longest common substring problem, A note on the Burrows-Wheeler transformation, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order, Unnamed Item, Lossless filter for multiple repetitions with Hamming distance, Linear Time Suffix Array Construction Using D-Critical Substrings, Faster entropy-bounded compressed suffix trees, Constructing suffix arrays in linear time
