Optimal correspondence of string subsequences
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Ieee Transactions On Pattern Analysis and Machine Intelligence
- Vol. 12 (11), 1080-1087
- https://doi.org/10.1109/34.61707
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Matching patterns in strings subject to multi-linear transformationsTheoretical Computer Science, 1988
- Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic CurvesThe International Journal of Robotics Research, 1987
- Stereo by Intra- and Inter-Scanline Search Using Dynamic ProgrammingIeee Transactions On Pattern Analysis and Machine Intelligence, 1985
- Parallel Algorithms for Syllable Recognition in Continuous SpeechIeee Transactions On Pattern Analysis and Machine Intelligence, 1985
- Approximate String MatchingACM Computing Surveys, 1980
- The Use of a Syntactic Shape Analyzer for Contour MatchingIeee Transactions On Pattern Analysis and Machine Intelligence, 1979
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- Order- n correction for regular languagesCommunications of the ACM, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974