Longest common substring with gaps and related problems
From MaRDI portal
Cites work
- A data structure for dynamic trees
- A fast algorithm for computing longest common subsequences
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
- Algorithms for the Longest Common Subsequence Problem
- An \(O(ND)\) difference algorithm and its variations
- Better approximations for tree sparsity in nearly-linear time
- Capacitated dynamic programming: faster knapsack and graph algorithms
- Chaining algorithms for multiple genome comparison
- Co-linear chaining with overlaps and gap costs
- Compact recognizers of episode sequences
- Computational geometry. Algorithms and applications.
- Computing the longest common substring with one mismatch
- Dynamic and internal longest common substring
- Efficient Alignment Free Sequence Comparison with Bounded Mismatches
- Fast Algorithms for Finding Nearest Common Ancestors
- Fast lightweight suffix array construction and checking
- Faster longest common extension queries in strings over general alphabets
- Finding Patterns with Variable Length Gaps or Don’t Cares
- scientific article; zbMATH DE number 1809602 (Why is no real title available?)
- scientific article; zbMATH DE number 910858 (Why is no real title available?)
- scientific article; zbMATH DE number 7651116 (Why is no real title available?)
- scientific article; zbMATH DE number 7740885 (Why is no real title available?)
- Linear-time algorithm for long LCF with k mismatches
- Longest common substrings with k mismatches
- More applications of the polynomial method to algorithm design
- Multiple genome alignment: chaining algorithms revisited
- Multiple serial episodes matching
- Multivariate fine-grained complexity of longest common subsequence
- Optimal suffix tree construction with large alphabets
- Quadratic conditional lower bounds for string problems and dynamic time warping
- Quorums from difference covers
- Regular expression matching with multi-strings and intervals
- Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
- SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20--24, 2020. Proceedings
- String matching with variable length gaps
- The fine-grained complexity of episode matching
- Transposition invariant string matching
- Window-accumulated subsequence matching problem is linear
This page was built for publication: Longest common substring with gaps and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253069)
