Pattern matching with address errors
From MaRDI portal
Publication:3581523
DOI10.1145/1109557.1109692zbMath1192.68813OpenAlexW4238368239MaRDI QIDQ3581523
Uzi Vishne, Ohad Lipsky, Amihood Amir, Levy Avivit, Yonatan Aumann, Ely Porat, Steven S. Skiena, Gary Benson
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109692
Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)
Related Items (11)
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ Approximate String Matching with Address Bit Errors ⋮ String matching with up to \(k\) swaps and mismatches ⋮ A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ Approximate string matching with stuck address bits ⋮ Approximation algorithms for grooming in optical network design ⋮ Matching with don't-cares and a small number of mismatches ⋮ Indexing Circular Patterns ⋮ Interchange rearrangement: the element-cost model ⋮ Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances ⋮ Approximate string matching with address bit errors
This page was built for publication: Pattern matching with address errors
