메뉴 건너뛰기




Volumn 13, Issue 6, 1997, Pages 565-581

A genetic algorithm for multiple molecular sequence alignment

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; DNA SEQUENCE; PRIORITY JOURNAL; RNA SEQUENCE; SEQUENCE ANALYSIS; STOCHASTIC MODEL; TECHNIQUE; TIME;

EID: 0031461056     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/13.6.565     Document Type: Article
Times cited : (73)

References (37)
  • 1
    • 0002584399 scopus 로고
    • An extension to the theory of convergence and a proof of the time complexity of genetic algorithms
    • Rawlins, G.J.E. (ed.), Morgan Kaufmann Publishers, San Mateo, CA, pp
    • Ankenbrandt, C.A. (1991) An extension to the theory of convergence and a proof of the time complexity of genetic algorithms. In Rawlins, G.J.E. (ed.), Foundations of Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, pp. 53-68.
    • (1991) Foundations of Genetic Algorithms , pp. 53-68
    • Ankenbrandt, C.A.1
  • 3
    • 0025533438 scopus 로고
    • Schema survival rates and heuristic search in genetic algorithms
    • IEE Computer Society Press, Los Alamitos, CA, pp
    • Buckles, B.P., Petry, F.E. and Kuester, R.L. (1990) Schema survival rates and heuristic search in genetic algorithms. In Proceedings of Tools for Artificial Intelligence. IEE Computer Society Press, Los Alamitos, CA, pp. 322-327.
    • (1990) Proceedings of Tools for Artificial Intelligence , pp. 322-327
    • Buckles, B.P.1    Petry, F.E.2    Kuester, R.L.3
  • 5
    • 0026887079 scopus 로고
    • A survey of multiple sequence comparison methods
    • Chan.S.C, Wong, A.K.C. and Chiu.D.K.Y. (1992) A survey of multiple sequence comparison methods. Bull. Math. Biol, 54, 563-598.
    • (1992) Bull. Math. Biol , vol.54 , pp. 563-598
    • Chan, S.C.1    Wong, A.K.C.2    Chiu, D.K.Y.3
  • 6
    • 0026448484 scopus 로고
    • Potential of genetic algorithms in protein folding and protein engineering simulations
    • Dandekar.T. and Argos.P. (1992) Potential of genetic algorithms in protein folding and protein engineering simulations. Protein Eng., 5, 637-545.
    • (1992) Protein Eng , vol.5 , pp. 637-545
    • Dandekar, T.1    Argos, P.2
  • 7
    • 34250090619 scopus 로고
    • Learning with genetic algorithms: An overview
    • Kluwer Academic, Hingham, MA, pp
    • De Jong K. (1988) Learning with genetic algorithms: an overview. Machine Learning 3. Kluwer Academic, Hingham, MA, pp. 121-138.
    • (1988) Machine Learning , vol.3 , pp. 121-138
    • de Jong, K.1
  • 8
    • 0023084055 scopus 로고
    • Progressive sequence alignment as prerequisite to correct phylogenetic trees
    • Feng, D.F. and Doolittle, R.F. (1987) Progressive sequence alignment as prerequisite to correct phylogenetic trees. J. Mol. Evoi, 25, 351-360.
    • (1987) J. Mol. Evoi , vol.25 , pp. 351-360
    • Feng, D.F.1    Doolittle, R.F.2
  • 9
    • 0021712450 scopus 로고
    • Aligning amino acid sequences: Comparison of commonly used methods
    • Feng, D.F., Johnson.M.S. and Doolittle, R.F. (1985) Aligning amino acid sequences: comparison of commonly used methods. J. Mol. Evol., 21, 112-125.
    • (1985) J. Mol. Evol. , vol.21 , pp. 112-125
    • Feng, D.F.1    Johnson, M.S.2    Doolittle, R.F.3
  • 10
    • 0002076808 scopus 로고
    • Simple genetic algorithms and the minimal, deceptive problem
    • Davis, L. (ed.), Pitman, London, pp
    • Goldberg, D.E. (1987) Simple genetic algorithms and the minimal, deceptive problem. In Davis, L. (ed.). Genetic Algorithms and Simulated Annealing. Pitman, London, pp. 74—88.
    • (1987) Genetic Algorithms and Simulated Annealing , pp. 74-88
    • Goldberg, D.E.1
  • 13
    • 0020484488 scopus 로고
    • An improved algorithm for matching biological sequences
    • Gotoh O. (1982) An improved algorithm for matching biological sequences.. Mol. Biol., 162, 705-708.
    • (1982) Mol. Biol. , vol.162 , pp. 705-708
    • Gotoh, O.1
  • 14
    • 0025138774 scopus 로고
    • Consistency of optimal sequence alignments
    • Gotoh, O. (1990) Consistency of optimal sequence alignments. Bull. Math. Biol., 52, 509-525.
    • (1990) Bull. Math. Biol. , vol.52 , pp. 509-525
    • Gotoh, O.1
  • 15
    • 0022559425 scopus 로고
    • Optimization of control parameters for genetic algorithms
    • Grefenstette.J.J. (1986) Optimization of control parameters for genetic algorithms. IEEE Trans. System Man Cybernet., 16, 122-128.
    • (1986) IEEE Trans. System Man Cybernet. , vol.16 , pp. 122-128
    • Grefenstette, J.J.1
  • 17
    • 0029131909 scopus 로고
    • The influence of a metastable structure in plasmid primer RNA on antisense RNA binding kinetics
    • Gultyaev, A.P., Batenbury.F.H.D.V. and Pleij.C.W.A. (1995) The influence of a metastable structure in plasmid primer RNA on antisense RNA binding kinetics. Nucleic Acids Res., 23.3718-3725.
    • (1995) Nucleic Acids Res , vol.23 , pp. 3718-3725
    • Gultyaev, A.P.1    Batenbury, F.H.D.V.2    Pleij, C.W.A.3
  • 18
    • 0027351056 scopus 로고
    • Efficient methods for multiple sequence alignment with guaranteed error bounds
    • Gusfield.D. (1993) Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol., 55, 141-154.
    • (1993) Bull. Math. Biol. , vol.55 , pp. 141-154
    • Gusfield, D.1
  • 19
    • 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
  • 21
    • 0000746883 scopus 로고
    • Escaping brittleness: The possibilities of general-pur-pose learning algorithms applied to parallel rule-based systems
    • Michalski et al., Morgan Kaufmann, San Mateo. CA, Vol., pp
    • HollandJ.H. (1986) Escaping brittleness: The possibilities of general-pur-pose learning algorithms applied to parallel rule-based systems. In Michalski et al. (eds), Machine Learning: An Artificial Intelligence Approach. Morgan Kaufmann, San Mateo. CA, Vol. 2, pp. 593-623.
    • (1986) Machine Learning: An Artificial Intelligence Approach , vol.2 , pp. 593-623
    • Hollandj, H.1
  • 23
    • 0025914739 scopus 로고
    • The bacterial porin superfamily: Sequence alignment and structure prediction
    • Jeanteur.D., Lakey.J.H. and Pattus.F. (1991) The bacterial porin superfamily: sequence alignment and structure prediction. Mol. Microbioi, 5, 2153-2164.
    • (1991) Mol. Microbioi , vol.5 , pp. 2153-2164
    • Jeanteur, D.1    Lakey, J.H.2    Pattus, F.3
  • 25
    • 0027157846 scopus 로고
    • Building multiple alignment from pairwise alignments
    • Miller, W. (1993) Building multiple alignment from pairwise alignments. Comput. Applic. Biosci., 9, 169-176.
    • (1993) Comput. Applic. Biosci. , vol.9 , pp. 169-176
    • Miller, W.1
  • 26
  • 27
    • 0026571052 scopus 로고
    • A search for common patterns in many sequences
    • Roytberg.M. (1992) A search for common patterns in many sequences. Comput. Applic. Biosci., 8, 57-64.
    • (1992) Comput. Applic. Biosci. , vol.8 , pp. 57-64
    • Roytberg, M.1
  • 28
    • 0015252494 scopus 로고
    • Matching sequence under deletion-insertion constraints
    • Sankoff.D. (1972) Matching sequence under deletion-insertion constraints. Proc. Natl Acad. Sci. USA, 64, 4-6.
    • (1972) Proc. Natl Acad. Sci. USA , vol.64 , pp. 4-6
    • Sankoff, D.1
  • 29
  • 30
    • 0025538320 scopus 로고
    • Using genetic algorithms for supervised concept learning
    • IEEE Computer Society Press. Los Alamitos. CA. pp
    • Spears.W.M. and De Jong.K.A. (1990) Using genetic algorithms for supervised concept learning. In Proceedings of Tools for Artificial Intelligence. IEEE Computer Society Press. Los Alamitos. CA. pp. 335-341.
    • (1990) Proceedings of Tools for Artificial Intelligence , pp. 335-341
    • Spears, W.M.1    de Jong, K.A.2
  • 31
    • 0027968068 scopus 로고
    • CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice
    • Thompson.J.D., Higgins.D.G. and Gibson.T.J. (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res., 22. 4673-4680.
    • (1994) Nucleic Acids Res , vol.22 , pp. 4673-4680
    • Thompson, J.D.1    Higgins, D.G.2    Gibson, T.J.3
  • 32
    • 0027245418 scopus 로고
    • Genetic algorithms for protein folding simulations
    • Unger.R. and Moult.J. (1993) Genetic algorithms for protein folding simulations../. Mol. Biol.. 231. 75-81.
    • (1993) Mol. Biol. , vol.231 , pp. 75-81
    • Unger, R.1    Moult, J.2
  • 33
    • 0029025720 scopus 로고
    • An APL-programmed genetic algorithm for the prediction of RNA secondary structure
    • van Batenbury.F.H.D.. Gultyaev.A.P. and Pleij.C.W.A. (1995) An APL-programmed genetic algorithm for the prediction of RNA secondary structure. J. Theor. Biol., 174. 269-280.
    • (1995) J. Theor. Biol. , vol.174 , pp. 269-280
    • van Batenbury, F.H.D.1    Gultyaev, A.P.2    Pleij, C.W.A.3
  • 35
    • 0026036377 scopus 로고
    • Motif recognition and alignment for many sequences by comparison of dot-matrices
    • Vingron.M. and Argos.P. (1991) Motif recognition and alignment for many sequences by comparison of dot-matrices../. Mol. Biol.. 218. 33-3.
    • (1991) Mol. Biol. , vol.218 , pp. 33-33
    • Vingron, M.1    Argos, P.2
  • 36
    • 0000329809 scopus 로고
    • General methods of sequence comparison
    • Waterman.M.S. (1984) General methods of sequence comparison. Bull. Math. Biol.. 46. 473-500.
    • (1984) Bull. Math. Biol. , vol.46 , pp. 473-500
    • Waterman, M.S.1
  • 37
    • 0023057161 scopus 로고
    • Multiple sequence alignment by consensus
    • Waterman, M.S. (1986) Multiple sequence alignment by consensus. Nucleic Acids Res . 14. 9095-9102.
    • (1986) Nucleic Acids Res , vol.14 , pp. 9095-9102
    • Waterman, M.S.1


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