Pattern matching with address errors

DOI10.1145/1109557.1109692MaRDI QIDQ3581523zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Yonatan Aumann, Levy Avivit, Ohad Lipsky, Ely Porat, Uzi Vishne, G. Benson, Steven Skiena

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Protein sequences, DNA sequences (92D20)

Cited in

(11)

• Approximate string matching with address bit errors
• String matching with up to k swaps and mismatches
• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• Approximate String Matching with Address Bit Errors
• A simple algorithm for approximating the text-to-pattern Hamming distance
• Indexing Circular Patterns
• Approximate string matching with stuck address bits
• Approximation algorithms for grooming in optical network design
• Interchange rearrangement: the element-cost model
• Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
• Matching with don't-cares and a small number of mismatches

This page was built for publication: Pattern matching with address errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581523)