A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor
- 1 June 1989
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 18 (3) , 223-239
- https://doi.org/10.1007/bf01407900
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- An improved algorithm for matching biological sequencesPublished by Elsevier ,2004
- Parallel processing of biological sequence comparison algorithmsInternational Journal of Parallel Programming, 1988
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974