Improved string matching with k mismatches
ACM SIGACT News
Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast algorithms for approximately counting mismatches
Information Processing Letters
String matching under a general matching relation
Information and Computation
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)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Information and Computation
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh 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
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
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Interchange Rearrangement: The Element-Cost Model
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Matching with don't-cares and a small number of mismatches
Information Processing Letters
Online Approximate Matching with Non-local Distances
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Interchange rearrangement: The element-cost model
Theoretical Computer Science
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
Approximate string matching with address bit errors
Theoretical Computer Science
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
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
String matching with up to k swaps and mismatches
Information and Computation
Cycle detection and correction
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Finding Patterns In Given Intervals
Fundamenta Informaticae
Approximate string matching with stuck address bits
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the Cost of Interchange Rearrangement in Strings
SIAM Journal on Computing
Blocked pattern matching problem and its applications in proteomics
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Approximation algorithms for grooming in optical network design
Theoretical Computer Science
Approximate string matching with stuck address bits
Theoretical Computer Science
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
String rearrangement metrics: a survey
Algorithms and Applications
Cycle detection and correction
ACM Transactions on Algorithms (TALG)
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Approximate period detection and correction
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.01 |
Historically, approximate pattern matching has mainly focused at coping with errors in the data, while the order of the text/pattern was assumed to be more or less correct. In this paper we consider a class of pattern matching problems where the content is assumed to be correct, while the locations may have shifted/changed. We formally define a broad class of problems of this type, capturing situations in which the pattern is obtained from the text by a sequence of rearrangements. We consider several natural rearrangement schemes, including the analogues of the l1 and l2 distances, as well as two distances based on interchanges. For these, we present efficient algorithms to solve the resulting string matching problems.