Pattern matching with address errors: Rearrangement distances
Authors:
- Amihood AmirAAAmihood Amir
- Yonatan AumannYAYonatan Aumann
- Gary BensonGBGary Benson
- Avivit LevyALAvivit Levy
- Ohad LipskyOLOhad Lipsky
- Ely PoratEPEly Porat
- Steven SkienaSSSteven Skiena
- Uzi VishneUVUzi Vishne
- 1 September 2009
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (6) , 359-370
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Faster algorithms for string matching with k mismatchesJournal of Algorithms, 2004
- Overlap matchingInformation and Computation, 2003
- Mixing and Covering in the Symmetric GroupsJournal of Algebra, 1998
- Sorting permutations by block-interchangesInformation Processing Letters, 1996
- Fast algorithms for approximately counting mismatchesInformation Processing Letters, 1993
- Improved string matching with k mismatchesACM SIGACT News, 1986
- Efficient string matching with k mismatchesTheoretical Computer Science, 1986
- Covering properties of permutation groups1985
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- LXXVII. Note on the theory of permutationsJournal of Computers in Education, 1849