Integer programming models for computational biology problems

Journal of Computer Science and Technology

Volumn 19, Issue 1, 2004, Pages 60-77

  Lancia, Giuseppe ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Computational biology; Genome rearrangements; Integer programming; Protein structures; Sequence alignment

Indexed keywords

COMPUTATIONAL METHODS; MOLECULAR BIOLOGY; OPTIMIZATION; PROBLEM SOLVING;

COMPUTATIONAL BIOLOGY; GENOME REARRANGEMENTS; PROTEIN STRUCTURES; SEQUENCE ALIGNMENT;

INTEGER PROGRAMMING;

EID: 1242265365     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02944785     Document Type: Article

References (50)

1. Nemhauser G L, Wolsey L. Integer and Combinatorial Optimization. New York: John Wiley & Sons, 1988.
2. Cook W J, Cunningham W H, Pulleyblank W R, Schrijver A. Combinatorial Optimization. New York: John Wiley & Sons, 1998.
3. Schrijver A. Theory of Linear and Integer Programming. New York: John Wiley & Sons, 1986.
4. Reinert K, Lenhof H-P, Mutzel P, Mehlhorn K, Kececioglu J. A branch-and-cut algorithm for multiple sequence alignment. In Proc. the Annual International Conference on Computational Molecular Biology (RECOMB), 1997, pp.241-249.
5. Kececioglu J, Lenhof H-P, Mehlhorn K, Mutzel P, Reinert K, Vingron M. A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics, 2000, 104: 143-186.
6. Fischetti M, Lancia G, Serafini P. Exact algorithms for minimum routing cost trees. Networks, 2002, 39(3): 161-173.
7. Gusfield D. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology, 1993, 55: 141-154.
8. Ben-Dor A, Lancia G, Perone J, Ravi R. Banishing bias from consensus sequences. In Proc. the Annual Symposium on Combinatorial Pattern Matching, (CPM), Lecture Notes in Computer Science 1264, 1997, pp.247-261.
9. Li M, Ma B, Wang L. On the closest string and substring problems. Journal of the ACM, 2002, 49(2): 157-171.
10. Ma B. A polynomial time approximation scheme for the closest substring problem. In Proc. the Annual Symposium on Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science 1848, 2000, pp.99-107.
11. Lanctot J, Li M, Ma B et al. Distinguishing string selection problems. In Proc. the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, 1999, pp.633-642.
12. Lenhof H-P, Reinert K, Vingron M. A polyhedral approach to RNA sequence structure alignment. Journal of Computational Biology, 1998, 5(3); 517-530.
13. Lancia G, Carr R, Walenz B et al. 101 optimal PDB structure alignments: A branch-and-cut algorithm for the maximum contact map overlap problem. In Proceedings of the Annual International Conference on Computational Biology (RECOMB), 2001, pp.193-202.
14. Caprara A, Lancia G, Ng S K. A Column-Generation Based Branch-and-Bound Algorithm for Sorting by Reversals. In Mathematical Support for Molecular Biology, Farach-Colton M, Roberts F S, Vingron M, Waterman M (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1999, 47: 213-226.
15. Caprara A, Lancia G, Ng S K. Sorting permutations by reversals through branch and price. INFORMS Journal on Computing, 2001, 13(3): 224-244.
16. Lancia G, Bafna V, Istrail S et al. SNPs problems, complexity and algorithms. In Proc. the Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 2161, 2001, pp.182-193.
17. Lippert R, Schwartz R, Lancia G et al. Algorithmic strategies for the SNPs haplotype assembly problem. Briefings in Bioinformatics, 2002, 3(1): 23-31.
18. Gusfield D. A practical algorithm for optimal inference of haplotypes from diploid populations. In Proceedings of the Annual International Conference on Intelligent Systems for Molecular Biology (ISMB), 2000, pp.183-189.
19. Gusfield D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms. Journal of Computational Biology, 2001, 8(3): 305-324.
20. Gusfield D. Haplotype inference by pure parsimony. Technical Report CSE-2003-2, Department of Computer Science, University of California at Davis, 2003.
21. Xu J, Li M, Kim D et al. RAPTOR: Optimal protein threading by linear programming. Journal of Bioinformatics and Computational Biology, 2003, 1(1): 95-117.
22. Christof T, Junger M, Kececioglu J et al. A branch-and-cut approach to physical mapping with end-probes. In Proc. the Annual International Conference on Computational Molecular Biology (RECOMB), 1997.
23. Agarwala R, Applegate D, Maglott D et al. A fast and scalable radiation hybrid map construction and integration strategy. Genome Research, 2000, 10: 230-364.
24. Kachian L G. A polynomial algorithm for linear programming. Soviet Mathematics Doklady, 1979, 20: 191-194.
25. Karmarkar N. A new polynomial time algorithm for linear programming. Combinatorica, 1984, 4: 375-395.
26. Grötschel M, Lovász L, Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1981, 1: 169-197.
27. Barnhart C, Johnson E L, Nemhauser G L et al. Branch-and-price: Column generation for solving huge integer programs. Operations Research, 1998, 46(3): 316-329.
28. Casey D. The Human Genome Project Primer on Molecular Genetics. U.S. Department of Energy, http://www.ornl.gov/hgmis/publicat/primer/intro.html, 1992.
29. Fitch W M. An Introduction to Molecular Biology for Mathematicians and Computer Programmers. In Mathematical Support for Molecular Biology, Farach-Colton M, Roberts F S, Vingron M, Waterman M (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1999, 47: 1-31.
30. Watson J D, Gilman M, Witkowski J et al. Recombinant DNA. Scientific American Books, W.H. Freeman and Co, 1992.
31. Caprara A, Lancia G. Structural alignment of large-size proteins via Lagrangian relaxation. In Proc. the Annual International Conference on Computational Molecular Biology (RECOMB), 2002, pp.100-108.
32. Needleman S B, Wunsch C D. An efficient method applicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology, 1970, 48: 443-453.
33. Wang L, Jiang T. On the complexity of multiple sequence alignment. Journal of Computational Biology, 1994, 1: 337-348.
34. Sankoff D, Kruskal J. Time Warps, String Edits, and Macromolecules: The Theory and Practice of String Comparison. CSLI Publications, 1999.
35. Kececioglu J. The maximum weight trace problem in multiple sequence alignment. In Proc. the Annual Symposium on Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science 684, 1993, pp.106-119.
36. Wu B Y, Lancia G, Bafna V et al. A polynomial-time approximation scheme for minimum cost spanning trees. SIAM Journal on Computing, 1999, 29(3): 761-778.
37. Frances M, Litman A. On covering problems of codes. Theory of Computing Systems, 1997, 30(2): 113-119.
38. Raghavan P, Thompson C D. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 1987, 7: 365-374.
39. Raghavan P. A probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 1988, 37: 130-143.
40. Lemmen C, Lengauer T. Computational methods for the structural alignment of molecules. Journal of Computer-Aided Molecular Design, 2000, 14: 215-232.
41. Berman H M, Westbrook J, Feng Z et al. The protein data bank. Nucleic Acids Research, 2000, 28: 235-242.
42. Goldman D, Istrail S, Papadimitriou C. Algorithmic aspects of protein structure similarity. In Proc. the Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp.512-522.
43. Godzik A, Skolnick J, Kolinski A. A topology fingerprint approach to inverse protein folding problem. Journal of Molecular Biology, 1992, 227: 227-238.
44. Bafna V, Pevzner P A. Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 1996, 25: 272-289.
45. Caprara A. On the tightness of the alternating-cycle lower bound for sorting by reversals. Journal of Combinatorial Optimization, 1999, 3: 149-182.
46. Caprara A. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics, 1999, 12: 91-110.
47. Grötschel M, Pulleyblank W. R. Weakly bipartite graphs and the max-cut problem. Operations Research Letters, 1981, 1: 23-27.
48. Clark A. Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biology Evolution, 1990, 7, 111-122.
49. Lancia G, Pinotti C, Rizzi R. Haplotyping populations: Complexity and approximations. Technical Report, University of Trento, 2002.
50. Applegate D, Bixby R, Chvatal V et al. CONCORDE: A code for solving traveling salesman problems. http://www.math.princeton.edu/tsp/concorde.html.