Parallel processing of biological sequence comparison algorithms (Q1114624)

From MaRDI portal
Revision as of 02:28, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Parallel processing of biological sequence comparison algorithms
scientific article

    Statements

    Parallel processing of biological sequence comparison algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    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 calculation is to perform them in parallel. We present the results of initial investigations using the Intel iPSC/1 hypercube and the Connection Machine (CM-I) for these comparisons. Since these machines have very different architectures, the issues and performance trade-offs discussed have a wide applicability for the parallel processing of biological sequence comparisons.
    0 references
    DNA sequences
    0 references
    protein sequences
    0 references
    string matching
    0 references
    homology
    0 references
    Intel iPSC/1 hypercube
    0 references
    Connection Machine
    0 references
    parallel processing of biological sequence comparisons
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references