메뉴 건너뛰기




Volumn , Issue , 2009, Pages 3845-3848

An efficient and high performance linear recursive variable expansion implementation of the Smith-Waterman algorithm

Author keywords

Bioinformatics; FPGAs; Recursive variable expansion; Sequence alignment; Smith Waterman algorithm; Systolic arrays

Indexed keywords

BIOINFORMATICS; EXPANSION; FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 77950978103     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IEMBS.2009.5332567     Document Type: Conference Paper
Times cited : (16)

References (15)
  • 1
    • 0033729144 scopus 로고    scopus 로고
    • A systematic approach to dynamic programming in bioinformatics
    • R. Giegerich, "A systematic approach to dynamic programming in bioinformatics", Bioinformatics, vol.16, pp: 665-677, 2000.
    • (2000) Bioinformatics , vol.16 , pp. 665-677
    • Giegerich, R.1
  • 2
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • T. F. Smith and M. S. Waterman, "Identification of common molecular subsequences", Journal of Molecular Biology, vol.147, pp: 195-197, 1981.
    • (1981) Journal of Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 3
    • 0021919480 scopus 로고
    • Rapid and Sensitive Protein Simlarity Searches
    • W. R. Pearson and D. J. Lipman, "Rapid and Sensitive Protein Simlarity Searches", Science, vol.227, pp: 1435-1441, 1985.
    • (1985) Science , vol.227 , pp. 1435-1441
    • Pearson, W.R.1    Lipman, D.J.2
  • 6
  • 9
    • 64849097508 scopus 로고    scopus 로고
    • Bio-Sequence Database Scanning on a GPU
    • A. Schroder et. al., "Bio-Sequence Database Scanning on a GPU" HICOMB, 2006.
    • (2006) HICOMB
    • Schroder, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.