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 52900, Israel and Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA;Department of Computer Science, Bar Ilan University, Ramat Gan 52900, Israel;Department of Computer Science, Bar Ilan University, Ramat Gan 52900, Israel;Shenkar College, Anna Frank 12, Ramat-Gan, 52526, Israel and CRI, Haifa University, Mount Carmel, Haifa 31905, Israel;Department of Computer Science, Bar Ilan University, Ramat Gan 52900, Israel
Venue:
Theoretical Computer Science
Year:
2009

Citing 16
Cited 3

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
On the cost of interchange rearrangement in strings

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Efficient computations of l1and l∞rearrangement distances

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval

Approximate string matching with stuck address bits

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Approximate string matching with stuck address bits

Theoretical Computer Science
String rearrangement metrics: a survey

Algorithms and Applications

Quantified Score

Hi-index	5.23

Visualization

Abstract

A string S@?@S^m can be viewed as a set of pairs S={(@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 into the content itself (@s"i). In this paper, we consider the case where bits of i may 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.