Periodic String Comparison
From MaRDI portal
Publication:3637113
DOI10.1007/978-3-642-02441-2_18zbMath1247.68338OpenAlexW1845007662MaRDI QIDQ3637113
Publication date: 7 July 2009
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_18
Related Items (3)
Periodic words, common subsequences and frogs ⋮ Efficient all path score computations on grid graphs ⋮ Fast distance multiplication of unit-Monge matrices
Cites Work
- Semi-local string comparison: algorithmic techniques and applications
- Semi-local longest common subsequences in subquadratic time
- Approximate matching of regular expressions
- A faster algorithm computing string edit distances
- Identifying periodic occurrences of a template with applications to protein structure
- Tandem cyclic alignment
- An all-substrings common subsequence algorithm
- Two algorithms for LCS consecutive suffix alignment
- On the Common Substring Alignment Problem
- The theory and computation of evolutionary distances: Pattern recognition
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- The String-to-String Correction Problem
This page was built for publication: Periodic String Comparison
