메뉴 건너뛰기




Volumn 33, Issue SUPPL. 2, 2005, Pages

PARALIGN: Rapid and sensitive sequence similarity searches powered by parallel computing technology

Author keywords

[No Author keywords available]

Indexed keywords

SACCHAROMYCES CEREVISIAE PROTEIN;

EID: 23144452802     PISSN: 03051048     EISSN: 13624962     Source Type: Journal    
DOI: 10.1093/nar/gki423     Document Type: Article
Times cited : (36)

References (7)
  • 2
    • 0025272240 scopus 로고
    • Rapid and sensitive sequence comparison with FASTP and FASTA
    • Pearson,W.R. (1990) Rapid and sensitive sequence comparison with FASTP and FASTA. Methods Enzymol., 183, 63-98.
    • (1990) Methods Enzymol. , vol.183 , pp. 63-98
    • Pearson, W.R.1
  • 3
    • 0033743209 scopus 로고    scopus 로고
    • Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors
    • Rognes,T. and Seeberg,E. (2000) Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors. Bioinformatics, 16, 699-706.
    • (2000) Bioinformatics , vol.16 , pp. 699-706
    • Rognes, T.1    Seeberg, E.2
  • 4
    • 0035312251 scopus 로고    scopus 로고
    • ParAlign: A parallel sequence alignment algorithm for rapid and sensitive database searches
    • Rognes,T. (2001) ParAlign: A parallel sequence alignment algorithm for rapid and sensitive database searches. Nucleic Acids Res., 29, 1647-1652.
    • (2001) Nucleic Acids Res. , vol.29 , pp. 1647-1652
    • Rognes, T.1
  • 5
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
    • (1981) J. Mol. Biol. , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 6
    • 0025950944 scopus 로고
    • Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms
    • Pearson,W. (1991) Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms Genomics, 11, 635-650.
    • (1991) Genomics , vol.11 , pp. 635-650
    • Pearson, W.1
  • 7
    • 0031743421 scopus 로고    scopus 로고
    • Profile hidden Markov models
    • Eddy,S. (1998) Profile hidden Markov models. Bioinformatics, 14, 755-763.
    • (1998) Bioinformatics , vol.14 , pp. 755-763
    • Eddy, S.1


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