Approximate string matching with address bit errors

DOI10.1016/J.TCS.2009.09.010zbMath1187.68175OpenAlexW2102492161MaRDI QIDQ1038472

Amihood Amir, Avivit Levy, Oren Kapah, Yonatan Aumann, Ely Porat

Publication date: 18 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.010

zbMATH Keywords

approximate string matchingaddress errorsstrings rearrangement metrics

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Related Items (1)

Approximate string matching with stuck address bits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting permutations by block-interchanges
• Overlap matching.
• Approximate swapped matching.
• Verifying candidate matches in sparse and wildcard matching
• Pattern matching with address errors
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• An Extension of the String-to-String Correction Problem
• Sorting by Transpositions
• On the Cost of Interchange Rearrangement in Strings

This page was built for publication: Approximate string matching with address bit errors