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

DOI10.1016/S0304-3975(97)00280-6zbMATH Open0902.68175OpenAlexW2031708572MaRDI QIDQ1129017FDOQ1129017

Authors: 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

Recommendations

• On a cyclic string-to-string correction problem
• The selective fixing algorithm for the closest string problem
• Charge and reduce: A fixed-parameter algorithm for string-to-string correction
• Publication:4733401
• An Improved Algorithm For Approximate String Matching
• scientific article; zbMATH DE number 714495
• Improved LP-based algorithms for the closest string problem
• scientific article; zbMATH DE number 4172389

zbMATH Keywords

algorithmscyclic patternsbanded string-to-string correction

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• The String-to-String Correction Problem
• Efficient Huffman decoding
• Title not available (Why is that?)
• An algorithm for matching run-length coded strings
• On a cyclic string-to-string correction problem

Cited In (5)

• A fast algorithm for stereo matching
• Title not available (Why is that?)
• On a cyclic string-to-string correction problem
• Computational geometric aspects of rhythm, melody, and voice-leading
• APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129017)