Sequence matching with binary codes

DOI10.1016/0020-0190(90)90159-UMaRDI QIDQ911265zbMATH OpenOpenAlexFDO

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

Recommendations

• Matching strings in encoded sequences
• Byte-aligned pattern matching in encoded genomic sequences
• scientific article; zbMATH DE number 716160
• scientific article; zbMATH DE number 4168387
• An algorithm for matching run-length coded strings
• Matching for run-length encoded strings
• Sequences of optimal identifying codes

Cites work

• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• scientific article; zbMATH DE number 3414190 (Why is no real title available?)
• An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
• Bounds for the String Editing Problem
• Error detecting and error correcting codes
• On the inadequacy of tournament algorithms for the \(N\)-SCS problem
• The Complexity of Some Problems on Subsequences and Supersequences
• The String-to-String Correction Problem

Cited in

(4)

• Parallel application of Levenshtein distance to establish similarity between strings
• scientific article; zbMATH DE number 4168387 (Why is no real title available?)
• Sequence acquisition using bit estimation techniques
• Harry: a tool for measuring string similarity

This page was built for publication: Sequence matching with binary codes

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