A Space-Economical Suffix Tree Construction Algorithm
From MaRDI portal
Publication:4095870
Cited in
(only showing first 100 items - show all)- Compact directed acyclic word graphs for a sliding window
- On representations of ternary order relations in numeric strings
- Words over an ordered alphabet and suffix permutations
- Fast compressed self-indexes with deterministic linear-time construction
- Optimal prefix and suffix queries on texts
- Full-text indexes for high-throughput sequencing
- String-matching and alignment algorithms for finding motifs in NGS data
- Dynamic dictionary matching
- Improving on-line construction of two-dimensional suffix trees for square matrices
- Two-dimensional dynamic dictionary matching
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
- Faster online computation of the succinct longest previous factor array
- Efficient detection of quasiperiodicities in strings
- Indexing Circular Patterns
- Efficient index for retrieving top-\(k\) most frequent documents
- Generalized substring selectivity estimation
- Ultra-succinct representation of ordered trees with applications
- Suffix arrays for multiple strings: a method for on-line multiple string searches
- Dictionary matching with a few gaps
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Multiple matching of parameterized patterns
- Parallel suffix sorting for large string analytics
- 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
- Dynamic dictionary matching with failure functions
- Inferring strings from suffix trees and links on a binary alphabet
- Practical compressed suffix trees
- Sliding suffix tree
- Approximate string-matching with q-grams and maximal matches
- Time optimal left to right construction of position trees
- Generalizations of suffix arrays to multi-dimensional matrices.
- A quick tour on suffix arrays and compressed suffix arrays
- Sublinear approximate string matching and biological applications
- On-line suffix tree construction with reduced branching
- A new efficient indexing algorithm for one-dimensional real scaled patterns
- Fast profile matching algorithms - A survey
- On demand string sorting over unbounded alphabets
- Space efficient linear time construction of suffix arrays
- Online Suffix Tree Construction for Streaming Sequences
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- Ternary directed acyclic word graphs
- On updating suffix tree labels
- Quantum algorithm for lexicographically minimal string rotation
- Cache-oblivious index for approximate string matching
- Linear time algorithm for the longest common repeat problem
- Property matching and weighted matching
- scientific article; zbMATH DE number 7559174 (Why is no real title available?)
- Algorithms for extracting motifs from biological weighted sequences
- Optimal parallel suffix tree construction
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- Sparse suffix trees
- Pattern matching in a digitized image
- Efficient discovery of unusual patterns in time series
- On suffix extensions in suffix trees
- An index data structure for matrices, with applications to fast two-dimensional pattern matching
- Dynamic dictionary matching in external memory
- Faster repetition-aware compressed suffix trees based on block trees
- Dynamic suffix tree and two-dimensional texts management
- On the construction of classes of suffix trees for square matrices: algorithms and applications
- Two-dimensional substring indexing.
- The virtual suffix tree
- Construction of Aho Corasick automaton in linear time for integer alphabets
- 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)
- Finding the longest common nonsuperstring in linear time
- PSIST: a scalable approach to indexing protein structures using suffix trees
- Compressing dictionary matching index via sparsification technique
- Dynamic extended suffix arrays
- Computing regularities in strings: a survey
- A new distance metric on strings computable in linear time
- Detecting leftmost maximal periodicities
- Online timestamped text indexing
- Linear-size suffix tries
- The property suffix tree with dynamic properties
- Optimal data compression algorithm
- An Evolutionary Distance Based on Maximal Unique Matches
- Parallel construction and query of index data structures for pattern matching on square matrices
- La reconnaissance des facteurs d'un mot dans un texte
- Algorithms for indexing highly similar DNA sequences
- Lyndon words, permutations and trees.
- On suffix tree detection
- Time-optimal top-\(k\) document retrieval
- Detection of periodicities and string-matching in real time
- Optimal encoding of non-stationary sources
- Sparse and truncated suffix trees on variable-length codes
- Suffix tree characterization of maximal motifs in biological sequences
- Approximate string matching using compressed suffix arrays
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- DNA-seq error correction based on substring indices
- Discovering unbounded unions of regular pattern languages from positive examples
- Locally maximal common factors as a tool for efficient dynamic string algorithms
- A speed-up for the commute between subword trees and DAWGs.
- On the relationship between histogram indexing and block-mass indexing
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
- A metric index for approximate string matching
- Efficient computation of shortest absent words in a genomic sequence
- Data structures and algorithms for approximate string matching
- Locally compressed suffix arrays
- Range LCP
- In-place update of suffix array while recoding words
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)