Efficient Parallel Algorithms for String Editing and Related Problems
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (5) , 968-988
- https://doi.org/10.1137/0219066
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- ForewordBulletin of Mathematical Biology, 1984
- Parallel Prefix ComputationJournal of the ACM, 1980
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- Optimal surface reconstruction from planar contoursCommunications of the ACM, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- An algorithm for the distance between two finite sequencesJournal of Combinatorial Theory, Series A, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970