Approximate String Matching with Address Bit Errors

Authors:
Amihood Amir;Yonatan Aumann;Oren Kapah;Avivit Levy;Ely Porat
Affiliations:
Department of Computer Science, Bar Ilan University, Ramat Gan, Israel 52900 and Department of Computer Science, Johns Hopkins University, Baltimore MD 21218;Department of Computer Science, Bar Ilan University, Ramat Gan, Israel 52900;Department of Computer Science, Bar Ilan University, Ramat Gan, Israel 52900;CRI, Haifa University, Mount Carmel, Haifa, Israel 31905;Department of Computer Science, Bar Ilan University, Ramat Gan, Israel 52900
Venue:
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Year:
2008

Citing 14
Cited 8

Randomized algorithms

Randomized algorithms
Sorting permutations by block-interchanges

Information Processing Letters
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Sorting by Transpositions

SIAM Journal on Discrete Mathematics
An Extension of the String-to-String Correction Problem

Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Verifying candidate matches in sparse and wildcard matching

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
Approximate swapped matching

Information Processing Letters
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Fast Sorting by Reversal

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Overlap matching

Information and Computation
Rapid identification of repeated patterns in strings, trees and arrays

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Pattern matching with address errors: rearrangement distances

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Interchange Rearrangement: The Element-Cost Model

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
LCS Approximation via Embedding into Local Non-repetitive Strings

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Online Approximate Matching with Non-local Distances

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Approximate string matching with stuck address bits

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
LCS approximation via embedding into locally non-repetitive strings

Information and Computation
Blocked pattern matching problem and its applications in proteomics

RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Approximate string matching with stuck address bits

Theoretical Computer Science
String rearrangement metrics: a survey

Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A string S茂戮驴 Σmcan be viewed as a set of pairs S= { (茂戮驴i, i) : i茂戮驴 { 0,..., m茂戮驴 1} }. We consider approximate pattern matching problems arising from the setting where errors are introduced to the location component (i), rather than the more traditional setting, where errors are introduced to the content itself (茂戮驴i). In this paper, we consider the case where bits of imay be erroneously flipped, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution, while introducing some novel techniques.