Approximate String Matching with Address Bit Errors

DOI10.1007/978-3-540-69068-9_13zbMath1143.68624OpenAlexW2100727610MaRDI QIDQ3506947

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

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_13

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (8)

On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ Pattern matching with address errors: rearrangement distances ⋮ Approximate string matching with stuck address bits ⋮ LCS approximation via embedding into locally non-repetitive strings ⋮ Interchange rearrangement: the element-cost model ⋮ Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances ⋮ LCS Approximation via Embedding into Local Non-repetitive Strings

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

This page was built for publication: Approximate String Matching with Address Bit Errors