Approximate string matching in sublinear expected time
Authors:
- W.I. ChangWCW.I. Chang
- E.L. LawlerELE.L. Lawler
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 116-124
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- Boyer-Moore approach to approximate string matchingLecture Notes in Computer Science, 1990
- Data compression with finite windowsCommunications of the ACM, 1989
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- Improved tools for biological sequence comparison.Proceedings of the National Academy of Sciences, 1988
- Phase transitions in sequence matches and nucleic acid structure.Proceedings of the National Academy of Sciences, 1987
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- Algorithms for approximate string matchingInformation and Control, 1985
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- Longest common subsequences of two random sequencesJournal of Applied Probability, 1975