Sequence matching with binary codes

DOI10.1016/0020-0190(90)90159-UzbMATH Open0696.68042OpenAlexW2074967255MaRDI QIDQ911265FDOQ911265

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

Recommendations

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

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

• Error detecting and error correcting codes
• Title not available (Why is that?)
• The String-to-String Correction Problem
• Bounds for the String Editing Problem
• The Complexity of Some Problems on Subsequences and Supersequences
• An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
• On the inadequacy of tournament algorithms for the \(N\)-SCS problem
• Title not available (Why is that?)

Cited In (4)

• Harry: a tool for measuring string similarity
• Title not available (Why is that?)
• Parallel application of Levenshtein distance to establish similarity between strings
• Sequence acquisition using bit estimation techniques

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)