Sequence matching with binary codes

DOI10.1016/0020-0190(90)90159-UzbMath0696.68042OpenAlexW2074967255MaRDI QIDQ911265

James H. Bradford

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90159-u

zbMATH Keywords

pattern matchingtheory of computationsequence comparisonstring-to- string editing problem

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99) Algorithms in computer science (68W99)

Cites Work

• On the inadequacy of tournament algorithms for the \(N\)-SCS problem
• An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
• Bounds for the String Editing Problem
• The Complexity of Some Problems on Subsequences and Supersequences
• The String-to-String Correction Problem
• Error Detecting and Error Correcting Codes
• Unnamed Item
• Unnamed Item