Skip to main navigation Skip to search Skip to main content

Parallel processing of biological sequence comparison algorithms

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Methods of implementing biological (DNA or protein) sequence-compromise algorthms on the Intel iPSC/1 hypercube and the CM-1 microprocessor, machines which have very different architectures, are demonstrated. The CM-I is significantly faster when the sizes of the sequences to be compared are relatively large. However, the small memory for each of the CM-I processors prevents the storage of the necessary information for the traceback procedure. Consequently, the traceback must be performed in more than one pass. The Intel iPSC/1 hypercube, on the other hand, has more than enough storage for the traceback procedure, but is slower for larger size sequences because it has two orders of magnitude fewer processors han the CM-I. However, the Intel iPSC/2 hypercube is faster by a factor of four to five, and the CM-II has more memory.

Original languageEnglish
Title of host publicationProceedings - Annual Symposium on Computer Applications in Medical Care
EditorsRobert A. Greenes
PublisherPubl by IEEE
Pages266-270
Number of pages5
ISBN (Print)0818608811
StatePublished - Nov 1988
EventProceedings - Twelfth Annual Symposium on Computer Applications in Medical Care - Washington, DC, USA
Duration: Nov 6 1988Nov 9 1988

Publication series

NameProceedings - Annual Symposium on Computer Applications in Medical Care
ISSN (Print)0195-4210

Conference

ConferenceProceedings - Twelfth Annual Symposium on Computer Applications in Medical Care
CityWashington, DC, USA
Period11/6/8811/9/88

Fingerprint

Dive into the research topics of 'Parallel processing of biological sequence comparison algorithms'. Together they form a unique fingerprint.

Cite this