Rearrangement of DNA fragments: A branch-and-cut algorithm

Discrete Applied Mathematics

Volumn 116, Issue 1-2, 2002, Pages 161-177

  Ferreira, C E ^a   De Souza, C C ^b   Wakabayashi, Y ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Branch and cut; Computational biology; Integer programming; Polyhedral combinatorics

Indexed keywords

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

References (9)

1. H. Crowder, and M.W. Padberg Solving large-scale symmetric traveling salesman problems to optimality Management Sci. 26 1980 495 509
2. M.R. Garey, and D.S. Johnson Computer and Intractability - A Guide to the Theory of NP-Completeness 1979 Freeman New York
3. M. Grötschel, L. Lovász, and A. Schrijver Geometric Algorithms and Combinatorial Optimization 1988 Springer Berlin
4. J.D. Kececioglu, Exact and approximation algorithms for DNA sequence reconstruction, Ph.D. Thesis, University of Arizona, Tucson, 1991.
5. J.D. Kececioglu, and E.W. Myers Combinatorial algorithms for DNA sequence assembly Algorithmica 13 1995 7 51
6. J. Meidanis, Algorithms for problems in computational genetics, Ph.D. Thesis, University of Wisconsin, Madison, 1992.
7. J. Meidanis, and J.C. Setubal Computational Molecular Biology 1997 PWS Publishing Company Boston
8. M.W. Padberg, and M. Grötschel Polyhedral aspects of the travelling salesman problem II: Computations E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, The Travelling Salesman Problem 1985 Wiley New York
9. A.F. Siegel, J.C. Roach, C. Magness, E. Thayer, and G. van den Engh Optimization of restriction fragment DNA mapping J. Comput. Biol. 5 1 1998 113 126 (Pubitemid 28153009)