On-line construction of suffix trees
From MaRDI portal
Publication:1897476
Recommendations
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- Approximate string matching with suffix automata
- Data structures and algorithms for approximate string matching
- Efficient string matching
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 4078846 (Why is no real title available?)
- The smallest automaton recognizing the subwords of a text
- Time optimal left to right construction of position trees
- Transducers and repetitions
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
- Real two dimensional scaled matching
- Discovering subword associations in strings in time linear in the output size
- Data compression for proof replay
- A new method for approximate indexing and dictionary lookup with one error
- Structural properties of the string statistics problem
- Time optimal left to right construction of position trees
- Suffix trees on words
- Matching a set of strings with variable length don't cares
- Generalizations of suffix arrays to multi-dimensional matrices.
- Truncated suffix trees and their application to data compression.
- Linear bidirectional on-line construction of affix trees
- On maximal repeats in strings
- Linear-time text compression by longest-first substitution
- DNA paired fragment assembly using graph theory
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Finding maximal 2-dimensional palindromes
- A new decomposition technique for maximal clique enumeration for sparse graphs
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
- Computing regularities in strings: a survey
- On-line construction of compact directed acyclic word graphs
- Linear time algorithms for finding and representing all the tandem repeats in a string
- The suffix binary search tree and suffix AVL tree
- A speed-up for the commute between subword trees and DAWGs.
- Reducing space for index implementation.
- Generalization of a suffix tree for RNA structural pattern matching
- A linear time lower bound on McCreight and general updating algorithms for suffix trees
- Data structures and algorithms for the string statistics problem
- A comparison of imperative and purely functional suffix tree constructions
- On-line construction of parameterized suffix trees for large alphabets
- The indexing for one-dimensional proportionally-scaled strings
- Efficient enumeration of maximal induced bicliques
- Fast compressed self-indexes with deterministic linear-time construction
- Quick greedy computation for minimum common string partition
- Mining full, inner and tail periodic patterns with perfect, imperfect and asynchronous periodicity simultaneously
- The exact multiple pattern matching problem solved by a reference tree approach
- Computing minimal unique substrings for a sliding window
- Shortest unique palindromic substring queries in semi-dynamic settings
- Linear time construction of indexable elastic founder graphs
- 2-dimensional palindromes with k mismatches
- Finding patterns and periods in Cartesian tree matching
- I/O-efficient data structures for non-overlapping indexing
- Towards a real time algorithm for parameterized longest common prefix computation
- Experimental evaluation of algorithms for computing quasiperiods
- Computing longest palindromic substring after single-character or block-wise edits
- Palindromic trees for a sliding window and its applications
- Succinct non-overlapping indexing
- Absent words in a sliding window with applications
- Indexing weighted sequences: neat and efficient
- Two-dimensional maximal repetitions
- Counter based suffix tree for DNA pattern repeats
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts
- Off-line and on-line algorithms for closed string factorization
- Sliding suffix tree
- Dictionary matching with a few gaps
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- On representations of ternary order relations in numeric strings
- Near real-time suffix tree construction via the fringe marked ancestor problem
- Faster index for property matching
- Indexing factors with gaps
- Succinct 2D dictionary matching
- 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
- Generalized substring compression
- Dynamic construction of an antidictionary with linear complexity
- Linear time algorithm for the longest common repeat problem
- Computational aspects of mining maximal frequent patterns
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Distributed suffix trees
- Adaptive learning of compressible strings
- Faster repetition-aware compressed suffix trees based on block trees
- c-trie++: a dynamic trie tailored for fast prefix searches
- Double string tandem repeats
- scientific article; zbMATH DE number 1615290 (Why is no real title available?)
- Finding gapped palindromes online
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Orthogonal range searching for text indexing
- On-line construction of a small automaton for a finite set of words
- Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
- Succinct Non-overlapping Indexing
- LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Accurate and efficient methods to improve multiple circular sequence alignment
- Online timestamped text indexing
- The property suffix tree with dynamic properties
- Order-preserving indexing
- A faster algorithm for computing maximal -gapped repeats in a string
- On the relationship between histogram indexing and block-mass indexing
- Large-scale detection of repetitions
- Indexing a sequence for mapping reads with a single mismatch
- Time-optimal top-k document retrieval
- The longest common substring problem
- Palindrome pattern matching
- Sparse and truncated suffix trees on variable-length codes
- Quick greedy computation for minimum common string partitions
- Weighted automata for full-text indexing
- scientific article; zbMATH DE number 2185639 (Why is no real title available?)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
This page was built for publication: On-line construction of suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897476)
