메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 99-108

Parallel processing in biological sequence comparison using general purpose processors

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DNA; HEURISTIC METHODS; LIVING SYSTEMS STUDIES; PROGRAM PROCESSORS; PROTEINS;

EID: 33749055122     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IISWC.2005.1526005     Document Type: Conference Paper
Times cited : (8)

References (30)
  • 4
    • 0031827544 scopus 로고    scopus 로고
    • Comparative accuracy of methods for protein sequence similarity search
    • P. Agarwal and D. J. States. Comparative accuracy of methods for protein sequence similarity search. BIOINF: Bioinformatics, 14, 1998.
    • (1998) BIOINF: Bioinformatics , vol.14
    • Agarwal, P.1    States, D.J.2
  • 11
    • 0033872689 scopus 로고    scopus 로고
    • Altivec extension to powerpc accelerates media processing
    • April
    • K. Diefendorff, P. Dubey, R. Hochsprung, and H. Scales. Altivec extension to powerpc accelerates media processing. IEEE Micro, 20(2):85-95, April 2000.
    • (2000) IEEE Micro , vol.20 , Issue.2 , pp. 85-95
    • Diefendorff, K.1    Dubey, P.2    Hochsprung, R.3    Scales, H.4
  • 12
    • 0020484488 scopus 로고
    • An improvement algorithm for matching biological sequences
    • O. Gotoh. An improvement algorithm for matching biological sequences. Journal on Molecular Biology, 162:705-708, 1982.
    • (1982) Journal on Molecular Biology , vol.162 , pp. 705-708
    • Gotoh, O.1
  • 13
    • 33749080103 scopus 로고    scopus 로고
    • P. Green. Swat. www.genome.washington.edu/uwgc/analysistools/swat.htm.
    • Swat
    • Green, P.1
  • 14
    • 0032776495 scopus 로고    scopus 로고
    • Blocks+: A non-redundant database of protein alignment blocks derived from multiple compilations
    • J. Henikoff, S. Henikoff and S. Pietrokovski. Blocks+: a non-redundant database of protein alignment blocks derived from multiple compilations. Bioinformatics, 15, 1999.
    • (1999) Bioinformatics , vol.15
    • Henikoff, J.1    Henikoff, S.2    Pietrokovski, S.3
  • 17
    • 0342657281 scopus 로고    scopus 로고
    • Strategies for searching sequence databases
    • B. Huhg, W David, and J. Alexander. Strategies for searching sequence databases. BioTechniques, 28(6), 2000.
    • (2000) BioTechniques , vol.28 , Issue.6
    • Huhg, B.1    David, W.2    Alexander, J.3
  • 18
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
    • (1970) Journal of Molecular Biology , vol.48 , pp. 443-453
    • Needleman, S.1    Wunsch, C.2
  • 19
    • 0025950944 scopus 로고
    • Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the smith-waterman and FASTA algorithms
    • W. R. Pearson. Searching protein sequence libraries: comparison of the sensitivity and selectivity of the smith-waterman and FASTA algorithms. Genomes, 11:635-650, 1991.
    • (1991) Genomes , vol.11 , pp. 635-650
    • Pearson, W.R.1
  • 20
    • 0023989064 scopus 로고
    • Improved tools for biological sequence comparison
    • Apr.
    • W. R. Pearson and D. J. Lipman. Improved tools for biological sequence comparison. In Proc. Natl. Acad. Sci (USA)., pages 2444-2448, Apr. 1988.
    • (1988) Proc. Natl. Acad. Sci (USA) , pp. 2444-2448
    • Pearson, W.R.1    Lipman, D.J.2
  • 21
    • 0033743209 scopus 로고    scopus 로고
    • Six-fold speed-up of smith-waterman sequence database searches using parallel processing on common microprocessors
    • Rognes and Seeberg. Six-fold speed-up of smith-waterman sequence database searches using parallel processing on common microprocessors. BIOINF: Bioinformatics, 16, 2000.
    • (2000) BIOINF: Bioinformatics , vol.16
    • Rognes1    Seeberg2
  • 23
    • 0034114220 scopus 로고    scopus 로고
    • The early introduction of dynamic programming into computational biology
    • D. Sankoff. The early introduction of dynamic programming into computational biology. Bioinformatics, 16:1:41-47, 2000.
    • (2000) Bioinformatics , vol.16 , Issue.1 , pp. 41-47
    • Sankoff, D.1
  • 25
    • 0000821965 scopus 로고
    • On the theory and computation of evolutionary distances
    • P. Sellers. On the theory and computation of evolutionary distances. SIAM J. Appl. Match, 26:4:787-793, 1974.
    • (1974) SIAM J. Appl. Match , vol.26 , Issue.4 , pp. 787-793
    • Sellers, P.1
  • 27
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
    • (1981) Journal of Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 29
    • 0030935244 scopus 로고    scopus 로고
    • Using video-oriented instructions to speed up sequence comparison
    • A. Wozniak. Using video-oriented instructions to speed up sequence comparison. Computer Applications in the Biosciences, 13(1), 1997.
    • (1997) Computer Applications in the Biosciences , vol.13 , Issue.1
    • Wozniak, A.1


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