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
Fast compressed self-indexes with deterministic linear-time construction
Full-text indexes for high-throughput sequencing
String-matching and alignment algorithms for finding motifs in NGS data
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
Faster online computation of the succinct longest previous factor array
Suffix arrays for multiple strings: a method for on-line multiple string searches
Parallel suffix sorting for large string analytics
Generalized substring selectivity estimation
Dictionary matching with a few gaps
A linear time lower bound on McCreight and general updating algorithms for suffix trees
Towards a real time algorithm for parameterized longest common prefix computation
Sliding suffix tree
Online Suffix Tree Construction for Streaming Sequences
Quantum algorithm for lexicographically minimal string rotation
Optimal parallel suffix tree construction
Sparse suffix trees
Title not available (Why is that?)
Algorithms for extracting motifs from biological weighted sequences
Faster repetition-aware compressed suffix trees based on block trees
The virtual suffix tree
Dynamic dictionary matching in external memory
On suffix tree detection
An Evolutionary Distance Based on Maximal Unique Matches
Algorithms for indexing highly similar DNA sequences
Optimal data compression algorithm
Parallel construction and query of index data structures for pattern matching on square matrices
Sparse and truncated suffix trees on variable-length codes
Locally maximal common factors as a tool for efficient dynamic string algorithms
DNA-seq error correction based on substring indices
A speed-up for the commute between subword trees and DAWGs.
Two-dimensional pattern matching on a dynamic library of texts
Indexing a sequence for mapping reads with a single mismatch
Finding patterns and periods in Cartesian tree matching
Forty Years of Text Indexing
Universal Data Compression Algorithm Based on Approximate String Matching
REACHABILITY ON SUFFIX TREE GRAPHS
Lempel-Ziv data compression on parallel and distributed systems
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
Indexing and querying character sets in one- and two-dimensional words
Cartesian Tree Matching and Indexing
Validating the Knuth-Morris-Pratt failure function, fast and online
Faster repetition-aware compressed suffix trees based on block trees
Optimal in-place suffix sorting
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
String editing under pattern constraints
Position-restricted substring searching over small alphabets

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)