메뉴 건너뛰기




Volumn 15, Issue 12, 2004, Pages 1070-1081

Space and time optimal parallel sequence alignments

Author keywords

Computational biology; Parallel algorithms; Parallel dynamic programming; Sequence alignments; Space efficient

Indexed keywords

DYNAMIC PROGRAMMING; MOLECULAR BIOLOGY; PARALLEL ALGORITHMS; SEQUENTIAL MACHINES;

EID: 11044228089     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2004.86     Document Type: Article
Times cited : (69)

References (22)
  • 1
    • 0038519367 scopus 로고    scopus 로고
    • "Parallel Biological Sequence Comparison Using Prefix Computations"
    • S. Aluru, N. Futamura, and K. Mehrotra, "Parallel Biological Sequence Comparison Using Prefix Computations," J. Parallel and Distributed Computing, vol. 63, no. 3, pp. 264-272, 2003.
    • (2003) J. Parallel and Distributed Computing , vol.63 , Issue.3 , pp. 264-272
    • Aluru, S.1    Futamura, N.2    Mehrotra, K.3
  • 3
    • 0025508207 scopus 로고
    • "Efficient Parallel Algorithms for String Editing and Related Problems"
    • A. Apostolico, M.J. Atallah, L.L. Larmore, and S. MacFaddin, " Efficient Parallel Algorithms for String Editing and Related Problems," SIAM J. Computing, vol. 19, no. 5, pp. 968-988, 1990.
    • (1990) SIAM J. Computing , vol.19 , Issue.5 , pp. 968-988
    • Apostolico, A.1    Atallah, M.J.2    Larmore, L.L.3    MacFaddin, S.4
  • 4
    • 0000228203 scopus 로고
    • "A Model of Evolutionary Change in Proteins: Matrices for Detecting Distant Relationships"
    • M.O. Dayhoff, ed., Nat'l Biomedical Research Foundation, DC
    • M.O. Dayhoff, R. Schwartz, and B.C. Orcutt, "A Model of Evolutionary Change in Proteins: Matrices for Detecting Distant Relationships," Atlas of Protein Sequence and Structure, vol. 5, M.O. Dayhoff, ed., Nat'l Biomedical Research Foundation, DC, pp. 345-358, 1978.
    • (1978) Atlas of Protein Sequence and Structure , vol.5 , pp. 345-358
    • Dayhoff, M.O.1    Schwartz, R.2    Orcutt, B.C.3
  • 5
    • 0023565710 scopus 로고
    • "Parallelization of the Dynamic Programming Algorithm for Comparison of Sequences"
    • E.W. Edmiston and R.A. Wagner, "Parallelization of the Dynamic Programming Algorithm for Comparison of Sequences," Proc. Int'l Conf. Parallel Processing, pp. 78-80, 1987.
    • (1987) Proc. Int'l Conf. Parallel Processing , pp. 78-80
    • Edmiston, E.W.1    Wagner, R.A.2
  • 6
    • 0006323024 scopus 로고
    • "Parallel Processing of Biological Sequence Comparison Algorithms"
    • E.W. Edmiston, N.G. Core, J.H. Saltz, and R.M. Smith, "Parallel Processing of Biological Sequence Comparison Algorithms," Int'l J. Parallel Programming, vol. 17, no. 3, pp. 259-275, 1988.
    • (1988) Int'l J. Parallel Programming , vol.17 , Issue.3 , pp. 259-275
    • Edmiston, E.W.1    Core, N.G.2    Saltz, J.H.3    Smith, R.M.4
  • 8
    • 0020484488 scopus 로고
    • "An Improved Algorithm for Matching Biological Sequences"
    • O. Gotoh, "An Improved Algorithm for Matching Biological Sequences," J. Molecular Biology, vol. 162, pp. 705-708, 1982.
    • (1982) J. Molecular Biology , vol.162 , pp. 705-708
    • Gotoh, O.1
  • 9
    • 0026458378 scopus 로고
    • "Amino Acid Substitution Matrices from Protein Blocks"
    • S. Henikoff and J.G. Henikoff, "Amino Acid Substitution Matrices from Protein Blocks," Proc. Nat'l Academy of Sciences, vol. 89, pp. 10915-10919. 1992.
    • (1992) Proc. Nat'l Academy of Sciences , vol.89 , pp. 10915-10919
    • Henikoff, S.1    Henikoff, J.G.2
  • 10
    • 0016518550 scopus 로고
    • "A Linear Space Algorithm for Computing Maximal Common Subsequences"
    • D.S. Hirschberg, "A Linear Space Algorithm for Computing Maximal Common Subsequences," Comm. ACM. vol. 18, no. 6, pp. 341-343, 1975.
    • (1975) Comm. ACM. , vol.18 , Issue.6 , pp. 341-343
    • Hirschberg, D.S.1
  • 12
    • 0024686368 scopus 로고
    • "A Space-Efficient Parallel Sequence Comparison Algorithm for a Message-Passing Multiprocessor"
    • X. Huang, "A Space-Efficient Parallel Sequence Comparison Algorithm for a Message-Passing Multiprocessor," Int'l J. Parallel Programming, vol. 18, no. 3, pp. 223-239, 1989.
    • (1989) Int'l J. Parallel Programming , vol.18 , Issue.3 , pp. 223-239
    • Huang, X.1
  • 13
    • 0025043566 scopus 로고
    • "A Space-Efficient Algorithm for Local Similarities"
    • X. Huang, "A Space-Efficient Algorithm for Local Similarities," Computer Applications in the Biosciences, vol. 6, no. 4, pp. 373-381, 1990.
    • (1990) Computer Applications in the Biosciences , vol.6 , Issue.4 , pp. 373-381
    • Huang, X.1
  • 14
    • 0037314081 scopus 로고    scopus 로고
    • "A Generalized Global Alignment Algorithm"
    • X. Huang and K. Chao, "A Generalized Global Alignment Algorithm," Bioinformatics, vol. 19, no. 2, pp. 228-233, 2003.
    • (2003) Bioinformatics , vol.19 , Issue.2 , pp. 228-233
    • Huang, X.1    Chao, K.2
  • 16
    • 0018985316 scopus 로고
    • "A Faster Algorithm for Computing String Edit Distances"
    • W.J. Masek and M.S. Paterson, "A Faster Algorithm for Computing String Edit Distances," J. Computer and System Sciences, vol. 20, pp. 18-31, 1980.
    • (1980) J. Computer and System Sciences , vol.20 , pp. 18-31
    • Masek, W.J.1    Paterson, M.S.2
  • 18
    • 0014757386 scopus 로고
    • "A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins"
    • S.B. Needleman and C.D. Wunsch, "A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins," J. Molecular Biology, vol. 48, pp. 443-453, 1970.
    • (1970) J. Molecular Biology , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 19
    • 0003989360 scopus 로고    scopus 로고
    • San Francisco, Calif.: Morgan Kaufmann Publishers
    • P. Pacheco, Parallel Programming with MPI. San Francisco, Calif.: Morgan Kaufmann Publishers, 1996.
    • (1996) Parallel Programming With MPI
    • Pacheco, P.1
  • 20
    • 0025476298 scopus 로고
    • "String Editing on an SIMD Hypercube Multicomputer"
    • S. Ranka and S. Sahni, "String Editing on an SIMD Hypercube Multicomputer," J. Parallel and Distributed Computing, vol. 9, pp. 411-418, 1990.
    • (1990) J. Parallel and Distributed Computing , vol.9 , pp. 411-418
    • Ranka, S.1    Sahni, S.2
  • 22
    • 0019887799 scopus 로고
    • "Identification of Common Molecular Subsequences"
    • T.F. Smith and M.S. Waterman, "Identification of Common Molecular Subsequences," J. Molecular Biology, vol. 147, pp. 195-197. 1981.
    • (1981) J. Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2


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