A polyhedral approach to sequence alignment problems

Discrete Applied Mathematics

Volumn 104, Issue 1-3, 2000, Pages 143-186

  Kececioglu, John D ^a   Lenhof, Hans Peter ^b   Mehlhorn, Kurt ^b   Mutzel, Petra ^b   Reinert, Knut ^b   Vingron, Martin ^c  

^a The University of Georgia ^*  (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c GERMAN CANCER RESEARCH CENTER DKFZ   (Germany)

Author keywords

Branch and cut; Combinatorial optimization; Computational biology; Multiple sequence alignment; RNA sequence alignment

Indexed keywords

EID: 0003321583     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00194-3     Document Type: Article

References (41)

1. Altschul S.F., Erickson B.W. Locally optimal subalignments using nonlinear similarity functions. Bull. Math. Biol. 48:1986;633-660.
2. D. Applegate, R. Bixby, V. Chvátal, B. Cook, Finding cuts in the TSP, DIMACS Technical Report 95-05, DIMACS, April 1995.
3. Bafna V., Muthukrishnan S., Ravi R. Computing similarity between RNA strings. Galil Z., Ukkonen E. Proceedings of the Sixth Annual Symposium on Combinatorial Pattern Matching (CPM-95). Lecture Notes in Computer Science. Vol. 937:1995;1-16 Springer, Berlin.
4. Corpet F., Michot B. RNAlign program: alignment of RNA sequences using both primary and secondary structures. CABIOS. 10(4):1994;389-399.
5. Dayhoff M.O., Schwartz R.M., Orcut B.C. A model of evolutionary change in proteins. Dayhoff M.O. Atlas of Proteins Sequence and Structure, Vol. 5. 1979;345-352 National Biomedical Research Foundation, Washington, DC.
6. de Rijk P., Van de Peer Y., Chapelle S., de Wachter R. Database on the structure of the small ribosomal subunit RNA. Nucleic Acids Res. 1994:22;3495-3501.
7. Eddy S.R., Durbin R. RNA sequence analysis using covariance models. Nucleic Acids Res. 22(11):1994;2079-2088.
8. Gorodkin J., Heyer L.J., Stormo G.D. Finding the most significant common sequence and structure motifs in a set of RNA sequences. Nucleic Acids Res. 25:1997;3724-3732.
9. Grötschel M., Jünger M., Reinelt G. A cutting plane algorithm for the linear ordering problem. Oper. Res. 32:1984;1195-1220.
10. Grötschel M., Lovász L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1:1981;169-197.
11. Grötschel M., Padberg M.W. Polyhedral theory, Wiley-Interscience Series in Discrete Mathematics and Optimization. 1985;Wiley, Chichester, UK.
12. Gupta S.K., Kececioglu J.D., Schaeffer A.A. Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Comput. Biol. 2:1995;459-472.
13. Hammer P.L., Johnson E.L., Peled U.N. Facets of Regular 0-1-Polytopes. Math. Programming. 8:1975;179-206.
14. Henikoff S., Henikoff J.G. Amino acid substitution matrices from protein blocks. Proc. Nat. Acad. Sci. USA. 89:1992;10 915-10 919.
15. Jünger M., Reinelt G., Rinaldi G. The traveling salesman problem. Ball M., Magnanti T., Monma C.L., Nemhauser G.L. Handbook on Operations Research and Management Science. 1995;225-330 Elsevier, North Holland.
16. Jünger M., G. Reinelt M., Thienel S. Practical problem solving with cutting plane algorithms in combinatorial optimization. Cook W., Lovász L., Seymour P. Combinatorial optimization: papers from the DIMACS special year, Vol. 20, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 1995;111-152 AMS, Providence, RI.
17. M. Jünger, S. Thienel, The design of the branch and cut system ABACUS, Technical Report 97.260, Institut für Informatik, Universität zu Köln, 1997.
18. Karp R.M., Papadimitriou C.H. On linear characterizations of combinatorial optimization problems. SIAM J. Comput. 11:1982;620-632.
19. J.D. Kececioglu, Exact and approximation algorithms for DNA sequence reconstruction, Ph.D. Thesis, University of Arizona, 1991.
20. J.D. Kececioglu, PRIMAL: Practical rigorous multiple alignment, Computer software, 1996.
21. H.-P. Lenhof, K. Reinert, M. Vingron, A polyhedral approach to RNA sequence structure alignment, Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB-98) ACM Press, New York, USA, 1998, pp. 153-162.
22. * algorithm for exact multiple sequence alignment, Research report MPI-I-97-1-028, Max-Planck-Institut für Informatik, Saarbrücken, 1997.
23. Levitt M. Detailed molecular model for transfer ribonucleic acid. Nature. 224:1969;759-763.
24. McClure M.A., Vasi T.K., Fitch W.M. Comparative analysis of multiple protein-sequence alignment methods. Mol. Biol. Evol. 11(4):1994;571-592.
25. Mehlhorn K., Näher S. LEDA, a platform for combinatorial and geometric computing. Commun. ACM. 38(1):1995;96-102.
26. B. Morgenstern, W.R. Atchley, K. Hahn, A. Dress, Segment-based scores for pairwise and multiple sequence alignments, Proceedings of the Sixth International Conference on Intelligent Systems for Molecular Biology (ISMB-98), 1998, in press.
27. Morgenstern B., Dress A., Werner T. Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Nat. Acad. Sci. 93:1996;12 098-12 103.
28. Needleman S.B., Wunsch C.D. A general method applicable to the search for similarities in the amino-acid sequence of two proteins. J. Mol. Biol. 48:1970;443-453.
29. Nemhauser G.L., Kan A., Rinnooy H.G., Todd (Eds.) M.J. Optimization, Vol. 1, Handbooks in Operations Research and Management Science. 1989;North-Holland, Amsterdam.
30. Nemhauser G.L., Trotter L.E. Properties of vertex packing and independence system polyhedra. Math. Programming. 6:1973;48-61.
31. Notredame C., O'Brien E.A., Higgins D.G. RAGA: RNA sequence alignment by genetic algorithm. Nucleic Acids Res. 25:1997;4570-4580.
32. Padberg M.W., Rinaldi G. Optimization of a 532 city symmetric traveling salesman problem by branch and cut. Oper. Res. Lett. 6:1987;1-7.
33. Pevzner P.A., Waterman M.S. Generalized sequence alignment and duality. Adv. Appl. Math. 14:1993;139-171.
34. K. Reinert, A polyhedral approach to sequence alignment problems, Ph.D. Thesis Universität des Saarlandes, Im Stadtwald, 66123 Saarbrücken, Germany, 1999.
35. Sankoff D. Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM J. Appl. Math. 45(5):1985;810-825.
36. Sankoff D., Kruskal J.B. Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparison. 1983;Addison-Wesley, Reading, MA.
37. Schrijver A. Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics and Optimization. 1986;Wiley, Chichester, UK.
38. Tsukiyama S., Ide M., Ariyoshi H., Shirawaka I. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6:1977;505-517.
39. Vingron M., Pevzner P. Multiple sequence comparison and consistency on multipartite graphs. Adv. Appl. Math. 16:1995;1-22.
40. M.S. Waterman, Consensus methods for folding single-stranded nucleic acids, Mathematical Methods for DNA Sequences, CRC Press, Boca Raton, FL, 1989, pp. 185-224.
41. Wilbur W.J., Lipman D.J. The context dependent comparison of biological sequences. SIAM J. Appl. Math. 44(3):1984;557-567.