Approximate string matching with stuck address bits

DOI10.1016/J.TCS.2011.02.044zbMath1216.68351OpenAlexW2001400070MaRDI QIDQ551176

Avivit Levy, Ely Porat, Estrella Eisenberg, Amihood Amir, Orgad Keller

Publication date: 14 July 2011

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

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

zbMATH Keywords

pattern matchingapproximate string matchingaddress errorsstring rearrangement metrics

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

On the relationship between histogram indexing and block-mass indexing

Cites Work

• Unnamed Item
• Sorting permutations by block-interchanges
• Interchange rearrangement: the element-cost model
• Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
• Pattern matching with address errors: rearrangement distances
• Approximate string matching with address bit errors
• Overlap matching.
• Approximate swapped matching.
• Beyond the flow decomposition barrier
• Approximate String Matching with Address Bit Errors
• String Rearrangement Metrics: A Survey
• Pattern matching with address errors
• An Extension of the String-to-String Correction Problem
• Sorting by Transpositions
• Asynchronous Pattern Matching
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• On the Cost of Interchange Rearrangement in Strings

This page was built for publication: Approximate string matching with stuck address bits