Improved string matching with k mismatches
ACM SIGACT News
Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
Fast algorithms for approximately counting mismatches
Information Processing Letters
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
SIAM Journal on Discrete Mathematics
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for dynamic text indexing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximate string matching: a simpler faster algorithm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Information Processing Letters
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern 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
Efficient approximate and dynamic matching of patterns using a labeling paradigm
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth 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
Approximate string matching with stuck address bits
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
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
| Hi-index | 0.01 |
This paper introduces a new pattern matching model that has been gaining importance recently, that of Asynchronous Pattern Matching. Traditional pattern matching has assumed the possibility of errors in the data content. We present motivation from text editing, computational biology, and computer architecture, that points to a new paradigm – where the errors occur in the address. It turns out that there are differences in techniques, complexities, and tools between the two different models, making it important to recognize their differences. We motivate and define the new model and present some problems that are worth pursuing.