A Space-Economical Suffix Tree Construction Algorithm

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

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
On the construction of classes of suffix trees for square matrices: algorithms and applications
Efficient discovery of unusual patterns in time series
On suffix extensions in suffix trees
La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
Construction of Aho Corasick automaton in linear time for integer alphabets
Compressing dictionary matching index via sparsification technique
Finding the longest common nonsuperstring in linear time
A new distance metric on strings computable in linear time
La reconnaissance des facteurs d'un mot dans un texte
Detection of periodicities and string-matching in real time
Suffix tree characterization of maximal motifs in biological sequences
Discovering unbounded unions of regular pattern languages from positive examples
Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
On the relationship between histogram indexing and block-mass indexing
Data structures and algorithms for approximate string matching
A time and space efficient data structure for string searching on large texts
Title not available (Why is that?)
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
Alphabet-dependent string searching with wexponential search trees
Discovering subword associations in strings in time linear in the output size
Partial words and the critical factorization theorem
Partial words and the critical factorization theorem revisited
Linear-time construction of two-dimensional suffix trees
On-line construction of two-dimensional suffix trees
Space-time trade-offs for finding shortest unique substrings and maximal unique matches
String matching with weighted errors
Parallel construction of minimal suffix and factor automata
Efficient enumeration of maximal induced bicliques
Structural properties of the string statistics problem
Generalizations of suffix arrays to multi-dimensional matrices.
Verifying and enumerating parameterized border arrays
On-line string matching with feedback
Truncated suffix trees and their application to data compression.
Fast prefix matching of bounded strings
Text indexing with errors
A grouping approach for succinct dynamic dictionary matching
Comparing bacterial genomes from linear orders of patterns
The longest common substring problem
Title not available (Why is that?)
Parallel string matching with k mismatches
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

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)