Supercomputers and biological sequence comparison algorithms

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

doi:10.1016/0010-4809(89)90071-2

Supercomputers and biological sequence comparison algorithms

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

Biomedical Informatics

Yale University
Duke University

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

Comparison of biological (DNA or protein) sequences provides insight into molecular structure, function, and homology and is increasingly important as the available databases become larger and more numerous. One method of increasing the speed of the calculations is to perform them in parallel. We present the results of initial investigations using two dynamic programming algorithms on the Intel iPSC hypercube and the Connection Machine as well as an inexpensive, heuristically-based algorithm on the Encore Multimax.

Original language	English
Pages (from-to)	497-515
Number of pages	19
Journal	Computers and Biomedical Research
Volume	22
Issue number	6
DOIs	https://doi.org/10.1016/0010-4809(89)90071-2
State	Published - Dec 1989

Access to Document

10.1016/0010-4809(89)90071-2

Cite this

@article{8d1dd40790a448ddacba8b007b8dcb87,

title = "Supercomputers and biological sequence comparison algorithms",

abstract = "Comparison of biological (DNA or protein) sequences provides insight into molecular structure, function, and homology and is increasingly important as the available databases become larger and more numerous. One method of increasing the speed of the calculations is to perform them in parallel. We present the results of initial investigations using two dynamic programming algorithms on the Intel iPSC hypercube and the Connection Machine as well as an inexpensive, heuristically-based algorithm on the Encore Multimax.",

author = "Core, \{Nolan G.\} and Edmiston, \{Elizabeth W.\} and Saltz, \{Joel H.\} and Smith, \{Roger M.\}",

year = "1989",

month = dec,

doi = "10.1016/0010-4809(89)90071-2",

language = "English",

volume = "22",

pages = "497--515",

journal = "Computers and Biomedical Research",

issn = "0010-4809",

number = "6",

}

TY - JOUR

T1 - Supercomputers and biological sequence comparison algorithms

AU - Core, Nolan G.

AU - Edmiston, Elizabeth W.

AU - Saltz, Joel H.

AU - Smith, Roger M.

PY - 1989/12

Y1 - 1989/12

N2 - Comparison of biological (DNA or protein) sequences provides insight into molecular structure, function, and homology and is increasingly important as the available databases become larger and more numerous. One method of increasing the speed of the calculations is to perform them in parallel. We present the results of initial investigations using two dynamic programming algorithms on the Intel iPSC hypercube and the Connection Machine as well as an inexpensive, heuristically-based algorithm on the Encore Multimax.

AB - Comparison of biological (DNA or protein) sequences provides insight into molecular structure, function, and homology and is increasingly important as the available databases become larger and more numerous. One method of increasing the speed of the calculations is to perform them in parallel. We present the results of initial investigations using two dynamic programming algorithms on the Intel iPSC hypercube and the Connection Machine as well as an inexpensive, heuristically-based algorithm on the Encore Multimax.

UR - https://www.scopus.com/pages/publications/0024802323

U2 - 10.1016/0010-4809(89)90071-2

DO - 10.1016/0010-4809(89)90071-2

M3 - Article

C2 - 2591205

AN - SCOPUS:0024802323

SN - 0010-4809

VL - 22

SP - 497

EP - 515

JO - Computers and Biomedical Research

JF - Computers and Biomedical Research

IS - 6

ER -

Supercomputers and biological sequence comparison algorithms

Abstract

Access to Document

Other files and links

Fingerprint

Cite this