Linear-time construction of suffix arrays (extended abstract)
From MaRDI portal
Publication:3550835
DOI10.1007/3-540-44888-8_14zbMATH Open1279.68068OpenAlexW1495956867MaRDI QIDQ3550835FDOQ3550835
Authors: Dong Kyue Kim, Heejin Park, J. S. Sim, Kunsoo Park 
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_14
Recommendations
Cited In (42)
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Space efficient linear time construction of suffix arrays
- Efficient algorithms for three variants of the LPF table
- Parallel suffix sorting for large string analytics
- Title not available (Why is that?)
- A quick tour on suffix arrays and compressed suffix arrays
- Faster entropy-bounded compressed suffix trees
- Replacing suffix trees with enhanced suffix arrays
- Space efficient linear time construction of suffix arrays
- Fast profile matching algorithms - A survey
- On demand string sorting over unbounded alphabets
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- Extended suffix array construction using Lyndon factors
- Construction of Aho Corasick automaton in linear time for integer alphabets
- Computing regularities in strings: a survey
- Dynamic extended suffix arrays
- A note on the Burrows-Wheeler transformation
- Lightweight BWT construction for very large string collections
- A theoretical and experimental study on the construction of suffix arrays in external memory
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Approximate string matching using compressed suffix arrays
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
- A metric index for approximate string matching
- The “Runs” Theorem
- An elegant algorithm for the construction of suffix arrays
- Algorithms for Indexing Highly Similar DNA Sequences
- Computing the longest previous factor
- On the combinatorics of suffix arrays
- Faster suffix sorting
- The affix array data structure and its applications to RNA secondary structure analysis
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Constructing suffix arrays in linear time
- Optimal in-place suffix sorting
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Locating maximal approximate runs in a string
- Period recovery of strings over the Hamming and edit distances
- Computing suffix links for suffix trees and arrays
- Lossless filter for multiple repetitions with Hamming distance
- Text indexing with errors
- Linear-time period computation of a string with suffix trees
- 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)
