Compact optimization can outperform separation: A case study in structural proteomics

4OR

Volumn 2, Issue 3, 2004, Pages 221-233

  Carr, Robert D ^a   Lancia, Giuseppe G ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Compact optimization; Contact map; Linear programming; Subtourelimination

Indexed keywords

EID: 29044441607     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-004-0036-8     Document Type: Article

References (21)

1. Arthanari TS, Usha M (2000) An alternate formulation of the symmetric traveling Salesman problem and its properties. Discrete Applied Mathematics 98(3): 173-190.
2. Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE (2000) The protein data bank. Nucleic Acids Research 28: 235-242.
3. Carr RD (1996) Separating over classes of TSP inequalities defined by 0 node lifting in polynomial time. IPCO 96, Springer Lecture Notes in Computer Science 1084: 460-474.
4. Carr RD, Lancia GG (2002) Compact vs. exponential-size LP relaxations. Operations Research Letters 30(1): 57-65.
5. Claus A (1984) A new formulation for the traveling salesman problem. SIAM Journal on Algorithms and Discrete Methods 5: 21-25.
6. Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1998) Combinatorial optimization. Wiley, NewYork.
7. Eidhammer I, Jonassen I, Taylor WR (2000) Structure comparison and structure prediction. Journal of Computational Biology 7(5): 685-716.
8. Godzik A (1996) The structural alignment between two proteins: Is there a unique answer? Protein Science 5: 1325-1338.
9. Godzik A, Skolnick J, Kolinski A (1992) A topology fingerprint approach to inverse protein folding problem. Journal of Molecular Biology 227: 227-238.
10. Godzik A, Skolnick J (1994) Flexible algorithm for direct multiple alignment of protein structures and sequences. CABIOS 10(6): 587-596.
11. Goldman D, Istrail S, Papadimitriou C (1999) Algorithmic aspects of protein structure similarity. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp 512-522.
12. Goldman D (2000) PhD Thesis, Deptartment of Computer Science, UC Berkeley.
13. Grötschel M, Lovász L, SchrijverA (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1: 169-197.
14. Hwlang FK, Richards DS, Winter P (1992) The Steiner tree problem, vol. 53 (Annals of Discrete Mathematiks 53). North Holland, Amsterdam.
15. Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Proceedings of ACM Symposium on Theory of Computing (STOC), pp 302-311.
16. Lancia GG, Carr RD, Walenz B, Istrail S (2001) 101 optimal PDB structure alignments: A branch-andcut algorithm for the maximum contact map overlap problem. Proceedings of 5thACM Intl. Conf. on Computational Molecular Biology (RECOMB), pp 193-202.
17. Lawler E, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) (1985) Traveling salesman problem: A guided tour of combinatorial optimization. Wiley, NewYork.
18. Lenhof HP, Reinert K, VingronM (1998)A polyhedral approach to RNA sequence structure alignment. Journal of Computational Biology 5(3): 517-530.
19. Martin K (1991) Using separation algorithms to generate mixed integer model reformulations. Operations Research Letters 10: 119-128.
20. Tamir A (1991) On the core of network synthesis games. Mathematical Programming 50: 123-135.
21. Wong RT (1984) A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming 28: 271-287.