An improved algorithm for solving the banded cyclic string-to-string correction problem

DOI10.1016/S0304-3975(97)00280-6zbMath0902.68175OpenAlexW2031708572MaRDI QIDQ1129017

S. H. Smith

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00280-6

zbMATH Keywords

algorithmscyclic patternsbanded string-to-string correction

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (2)

APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS ⋮ Computational geometric aspects of rhythm, melody, and voice-leading

Cites Work

• Efficient Huffman decoding
• An algorithm for matching run-length coded strings
• On a cyclic string-to-string correction problem
• The String-to-String Correction Problem
• Unnamed Item

This page was built for publication: An improved algorithm for solving the banded cyclic string-to-string correction problem