메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 38-45

Computing large-scale alignments on a multi-cluster

Author keywords

Cluster computing; Dynamic programming; Grid computing; MPI; Sequence alignment

Indexed keywords

ALGORITHMS; ALIGNMENT; CLUSTERING ALGORITHMS; COMPUTATIONAL EFFICIENCY; COMPUTER ARCHITECTURE; DNA SEQUENCES; DYNAMIC PROGRAMMING; GRID COMPUTING;

EID: 77749293594     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2003.1253297     Document Type: Conference Paper
Times cited : (25)

References (18)
  • 6
    • 0016518550 scopus 로고
    • A linear space algorithm for computing longest common subsequences
    • Hirschberg, D.S., "A linear space algorithm for computing longest common subsequences," Comm. ACM, 18:341-343. 1975.
    • (1975) Comm. ACM , vol.18 , pp. 341-343
    • Hirschberg, D.S.1
  • 7
    • 44949272730 scopus 로고
    • A time efficient, linear-space local similarity algorithm
    • Huang, X., Miller, W., "A time efficient, linear-space local similarity algorithm," Advances in Applied Mathematics, 12:337-357, 1991.
    • (1991) Advances in Applied Mathematics , vol.12 , pp. 337-357
    • Huang, X.1    Miller, W.2
  • 10
    • 0029006770 scopus 로고
    • Comparison of methods for searching protein sequence databases
    • Pearson, W.R., "Comparison of methods for searching protein sequence databases," Protein Science, 4(6):1145-1160, 1995.
    • (1995) Protein Science , vol.4 , Issue.6 , pp. 1145-1160
    • Pearson, W.R.1
  • 11
    • 0032794985 scopus 로고    scopus 로고
    • Sensitivity of parallel applications to large differences in bandwidth and latency in two-layer interconnects
    • Orlando, Florida, January 9-13
    • th IEEE HPCA'99, Orlando, Florida, January 9-13, pp. 244-253, 1999.
    • (1999) th IEEE HPCA'99 , pp. 244-253
    • Plaat, A.1    Bal, H.E.2    Hofman, R.H.F.3
  • 12
    • 84966687060 scopus 로고    scopus 로고
    • Massively parallel solutions for molecular sequence analysis
    • Ft. Lauderdale, Florida
    • Schmidt, B., Schröder, H., Schimmler, M., "Massively Parallel Solutions for Molecular Sequence Analysis," Proc. IPDPS'02, Ft. Lauderdale, Florida, 2002.
    • (2002) Proc. IPDPS'02
    • Schmidt, B.1    Schröder, H.2    Schimmler, M.3
  • 14
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • Smith T.F., Waterman, M. S., "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
  • 15
    • 0023661088 scopus 로고
    • A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons
    • Waterman, M. S., Eggert, M., "A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons," Journal of Molecular Biology, 197:723-728, 1987.
    • (1987) Journal of Molecular Biology , vol.197 , pp. 723-728
    • Waterman, M.S.1    Eggert, M.2
  • 17
    • 84944918048 scopus 로고    scopus 로고
    • http://www3.niu.edu/mpi
  • 18
    • 84944918049 scopus 로고    scopus 로고
    • http://www-unix.mcs.anl.gov/mpi/mpich/


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