Replacing suffix trees with enhanced suffix arrays
From MaRDI portal
(Redirected from Publication:876707)
Recommendations
Cites work
- A universal algorithm for sequential data compression
- Algorithms on Strings, Trees and Sequences
- An experimental study of an opportunistic index
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compression of individual sequences via variable-rate coding
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 1945184 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 2087050 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- scientific article; zbMATH DE number 5262877 (Why is no real title available?)
- scientific article; zbMATH DE number 6472611 (Why is no real title available?)
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Linear-time construction of suffix arrays (extended abstract)
- Space efficient linear time construction of suffix arrays
- Sublinear approximate string matching and biological applications
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(94)- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Faster entropy-bounded compressed suffix trees
- Suffix-sorting via Shannon-Fano-Elias codes
- A fast algorithm for the all-pairs suffix-prefix problem
- The principles of informational genomics
- Motif trie: an efficient text index for pattern discovery with don't cares
- Practical compressed suffix trees
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
- Computing regularities in strings: a survey
- Indexing and querying character sets in one- and two-dimensional words
- The exact multiple pattern matching problem solved by a reference tree approach
- Faster online computation of the succinct longest previous factor array
- String inference from longest-common-prefix array
- Spectral concepts in genome informational analysis
- Succinct non-overlapping indexing
- Sliding suffix tree
- An external-memory algorithm for string graph construction
- Engineering a lightweight external memory suffix array construction algorithm
- On succinct representations of binary trees
- Locating maximal approximate runs in a string
- Note on the greedy parsing optimality for dictionary-based text compression
- The affix array data structure and its applications to RNA secondary structure analysis
- Longest repeats with a block of \(k\) don't cares
- Space efficient linear time construction of suffix arrays
- Lightweight LCP construction for very large collections of strings
- An improved algorithm for the all-pairs suffix-prefix problem
- Faster repetition-aware compressed suffix trees based on block trees
- Optimal in-place suffix sorting
- Locally compressed suffix arrays
- Crochemore's repetitions algorithm revisited: computing runs
- Efficient construction of a compressed de Bruijn graph for pan-genome analysis
- Succinct Non-overlapping Indexing
- Tighter bounds for the sum of irreducible LCP values
- Large-scale detection of repetitions
- Indexing a sequence for mapping reads with a single mismatch
- The longest common substring problem
- Lempel-Ziv Factorization Revisited
- Sparse and truncated suffix trees on variable-length codes
- Full-text indexes for high-throughput sequencing
- DNA-seq error correction based on substring indices
- Kings, name days, lazy servants and magic
- From Suffix Trees to Suffix Vectors
- An Online Algorithm for Finding the Longest Previous Factors
- Online Suffix Tree Construction for Streaming Sequences
- Permuted Longest-Common-Prefix Array
- In-place update of suffix array while recoding words
- The virtual suffix tree
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- String matching with alphabet sampling
- Searching for smallest grammars on large sequences and application to DNA
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics
- scientific article; zbMATH DE number 1945184 (Why is no real title available?)
- scientific article; zbMATH DE number 2081033 (Why is no real title available?)
- Better external memory LCP array construction
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- Tighter bounds for the sum of irreducible LCP values
- Simulating the DNA overlap graph in succinct space
- Finding all maximal perfect haplotype blocks in linear time
- Burrows-Wheeler transform and LCP array construction in constant space
- Engineering parallel string sorting
- LCP array construction in external memory
- Faster compressed suffix trees for repetitive collections
- Inducing enhanced suffix arrays for string collections
- Space-efficient parallel construction of succinct representations of suffix tree topologies
- String Processing and Information Retrieval
- Property Suffix Array with Applications in Indexing Weighted Sequences
- String Covering: A Survey
- Computational graph pangenomics: a tutorial on data structures and their applications
- Fast, practical algorithms for computing all the repeats in a string
- Finding range minima in the middle: approximations and applications
- On the computation of longest previous non-overlapping factors
- Faster repetition-aware compressed suffix trees based on block trees
- Computing all-vs-all MEMs in grammar-compressed text
- Matching statistics -- a survey
- Quantum data structure for range minimum query
- Exploiting new properties of string net frequency for efficient computation
- Maintaining the size of LZ77 on semi-dynamic strings
- Computing the LCP array of a labeled graph
- Formally verified suffix array construction
- On space efficient two dimensional range minimum data structures
- Height-bounded Lempel-Ziv encodings
- Enhancing generalized compressed suffix trees, with applications
- Construction of Aho Corasick automaton in linear time for integer alphabets
- Computing suffix links for suffix trees and arrays
- Fast profile matching algorithms - A survey
- Counting suffix arrays and strings
- Converting suffix trees into factor/suffix oracles
- DARN! A weighted constraint solver for RNA motif localization
- On-line construction of compact suffix vectors and maximal repeats
- Kernel-based machine learning for fast text mining in R
- Computing longest previous factor in linear time and applications
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- Wee LCP
This page was built for publication: Replacing suffix trees with enhanced suffix arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876707)
