Parallel processing of biological sequence comparison algorithms

DOI10.1007/BF02427852zbMath0662.92013OpenAlexW2029475416MaRDI QIDQ1114624

Nolan G. Core, Joel H. Saltz, Elizabeth W. Edmiston, Roger M. Smith

Publication date: 1988

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02427852

zbMATH Keywords

homologyDNA sequencesprotein sequencesstring matchingConnection MachineIntel iPSC/1 hypercubeparallel processing of biological sequence comparisons

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Parallel numerical computation (65Y05) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04) Physiological, cellular and medical topics (92Cxx)

Related Items (2)

OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval ⋮ FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search

Cites Work

• Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors

This page was built for publication: Parallel processing of biological sequence comparison algorithms