메뉴 건너뛰기




Volumn 5, Issue 2, 1989, Pages 151-153

Fast and sensitive multiple sequence alignments on a microcomputer

Author keywords

[No Author keywords available]

Indexed keywords

NUCLEIC ACID; PROTEIN;

EID: 0024598146     PISSN: 13674803     EISSN: None     Source Type: Journal    
DOI: 10.1093/bioinformatics/5.2.151     Document Type: Article
Times cited : (1344)

References (25)
  • 1
    • 0023045706 scopus 로고
    • MULTAN: A program lo align multiple DNA sequences
    • Bains, W. (1986) MULTAN: a program lo align multiple DNA sequences. Nucleic Acids Res., 14, 159-177.
    • (1986) Nucleic Acids Res. , vol.14 , pp. 159-177
    • Bains, W.1
  • 2
    • 0023518540 scopus 로고
    • A strategy for the rapid multiple alignment of protein sequences
    • Barton, G.J. and Sternberg, M.J.E. (1987) A strategy for the rapid multiple alignment of protein sequences. J. Mol. Biol., 198, 327-337.
    • (1987) J. Mol. Biol. , vol.198 , pp. 327-337
    • Barton, G.J.1    Sternberg, M.J.E.2
  • 3
    • 0000228203 scopus 로고
    • A model of evolutionary change in proteins. Matrices for detecting distant relationships
    • Dayhoff, M.O. (ed.), Washington DC
    • Dayhoff, M.O. (1978) A model of evolutionary change in proteins. Matrices for detecting distant relationships. In Dayhoff, M.O. (ed.). Allas of Protein Sequence and Structure. National Biomedical Research Foundation, Washington DC, Vol. 5 Suppl. 3. pp. 345-358.
    • (1978) Allas of Protein Sequence and Structure. National Biomedical Research Foundation , vol.5 , pp. 345-358
    • Dayhoff, M.O.1
  • 4
    • 0023084055 scopus 로고
    • Progressive sequence alignment as a prerequisite to correct phylogenetic trees
    • Feng, D.-F. and Doolittle, R.F. (1987) Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol., 25, 351-360.
    • (1987) J. Mol. Evol. , vol.25 , pp. 351-360
    • Feng, D.-F.1    Doolittle, R.F.2
  • 5
    • 0020484488 scopus 로고
    • An improved algorithm for matching biological sequences
    • Gotoh, O. (1982) An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708.
    • (1982) J. Mol. Biol. , vol.162 , pp. 705-708
    • Gotoh, O.1
  • 6
    • 0024234855 scopus 로고
    • CLUSTAL: A package for performing multiple sequence alignment on a microcomputer
    • Higgins, D.G. and Sharp, P.M. (1988) CLUSTAL: a package for performing multiple sequence alignment on a microcomputer. Gene, 73, 237-244.
    • (1988) Gene , vol.73 , pp. 237-244
    • Higgins, D.G.1    Sharp, P.M.2
  • 7
    • 0016518550 scopus 로고
    • A linear space algorithm for computing longest common subsequences
    • Hirschberg, D.S. (1975) A linear space algorithm for computing longest common subsequences. Commun. Assoc. Comput. Mach., 18, 341-343.
    • (1975) Commun. Assoc. Comput. Mach. , vol.18 , pp. 341-343
    • Hirschberg, D.S.1
  • 8
    • 0023984847 scopus 로고
    • Optimal alignments in linear space
    • Myers, E.W. and Miller, W. (1988) Optimal alignments in linear space. CABIOS, 4, 11-17.
    • (1988) CABIOS , vol.4 , pp. 11-17
    • Myers, E.W.1    Miller, W.2
  • 9
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • Needleman, S.B. and Wunsch, C.D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
    • (1970) J. Mol. Biol. , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 10
    • 0023366792 scopus 로고
    • A multiple alignment program for protein sequences
    • Santibanez, M. and Rohde, K. (1987) A multiple alignment program for protein sequences. CABIOS, 3, 111-114.
    • (1987) CABIOS , vol.3 , pp. 111-114
    • Santibanez, M.1    Rohde, K.2
  • 12
    • 0023045778 scopus 로고
    • A multiple sequence alignment program
    • Sobel, E. and Martinez, H.M. (1986) A multiple sequence alignment program. Nucleic Acids Res., 14, 363-374.
    • (1986) Nucleic Acids Res. , vol.14 , pp. 363-374
    • Sobel, E.1    Martinez, H.M.2
  • 13
    • 0023364009 scopus 로고
    • Multiple sequence alignment by a pairwise algorithm
    • Taylor, W.R. (1987) Multiple sequence alignment by a pairwise algorithm. CABIOS. 3, 81-87.
    • (1987) CABIOS , vol.3 , pp. 81-87
    • Taylor, W.R.1
  • 14
    • 0020714456 scopus 로고
    • Rapid similarity searches of nucleic acid and protein data banks
    • Wilbur, W.J. and Lipman, D.J. (1983) Rapid similarity searches of nucleic acid and protein data banks. Proc. Natl. Acad. Sci. USA, 80. 726-730.
    • (1983) Proc. Natl. Acad. Sci. USA , vol.80 , pp. 726-730
    • Wilbur, W.J.1    Lipman, D.J.2
  • 16
    • 84910849810 scopus 로고
    • TupleScope: A graphical monitor and debugger for Linda-based parallel programs
    • Department of Computer Science, Yale University
    • Bercovitz, P. and Carriero, N. (1990) TupleScope: a graphical monitor and debugger for Linda-based parallel programs. Research Report YALEU/DCS/RR-782, Department of Computer Science, Yale University.
    • (1990) Research Report YALEU/DCS/RR-782
    • Bercovitz, P.1    Carriero, N.2
  • 17
    • 0024738868 scopus 로고
    • How to write parallel programs: A guide to the perplexed
    • Carriero, N. and Gclemter, D. (1989) How to write parallel programs: a guide to the perplexed. ACM Compul. Surv., 21, 323-357.
    • (1989) ACM Compul. Surv. , vol.21 , pp. 323-357
    • Carriero, N.1    Gclemter, D.2
  • 18
    • 0025634236 scopus 로고
    • Highly parallel computation
    • Denning, P.J. and Tichy, W.F. (1990) Highly parallel computation. Science, 250. 1217-1222.
    • (1990) Science , vol.250 , pp. 1217-1222
    • Denning, P.J.1    Tichy, W.F.2
  • 19
    • 0025909714 scopus 로고
    • A platform for biological sequence comparison on parallel computers
    • Deshpande, A.S., Richards, D.S. and Pearson, W.R. (1991) A platform for biological sequence comparison on parallel computers. Compul. Applic. Biosci., 7, 237-247.
    • (1991) Compul. Applic. Biosci. , vol.7 , pp. 237-247
    • Deshpande, A.S.1    Richards, D.S.2    Pearson, W.R.3
  • 20
    • 33747061052 scopus 로고
    • Gening the job done. 'Linda', a parallel-programming language, is easy, efficient, and portable
    • Gelemter, D. (1988) Gening the job done. 'Linda', a parallel-programming language, is easy, efficient, and portable. Byte. November, pp. 301-308.
    • (1988) Byte , pp. 301-308
    • Gelemter, D.1
  • 22
    • 0025820286 scopus 로고
    • Parallelizing genetic linkage analysis: A case study for applying parallel computation in molecular biology
    • Miller, P.L., Nadkami, P., Gelemter, J.E., Carriero, N., Pakstis, A.J. and Kidd, K.K. (1991a) Parallelizing genetic linkage analysis: a case study for applying parallel computation in molecular biology. Compul. Biomed. Res. 24, 234-248.
    • (1991) Compul. Biomed. Res. , vol.24 , pp. 234-248
    • Miller, P.L.1    Nadkami, P.2    Gelemter, J.E.3    Carriero, N.4    Pakstis, A.J.5    Kidd, K.K.6
  • 23
    • 0025977511 scopus 로고
    • Parallel computation and FASTA: Confronting the problems of parallel database search for a fast sequence comparison algorithm
    • Miller, P.L., Nadkami, P.M. and Carriero, N.M. (1991b) Parallel computation and FASTA: confronting the problems of parallel database search for a fast sequence comparison algorithm. Compul. Applic. Biosci., 7, 71-78.
    • (1991) Compul. Applic. Biosci. , vol.7 , pp. 71-78
    • Miller, P.L.1    Nadkami, P.M.2    Carriero, N.M.3
  • 24
    • 0023989064 scopus 로고
    • Improved tools for biological sequence analysis
    • Pearson, W.R. and Lipman, D. (1988) Improved tools for biological sequence analysis. Proc. Null. Acad. Sci. USA. 85, 2444-2448.
    • (1988) Proc. Null. Acad. Sci. USA , vol.85 , pp. 2444-2448
    • Pearson, W.R.1    Lipman, D.2
  • 25
    • 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


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