Approximate swapped matching

Information Processing Letters

Volumn 83, Issue 1, 2002, Pages 33-39

  Amir, Amihood ^a,b   Lewenstein, Moshe ^a   Porat, Ely ^a,c  

^a BAR ILAN UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximate pattern matching; Combinatorial algorithms on words; Design and analysis of algorithms; Non standard pattern matching; Pattern matching; Pattern matching with swaps

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING;

SWAPPED MATCHING;

PATTERN MATCHING;

EID: 0037118752     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00302-7     Document Type: Article

References (20)

1. Generalized string matching
2. Pattern matching with swaps
3. Pattern matching with swaps
4. Overlap matching
5. Efficient 2-dimensional approximate matching of half-rectangular figures
6. Efficient special cases of pattern matching with swaps
7. Approximate string matching: A faster simpler algorithm
8. String matching and other products
9. An improved algorithm for approximate string matching
10. Fast pattern matching in strings
11. Fast parallel and serial approximate string matching
12. Incremental string comparison
13. Binary codes capable of correcting, deletions, insertions and reversals
14. An extension of the string-to-string correction problem
15. String matching under a general matching relation
16. Small-bias probability spaces: Efficient constructions and applications
17. A time to sequence
18. On the complexity of the extended string-to-string correction problem