The longest common substring problem
From MaRDI portal
Recommendations
- Computing Longest Common Substrings Via Suffix Arrays
- Linear time algorithms for generalizations of the longest common substring problem
- Sublinear space algorithms for the longest common substring problem
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- An all-substrings common subsequence algorithm
Cites work
- A general approach to connected-component labeling for arbitrary image representations
- A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
- A linear-time algorithm for a special case of disjoint set union
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A simple and efficient union-find-delete algorithm
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings
- Algorithms on Strings, Trees and Sequences
- Automata, Languages and Programming
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Colored range queries and document retrieval
- Combinatorial Pattern Matching
- Compressed representations of sequences and full-text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix trees with full functionality
- Compressed suffix trees, efficient computation and storage of LCP-values
- Constructing suffix arrays in linear time
- Efficient Union-Find for planar graphs and other sparse graph classes
- Fast Algorithms for Finding Nearest Common Ancestors
- Faster entropy-bounded compressed suffix trees
- Fully compressed suffix trees
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1445802 (Why is no real title available?)
- LATIN 2000: Theoretical informatics. 4th Latin American symposium, Punta del Este, Uruguay, April 10--14, 2000. Proceedings
- Linear work suffix array construction
- Linearity and Unprovability of Set Union Problem Strategies
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Near real-time suffix tree construction via the fringe marked ancestor problem
- On Finding Lowest Common Ancestors in Trees
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On the sorting-complexity of suffix tree construction
- On-line construction of suffix trees
- Postorder Disjoint Set Union is Linear
- Practical compressed suffix trees
- Range median of minima queries, super-Cartesian trees, and text indexing
- Recursive Star-Tree Parallel Data Structure
- Replacing suffix trees with enhanced suffix arrays
- Space efficient linear time construction of suffix arrays
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Special issue: Average-case analysis of algorithms
- Suffix Arrays: A New Method for On-Line String Searches
- The virtual suffix tree
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Two linear time Union--Find strategies for image processing
Cited in
(5)
This page was built for publication: The longest common substring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971067)
