A Space-Economical Suffix Tree Construction Algorithm

Cited In (only showing first 100 items - show all)

Compact directed acyclic word graphs for a sliding window
Dynamic dictionary matching
Efficient detection of quasiperiodicities in strings
Efficient index for retrieving top-\(k\) most frequent documents
Ultra-succinct representation of ordered trees with applications
Reverse engineering of compact suffix trees and links: a novel algorithm
Multiple matching of parameterized patterns
Inferring strings from suffix trees and links on a binary alphabet
Approximate string-matching with \(q\)-grams and maximal matches
A quick tour on suffix arrays and compressed suffix arrays
Space efficient linear time construction of suffix arrays
Sublinear approximate string matching and biological applications
Fast profile matching algorithms - A survey
On-line suffix tree construction with reduced branching
A new efficient indexing algorithm for one-dimensional real scaled patterns
On demand string sorting over unbounded alphabets
Improved space-time tradeoffs for approximate full-text indexing with one edit error
Linear time algorithm for the longest common repeat problem
Property matching and weighted matching
An index data structure for matrices, with applications to fast two-dimensional pattern matching
Two-dimensional substring indexing.
Dynamic suffix tree and two-dimensional texts management
Computing regularities in strings: a survey
PSIST: a scalable approach to indexing protein structures using suffix trees
Dynamic extended suffix arrays
Detecting leftmost maximal periodicities
Optimal encoding of non-stationary sources
Time-optimal top-\(k\) document retrieval
Online timestamped text indexing
Linear-size suffix tries
The property suffix tree with dynamic properties
Lyndon words, permutations and trees.
Approximate string matching using compressed suffix arrays
Range LCP
Compressed indexes for approximate string matching
Simple and flexible detection of contiguous repeats using a suffix tree
Locally compressed suffix arrays
A metric index for approximate string matching
Efficient computation of shortest absent words in a genomic sequence
Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
In-place update of suffix array while recoding words
Optimal off-line detection of repetitions in a string
Parallel construction of a suffix tree with applications
Real two dimensional scaled matching
Data structures and algorithms for the string statistics problem
The smallest automaton recognizing the subwords of a text
An \(O(ND)\) difference algorithm and its variations
The suffix tree of a tree and minimizing sequential transducers
An efficient algorithm for the all pairs suffix-prefix problem
On finding common subtrees
Data compression with long repeated strings
Two-dimensional dictionary matching
Orthogonal range searching for text indexing
Space-efficient frameworks for top-\(k\) string retrieval
On average sequence complexity
Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
Computing the longest previous factor
Linear time algorithms for finding and representing all the tandem repeats in a string
On-line construction of compact directed acyclic word graphs
Quick greedy computation for minimum common string partition
The affix array data structure and its applications to RNA secondary structure analysis
Average sizes of suffix trees and DAWGs
Reducing space for index implementation.
On-line construction of suffix trees
Constructing suffix arrays in linear time
On-line construction of parameterized suffix trees for large alphabets
Indexing factors with gaps
Approximation algorithms for the shortest common superstring problem
Transducers and repetitions
Scalability and communication in parallel low-complexity lossless compression
A linear size index for approximate pattern matching
Geometric BWT: compressed text indexing via sparse suffixes and range searching
Distributed suffix trees
Faster index for property matching
Succinct indexes for reporting discriminating and generic words
Compressed text indexing with wildcards
Generalized substring compression
Wavelet trees for all
Computing suffix links for suffix trees and arrays
On-line construction of compact suffix vectors and maximal repeats
A new decomposition technique for maximal clique enumeration for sparse graphs
An output sensitive algorithm for maximal clique enumeration in sparse graphs
On the string matching with \(k\) mismatches
Quick greedy computation for minimum common string partitions
Seed-driven learning of position probability matrices from large sequence sets
Words over an ordered alphabet and suffix permutations
Two-dimensional dynamic dictionary matching
Optimal prefix and suffix queries on texts
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
Improving on-line construction of two-dimensional suffix trees for square matrices
Indexing Circular Patterns
Practical compressed suffix trees
Dynamic dictionary matching with failure functions
Generalizations of suffix arrays to multi-dimensional matrices.
Time optimal left to right construction of position trees
Ternary directed acyclic word graphs
On updating suffix tree labels
Cache-oblivious index for approximate string matching
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
Pattern matching in a digitized image

This page was built for publication: A Space-Economical Suffix Tree Construction Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4095870)