Local multiple sequence alignment using dead-end elimination

Bioinformatics

Volumn 15, Issue 11, 1999, Pages 947-953

  Lukashin, Alexander V ^a   Rosa, Joseph J ^a  

^a BIOGEN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROTEIN;

ALGORITHM; CONFERENCE PAPER; DATA BASE; INFORMATION PROCESSING; PRIORITY JOURNAL; SEQUENCE HOMOLOGY;

EID: 0033376806     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/15.11.947     Document Type: Conference Paper

References (29)

1. Bailey, T.L. and Elkan, C. (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology 2, pp. 28-36.
2. Bairoch, A. (1993) The PROSITE dictionary of sites and patterns in proteins, its current status. Nucleic Acids Res., 21, 3097-3103.
3. Bork, P. and Koonin, E.V. (1996) Protein sequence motifs. Curr. Opin. Struct. Biol., 6, 366-376.
4. Brennan, R.G. and Matthews, B.W. (1989) The helix-turn-helix DNA binding motif. J. Biol. Chem., 264, 1903-1906.
5. Brocchieri, L. and Karlin, S. (1998) A symmetric-iterated multiple alignment of protein sequences. J. Mol. Biol., 276, 249-264.
6. Bucher, P., Karplus, K., Moeri, N. and Hofman, K. (1996) A flexible motif search technique based on generalized profiles. Comput. Chem., 20, 3-23.
7. Collins, F.S., Patrinos, A., Jordan, E., Chakravarti, A., Gesteland, R., Walters, L. and the members of the DOE and NIH planning groups, (1998) New goals for the U.S. Human Genome Project: 1998-2003. Science, 282, 682-689.
8. Dahiyat, B.I. and Mayo, S.L. (1997) De novo protein design: fully automated sequence selection. Science, 278, 82-87.
9. De Maeyer, M., Desmet, J. and Lasters, I. (1997) All in one: a highly detailed rotamer library improves both accuracy and speed in the modelling of sidechains by dead-end elimination. Fold. Des., 2, 53-66.
10. Depiereux, E. and Feytmans, E. (1992) MATCH-BOX: a fundamentally new algorithm for the simultaneous alignment of several protein sequences. Comput. Appl. Biosci., 8, 501-509.
11. Desjarlais, J.R. and Clarke, N.D. (1998) Computer search algorithms in protein modification and design. Curr. Opin. Struct. Biol., 8, 471-475.
12. Desmet, J., De Maeyer, M., Hazes, B. and Lasters, I. (1992) The dead-end elimination theorem and its use in protein side-chain positioning. Nature, 356, 539-542.
13. Goldstein, R.F. (1994) Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J., 66, 1335-1340.
14. Gotoh, O. (1996) Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. J. Mol. Biol., 264, 823-838.
15. Henikoff, S. (1996) Scores for sequence searches and alignments. Curr. Opin. Struct. Biol., 6, 353-360.
16. Henikoff, S. and Henikoff, J.G. (1992) Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. USA, 89, 10915-10919.
17. Henikoff, S., Henikoff, J.G., Alford, W.J. and Pietrokovski, S. (1995) Automated construction and graphical presentation of protein blocks from unaligned sequences. Gene, 163, GC17-GC26.
18. Holm, L. and Sander, C. (1994) Searching protein structure databases has come of age. Proteins, 19, 165-173.
19. Lasters, I. and Desmet, J. (1993) The fuzzy-end elimination theorem:correctly implementing the side chain placement algorithm based on thedead-end elimination theorem. Protein Eng., 6, 717-722.
20. Lasters, I., De Maeyer, M. and Desmet, J. (1995) Enhanced dead-end elimination in the search for the global minimum energy conformation of a collection of protein side chains. Protein Eng., 8, 815-822.
21. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F. and Wooton, J.C. (1993) Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science, 262, 208-214.
22. Lukashin, A.V., Engelbrecht, J. and Brunak, S. (1992) Multiple alignment using simulated annealing: branch point definition in human mRNA splicing. Nucleic Acids Res., 20, 2511-2516.
23. Mirny, L.A., Abkevich, V.I. and Shakhnovich, E.I. (1998) How evolution makes proteins fold quickly. Proc. Natl. Acad. Sci. USA, 95, 4976-4981.
24. Shuler, G.D., Altschul, S.F. and Lipman, D.J. (1991) A workbench for multiple alignment construction and analysis. Proteins, 9, 180-190.
25. Smith, H.O., Annau, T.M. and Chandrasegaran, S. (1990) Finding sequence motifs in groups of functionally related proteins. Proc. Natl. Acad. Sci. USA, 87, 826-830.
26. Stormo, G.D. and Hartzell, G.W. III (1989) Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl. Acad. Sci. USA, 86, 1183-1187.
27. Wang, L. and Jiang, T. (1994) On the complexity of multiple sequence alignment. J. Comput. Biol., 1, 337-348.
28. Wareham, H.T. (1995) A simplified proof of the NP- and MAX SNP-hardness of multiple sequence tree alignment. J. Comput. Biol., 2, 509-514.
29. Waterman, M.S. and Jones, M.S. (1990) Consensus methods for DNA and protein sequence alignment. Methods Enzymol., 183, 221-237.