On a cyclic string-to-string correction problem

DOI10.1016/0020-0190(90)90109-BzbMath0697.68044MaRDI QIDQ911767

Maurice Maes

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithms; pattern matching; cyclic strings; string-to-string correction problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

Related Items

FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES, Crossing Number of Graphs with Rotation Systems, Monge properties of sequence alignment, Crossing numbers of graphs with rotation systems, Computational geometric aspects of rhythm, melody, and voice-leading, Longest common subsequence problem for unoriented and cyclic strings, Approximate labelled subtree homeomorphism, Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time, An improved algorithm for solving the banded cyclic string-to-string correction problem, Tandem cyclic alignment, Tree edit distance with gaps, An all-substrings common subsequence algorithm, APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS

Cites Work

• Optimal matching of deformed patterns with positional influence
• A linear space algorithm for computing maximal common subsequences
• Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns
• The String-to-String Correction Problem