A Space-Economical Suffix Tree Construction Algorithm

Cited in

(only showing first 100 items - show all)

Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
Real two dimensional scaled matching
Discovering subword associations in strings in time linear in the output size
The smallest automaton recognizing the subwords of a text
Structural properties of the string statistics problem
Time optimal left to right construction of position trees
Parallel string matching with k mismatches
An \(O(ND)\) difference algorithm and its variations
A new distance metric on strings computable in linear time
Data structures and algorithms for approximate string matching
Parallel construction of a suffix tree with applications
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)
The suffix tree of a tree and minimizing sequential transducers
On updating suffix tree labels
Optimal off-line detection of repetitions in a string
Fast average-case pattern matching by multiplexing sparse tables
Approximate string-matching with q-grams and maximal matches
An efficient algorithm for the all pairs suffix-prefix problem
Efficient CRCW-PRAM algorithms for universal substring searching
On finding common subtrees
Two-dimensional dictionary matching
Dynamic dictionary matching in external memory
Parallel construction and query of index data structures for pattern matching on square matrices
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
Dynamic dictionary matching with failure functions
Sublinear approximate string matching and biological applications
Pattern matching in a digitized image
Dynamic dictionary matching
A time and space efficient data structure for string searching on large texts
Generalized substring selectivity estimation
Generalizations of suffix arrays to multi-dimensional matrices.
Truncated suffix trees and their application to data compression.
Two-dimensional substring indexing.
Lyndon words, permutations and trees.
Validating the Knuth-Morris-Pratt failure function, fast and online
Position-restricted substring searching over small alphabets
Motif trie: an efficient text index for pattern discovery with don't cares
Lempel-Ziv data compression on parallel and distributed systems
Practical compressed suffix trees
A new decomposition technique for maximal clique enumeration for sparse graphs
On the string matching with \(k\) mismatches
Computing regularities in strings: a survey
Computing the longest previous factor
On-line construction of compact directed acyclic word graphs
Linear time algorithms for finding and representing all the tandem repeats in a string
Partial words and the critical factorization theorem
Indexing and querying character sets in one- and two-dimensional words
Optimal data compression algorithm
Transducers and repetitions
Average sizes of suffix trees and DAWGs
Approximation algorithms for the shortest common superstring problem
Detecting leftmost maximal periodicities
The suffix binary search tree and suffix AVL tree
Detection of periodicities and string-matching in real time
A speed-up for the commute between subword trees and DAWGs.
Reducing space for index implementation.
A linear time lower bound on McCreight and general updating algorithms for suffix trees
On-line construction of suffix trees
Data structures and algorithms for the string statistics problem
On-line construction of parameterized suffix trees for large alphabets
Efficient enumeration of maximal induced bicliques
Fast compressed self-indexes with deterministic linear-time construction
Quick greedy computation for minimum common string partition
Faster online computation of the succinct longest previous factor array
ABBA: adaptive Brownian bridge-based symbolic aggregation of time series
Finding patterns and periods in Cartesian tree matching
Towards a real time algorithm for parameterized longest common prefix computation
A brief history of parameterized matching problems
Counter based suffix tree for DNA pattern repeats
Sliding suffix tree
Dictionary matching with a few gaps
Geometric BWT: compressed text indexing via sparse suffixes and range searching
Compressing dictionary matching index via sparsification technique
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
On representations of ternary order relations in numeric strings
On position restricted substring searching in succinct space
Faster index for property matching
Indexing factors with gaps
Efficient computation of substring equivalence classes with suffix arrays
Space-time trade-offs for finding shortest unique substrings and maximal unique matches
Linking indexing data structures to de Bruijn graphs: construction and update
Compressed text indexing with wildcards
Generalized substring compression
Wavelet trees for all
Partial words and the critical factorization theorem revisited
Algorithms for extracting motifs from biological weighted sequences
Linear time algorithm for the longest common repeat problem
The affix array data structure and its applications to RNA secondary structure analysis
Constructing suffix arrays in linear time
Space efficient linear time construction of suffix arrays
Distributed suffix trees
Faster repetition-aware compressed suffix trees based on block trees
Optimal in-place suffix sorting
Construction of a de Bruijn graph for assembly from a truncated suffix tree
Locally compressed suffix arrays
Orthogonal range searching for text indexing
Dynamic suffix tree and two-dimensional texts management
Alphabet-dependent string searching with wexponential search trees
Online timestamped text indexing

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)