A Space-Economical Suffix Tree Construction Algorithm

Cited in

(only showing first 100 items - show all)

Optimal off-line detection of repetitions in a string
A time and space efficient data structure for string searching on large texts
Compressed indexes for approximate string matching
Simple and flexible detection of contiguous repeats using a suffix tree
Parallel construction of a suffix tree with applications
Indexing a sequence for mapping reads with a single mismatch
Finding patterns and periods in Cartesian tree matching
Real two dimensional scaled matching
Two-dimensional pattern matching on a dynamic library of texts
The smallest automaton recognizing the subwords of a text
Data structures and algorithms for the string statistics problem
An \(O(ND)\) difference algorithm and its variations
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
The suffix tree of a tree and minimizing sequential transducers
scientific article; zbMATH DE number 1862357 (Why is no real title available?)
An efficient algorithm for the all pairs suffix-prefix problem
On finding common subtrees
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
Discovering subword associations in strings in time linear in the output size
Alphabet-dependent string searching with wexponential search trees
Partial words and the critical factorization theorem
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
Two-dimensional dictionary matching
Indexing and querying character sets in one- and two-dimensional words
Data compression with long repeated strings
Partial words and the critical factorization theorem revisited
On average sequence complexity
Orthogonal range searching for text indexing
Space-efficient frameworks for top-\(k\) string retrieval
Linear-time construction of two-dimensional suffix trees
Cartesian Tree Matching and Indexing
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
Validating the Knuth-Morris-Pratt failure function, fast and online
Quick greedy computation for minimum common string partition
Average sizes of suffix trees and DAWGs
The affix array data structure and its applications to RNA secondary structure analysis
Reducing space for index implementation.
On-line construction of suffix trees
On-line construction of two-dimensional suffix trees
Constructing suffix arrays in linear time
On-line construction of parameterized suffix trees for large alphabets
Faster repetition-aware compressed suffix trees based on block trees
Optimal in-place suffix sorting
String matching with weighted errors
Parallel construction of minimal suffix and factor automata
Space-time trade-offs for finding shortest unique substrings and maximal unique matches
Position-restricted substring searching over small alphabets
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
String editing under pattern constraints
Fast average-case pattern matching by multiplexing sparse tables
Indexing factors with gaps
Approximation algorithms for the shortest common superstring problem
Transducers and repetitions
Efficient enumeration of maximal induced bicliques
Scalability and communication in parallel low-complexity lossless compression
Structural properties of the string statistics problem
A linear size index for approximate pattern matching
Geometric BWT: compressed text indexing via sparse suffixes and range searching
Succinct indexes for reporting discriminating and generic words
Distributed suffix trees
A brief history of parameterized matching problems
Verifying and enumerating parameterized border arrays
Faster index for property matching
On-line string matching with feedback
Efficient computation of substring equivalence classes with suffix arrays
Motif trie: an efficient text index for pattern discovery with don't cares
Generalizations of suffix arrays to multi-dimensional matrices.
Truncated suffix trees and their application to data compression.
Compressed text indexing with wildcards
Generalized substring compression
Computing suffix links for suffix trees and arrays
Wavelet trees for all
Construction of a de Bruijn graph for assembly from a truncated suffix tree
ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
Efficient CRCW-PRAM algorithms for universal substring searching
On-line construction of compact suffix vectors and maximal repeats
Counter based suffix tree for DNA pattern repeats
A grouping approach for succinct dynamic dictionary matching
Text indexing with errors
The suffix binary search tree and suffix AVL tree
Comparing bacterial genomes from linear orders of patterns
A new decomposition technique for maximal clique enumeration for sparse graphs
Faster compressed suffix trees for repetitive collections
Fast prefix matching of bounded strings
On position restricted substring searching in succinct space
ABBA: adaptive Brownian bridge-based symbolic aggregation of time series
INDEXING GAPPED-FACTORS USING A TREE
The longest common substring problem
An output sensitive algorithm for maximal clique enumeration in sparse graphs
scientific article; zbMATH DE number 3864532 (Why is no real title available?)
On the string matching with \(k\) mismatches
Quick greedy computation for minimum common string partitions
Parallel string matching with k mismatches
Computing all-vs-all MEMs in grammar-compressed 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)