SIMD solution to the sequence comparison problem on the MGAP

Manjit Borah, Raminder S. Bajwa, Sridhar Hannenhalli, Mary Jane Irwin

Research output: Contribution to journalConference article

26 Citations (Scopus)

Abstract

Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long even for moderate length sequences. In this paper we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor: a fine-grained massively parallel array of processors with nearest neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N in O(M + N + K) time with O(MN) processors which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128.

Original languageEnglish (US)
Pages (from-to)336-345
Number of pages10
JournalProceedings of the International Conference on Application Specific Array Processors
StatePublished - Dec 1 1994
EventProceedings of the 1994 International Conference on Application Specific Array Processors - San Francisco, CA, USA
Duration: Aug 22 1994Aug 24 1994

Fingerprint

Parallel processing systems
Dynamic programming

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Borah, Manjit ; Bajwa, Raminder S. ; Hannenhalli, Sridhar ; Irwin, Mary Jane. / SIMD solution to the sequence comparison problem on the MGAP. In: Proceedings of the International Conference on Application Specific Array Processors. 1994 ; pp. 336-345.
@article{f03e7927fc8342c09439cad66a973bcd,
title = "SIMD solution to the sequence comparison problem on the MGAP",
abstract = "Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long even for moderate length sequences. In this paper we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor: a fine-grained massively parallel array of processors with nearest neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N in O(M + N + K) time with O(MN) processors which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128.",
author = "Manjit Borah and Bajwa, {Raminder S.} and Sridhar Hannenhalli and Irwin, {Mary Jane}",
year = "1994",
month = "12",
day = "1",
language = "English (US)",
pages = "336--345",
journal = "International Conference on Application-Specific Systems, Architectures and Processors, Proceedings",
issn = "1063-6862",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

SIMD solution to the sequence comparison problem on the MGAP. / Borah, Manjit; Bajwa, Raminder S.; Hannenhalli, Sridhar; Irwin, Mary Jane.

In: Proceedings of the International Conference on Application Specific Array Processors, 01.12.1994, p. 336-345.

Research output: Contribution to journalConference article

TY - JOUR

T1 - SIMD solution to the sequence comparison problem on the MGAP

AU - Borah, Manjit

AU - Bajwa, Raminder S.

AU - Hannenhalli, Sridhar

AU - Irwin, Mary Jane

PY - 1994/12/1

Y1 - 1994/12/1

N2 - Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long even for moderate length sequences. In this paper we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor: a fine-grained massively parallel array of processors with nearest neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N in O(M + N + K) time with O(MN) processors which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128.

AB - Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long even for moderate length sequences. In this paper we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor: a fine-grained massively parallel array of processors with nearest neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N in O(M + N + K) time with O(MN) processors which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128.

UR - http://www.scopus.com/inward/record.url?scp=0028581714&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028581714&partnerID=8YFLogxK

M3 - Conference article

SP - 336

EP - 345

JO - International Conference on Application-Specific Systems, Architectures and Processors, Proceedings

JF - International Conference on Application-Specific Systems, Architectures and Processors, Proceedings

SN - 1063-6862

ER -