Mathematical programming in computational biology: An annotated bibliography

Algorithms

Volumn 1, Issue 2, 2008, Pages 100-129

  Lancia, Giuseppe ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Bioinformatics; Computational biology; Haplotyping; Integer programming; Linear programming; Mathematical programming; Protein structures; Sequencing

Indexed keywords

EID: 70349869797     PISSN: None     EISSN: 19994893     Source Type: Journal    
DOI: 10.3390/a1020100     Document Type: Article

References (80)

1. Crescenzi, P.; Goldman, D.; Papadimitriou, C. H.; Piccolboni, A.; Yannakakis, M. On the complexity of protein folding. J. Comp. Biol. 1998, 5, 423-466.
2. Alizadeh, F.; Karp, R.; Weisser, D.; Zweig, G. Physical mapping of chromosomes using unique probes. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM press, New York, NY, 1994, pp. 489-500.
3. Watson, J. D.; Gilman, M.; Witkowski, J.; Zoller, M. Recombinant DNA. Scientific American Books. W.H. Freeman and Co, 1992.
4. Wang, L.; Jiang, T. On the complexity of multiple sequence alignment. J. Comp. Biol. 1994, 1, 337-348.
5. Kececioglu, J. The maximum weight trace problem in multiple sequence alignment. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM). Springer, 1993, Vol. 684, Lecture Notes in Computer Science, pp. 106-119.
6. Kececioglu, J.; Lenhof, H.-P.; Mehlhorn, K.; Mutzel, P.; Reinert, K.; Vingron, M. A polyhedral approach to sequence alignment problems. Discrete Appl. Math. 2000, 104, 143-186.
7. Althaus, E.; Caprara, A.; Lenhof, H.-P.; Reinert, K. A branch-and-cut algorithm for multiple sequence alignment. Mathematical Programming 2006, 105, 387-425.
8. Kececioglu, J.; Kim, E. Simple and fast inverse alignment. In Proceedings of the 10th Annual International Conference on Computational Molecular Biology (RECOMB). Springer, Berlin, 2006, Vol. 3903, Lecture Notes in Bioinformatics, pp. 441-455.
9. Fischetti, M.; Lancia, G.; Serafini, P. Exact algorithms for minimum routing cost trees. Networks 2002, 39, 161-173.
10. Just, W.; Vedova, G. D. Multiple sequence alignment as a facility-location problem. INFORMS J. Comp. 2004, 16, 430-440.
11. Boros, E.; Everett, L. A linear programming approach for optimal protein encoding. Rutcor Research Report 14-2005, RUTCOR, New Brunswick, NJ, 2005.
12. Meneses, C.; Lu, Z.; Oliveira, C.; Pardalos, P. Optimal solutions for the closest-string problem via integer programming. INFORMS J. Comp. 2004, 16.
13. Ben-Dor, A.; Lancia, G.; Perone, J.; Ravi, R. Banishing bias from consensus sequences. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM). Springer, 1997, Vol. 1264, Lecture Notes in Computer Science, pp. 247-261.
14. Lanctot, J.; Li, M.; Ma, B.; Wang, S.; Zhang, L. Distinguishing string selection problems. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 633-642.
15. Li, M.; Ma, B.; Wang, L. On the closest string and substring problems. J. Assoc. Comp. Mach. 2002, 49, 157-171.
16. Deng, X.; Li, G.; Li, Z.; Ma, B.; Wang, L. Genetic design of drugs without side-effects. SIAM J. Comp. 2003, 32, 1073-1090.
17. Kececioglu, J. D.; Yu, J. Separtating repeats in DNA sequence assembly. In Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB). ACM Press, New York, NY, 2001, pp. 176-183.
18. Ferreira, C. E.; de Souza, C. C.; Wakabayashi, Y. Rearrangement of DNA fragments: a branchand-cut algorithm. Discrete Appl. Math. 2002, 116, 161-177.
19. Kingsford, K.; Zaslavsky, E.; Singh, M. A compact mathematical programming formulation for dna motif finding. In Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, 2006.
20. Zaslavsky, E.; Singh, M. A combinatorial approach for diverse motif finding applications. Algorithms Mol. Biol. 2006, 1.
21. Alizadeh, F.; Karp, R.; Newberg, L.; Weisser, D. Physical mapping of chromosomes: A combinatorial problem in molecular biology. Algorithmica 1995, 13, 52-76.
22. Ben-Dor, A.; Chor, B. On constructing radiation hybrid maps. J. Comp. Biol. 1997, 4, 517-533.
23. Ben-Dor, A.; Chor, B.; Pelleg, D. Rho-Radiation Hybrid Ordering. Genome Res. 2000, 10, 365-378.
24. Lin, S.; Kernigan, B. An efficient heuristic algorithm for the traveling-salesman problem. Operations Res. 1973, 21.
25. Agarwala, R.; Applegate, D.; Maglott, D.; Schuler, G.; Schaffer, A. A fast and scalable radiation hybrid map construction and integration strategy. Genome Res. 2000, 10, 230-364.
26. Applegate, D.; Bixby, R.; Chvatal, V.; W.Cook., Eds. CONCORDE: A code for solving Traveling Salesman Problems. World Wide Web, http://www.math.princeton.edu/tsp/concorde.html, http://www.math.princeton.edu/tsp/concorde.html.
27. Christof, T.; Junger, M.; Kececioglu, J.; Mutzel, P.; Reinelt, G. A branch-and-cut approach to physical mapping with end-probes. In Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB). ACM Press, New York, NY, 1997.
28. Christof, T.; Kececioglu, J. D. Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut. In Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB). ACM Press, New York, NY, 1999, pp. 115-123.
29. Klau, G. W.; Rahmann, S.; Schliep, A.; Vingron, M.; Reinert, K. Optimal robust non-unique probe selection using integer linear programming. Bioinformatics 2004, 20, 186-193.
30. Garey, M.; Johnson, D. Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, CA, San Francisco, CA, 1979.
31. Bontridder, K. M. D.; Halldorsson, B.; Halldorsson, M.; Hurkens, C. A. J.; Lenstra, J. K.; Ravi, R.; Stougie, L. Approximation algorithms for the test cover problem. Math. Program. B 2003, 98, 477-491.
32. Munagala, K.; Tibshirani, R.; Brown, P. O. Cancer characterization and feature set extraction by discriminative margin clustering. BMC Bioinformatics 2004, 5.
33. Berretta, R.; Mendes, A.; Moscato, P. Integer programming models and algorithms for molecular classification of cancer from microarray data. In Proceedings of the 28th Australian Computer Science Conference (ACSC). Australian Computer Society, Sidney, 2005, Vol. 38, Conferences in research and practice in information technology, pp. 361-370.
34. Moscato, P.; Berretta, R.; Mendes, A.; Hourani, M.; Cotta, C. Genes related with alzhaimer's disease: a comparison of evolutionary search, statistical and integer programming approaches. In Proceedings of the 3rd European Workshop on Evolutionary Bioinformatics. Springer, Berlin, 2005, Vol. 3449, Lecture Notes in Computer Science, pp. 84-94.
35. Bhattacharyya, C.; Grate, L. R.; Rizki, A.; Radisky, D.; Molina, F. J.; Jordan, M. I.; Bissell, M. J.; Mian, I. S. Simultaneous classification and relevant feature identification in high-dimensional spaces: application to molecular profiling data. Signal Process. 2003, 83, 729-743.
36. Pearson, W. R.; Robins, G.; Wrege, D. E.; Zhang, T. On the primer selection problem in polymerase chain reaction experiments. Discrete Appl. Math. 1996, 71, 231-246.
37. Nicodeme, P.; Steyaert, J. M. Selecting optimal oligonucleotide primers for multiplex PCR. In Proceedings of the Annual International Conference on Intelligent Systems for Molecular Biology (ISMB). AAAI Press, Menlo Park, CA, 1997, pp. 210-213.
38. Chang, Y. J.; Sahinidis, N. Dna sequencing by hybridization with errors via integer programming. Technical Report, University of Illinois, Urbana, IL, 2005.
39. Wagner, M.; Meller, J.; Elber, R. Large-scale linear programming techniques for the design of protein folding potentials. Math. Program. 2004, 101, 301-318.
40. Carr, R.; Hart, W.; Newman, A. Discrete optimization models of protein folding. Technical Report, Sandia National Laboratories, Albuquerque, NM, 2002.
41. Carr, R.; Hart, W.; Newman, A. Bounding a protein's free energy in lattice models via linear programming. In Posters of the Annual International Conference on Computational Molecular Biology (RECOMB), 2004.
42. Backofen, R.; Will, S. A constraint-based approach to fast and exact structure prediction in threedimensional protein models. Constraints 2006, 11, 5-30.
43. Xu, J.; Li, M.; Kim, D.; Xu, Y. RAPTOR: Optimal protein threading by linear programming. J. Bioinformatics Comp. Biol. 2003, 1, 95-117.
44. Xu, J.; Li, M. Assessment of RAPTOR's linear programming approach in CAFASP3. Proteins: Structure, Function, and Genetics 2003, 53, 579-584.
45. Xu, J.; Li, M.; Xu, Y. Protein threading by linear programming: Theoretical analysis and computational results. J. Comb. Optimization 2004, 8, 403-418.
46. Andonov, R.; Balev, S.; Yanev, N. Protein threading: From mathematical models to parallel implementations. INFORMS J. Comp. 2004, 16.
47. Veber, P.; Yanev, N.; Andonov, R.; Poirriez, V. Optimal protein threading by cost-splitting. In Proceedings of the Annual Workshop on Algorithms in Bioinformatics (WABI). Springer, 2005, pp. 365-375.
48. Eskow, E.; Bader, B.; Byrd, R.; Crivelli, S.; Head-Gordon, T.; Lamberti, V.; Schnabel, R. An optimization approach to the problem of protein structure prediction. Math. Program. 2004, 101, 497-514.
49. Koh, S. K.; Ananthasuresh, G. K.; Croke, C. Design of reduced protein models by energy minimization using mathematical programming. In 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference, 2004, pp. 1-10.
50. Koh, S. K.; Ananthasuresh, G. K.; Vishveshwara, S. A deterministic optimization approach to protein sequence design using continuous models. Int. J. Robotics Res. 2005, 24, 109-130.
51. Eriksson, O.; Zhou, Y.; Elofsson, A. Side chain-positioning as an integer programming problem. In Proceedings of Annual Workshop on Algorithms in Bioinformatics (WABI); Gascuel, O.; Moret, B. M. E., Eds. Springer, 2001, Vol. 2149, Lecture Notes in Computer Science, pp. 128-141.
52. Kingsford, C.; Chazelle, B.; Singh, M. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics 2005, 21, 1028-1039.
53. Chazelle, B.; Kingsford, C.; Singh, M. A semidefinite programming approach to side chain positioning with new rounding strategies. INFORMS J. Comp. 2004, 16.
54. Althaus, E.; Kohlbacher, O.; Lenhof, H.-P.; Muller, P. A combinatorial approach to protein docking with flexible side-chains. J. Comp. Biol. 2002, 9, 597-612.
55. Floudas, C. A.; Klepeis, J. L.; Pardalos, P. M. Global optimization approaches in protein folding and peptide docking. In Mathematical Support for Molecular Biology; Farach-Colton, M.; Roberts, F.; Vingron, M.; Waterman, M., Eds. AMS Press, 1998, Vol. 47, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 141-172.
56. Floudas, C.; Pardalos, P., Eds. Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches. Kluwer Academic Publishers, Boston, MA, Boston, MA, 2000.
57. Lancia, G.; Carr, R.; Walenz, B.; Istrail, S. 101 optimal PDB structure alignments: A branchand-cut algorithm for the maximum contact map overlap problem. In Proceedings of the Annual International Conference on Computational Biology (RECOMB). ACM Press, New York, NY, 2001, pp. 193-202.
58. Caprara, A.; Lancia, G. Structural alignment of large-size proteins via lagrangian relaxation. In Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB). ACM Press, New York, NY, 2002, pp. 100-108
59. Caprara, A.; Carr, B.; Istrail, S.; Lancia, G.; Walenz, B. 1001 optimal pdb structure alignments: Integer programming methods for finding the maximum contact map overlap. J. Comp. Biol. 2004, 11, 27-52.
60. Carr, R.; Lancia, G. Compact optimization can outperform separation: a case study in structural proteomics. 4OR 2004, 2, 221-233.
61. Barnes, E.; Sokol, J. S.; Strickland, D. M. Optimal protein structure alignment using maximum cliques. Oper. Res. 2005, 53, 389-402.
62. Bauer, M.; Klau, G. W. Structural alignment of two RNA sequences with lagrangian relaxation. In Proceedings of Annual International Symposium on Algorithms and Computation (ISAAC); Fleischer, R.; Trippen, G., Eds. Springer, Berlin, 2004, Vol. 3341, Lecture Notes in Computer Science, pp. 113-123.
63. Bauer, M.; Klau, G. W.; Reinert, K. Multiple structural RNA alignment with lagrangian relaxation. In Proceedings of the Annual Workshop on Algorithms in Bioinformatics (WABI). Springer, 2005.
64. Clark, A. Inference of haplotypes from PCR-amplified samples of diploid populations. Mol. Biol. Evol. 1990, 7, 111-122.
65. Gusfield, D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms. J. Comp. Biol. 2001, 8, 305-324.
66. Gusfield, D. Haplotype inference by pure parsimony. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM). Springer, Berlin, 2003, Vol. 2676, Lecture Notes in Computer Science, pp. 144-155.
67. Brown, D. G.; Harrower, I. M. A new integer programming formulation for the pure parsimony problem in haplotype analysis. In Proceedings of AnnualWorkshop on Algorithms in Bioinformatics (WABI). Springer, 2004, Lecture Notes in Computer Science, pp. 254-265.
68. Lancia, G.; Pinotti, C.; Rizzi, R. Haplotyping populations by pure parsimony: Complexity, exact and approximation algorithms. INFORMS J. Comp. 2004, 16, 17-29.
69. Lancia, G.; Rizzi, R. A polynomial solution to a special case of the parsimony haplotyping problem. Operations Res. Lett. 2006, 34, 289-295.
70. Kalpakis, K.; Namjoshi, P. Haplotype phasing using semidefinite programming. In Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE), 2005, pp. 145-152.
71. Huang, Y.; Chao, K.; Chen, T. An approximation algorithm for haplotype inference by maximum parsimony. In ACM Symposium on Applied Computing (SAC), 2005, pp. 146-150.
72. Brinza, D.; He, J.; Mao, W.; Zelikovsky, A. Family trio phasing and missing data recovery. Int. J. Bioinformatics Res. Appl. 2005, 1, 221-229.
73. Li, J.; Jiang, T. Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming. J. Comp. Biol. 2005, 1.
74. W. Mao, J.He, D. B.; Zelikovsky, A. A combinatorial method for predicting genetic susceptibility to complex diseases. In Proceedings of International Conference of the IEEE Engineering in Medicine and Biology (EMBC), 2005, pp. 224-227.
75. Caprara, A.; Lancia, G.; Ng, S. A column-generation based branch-and-bound algorithm for sorting by reversals. In Mathematical Support for Molecular Biology; Farach-Colton, M.; Roberts, F.; Vingron, M.; Waterman, M., Eds. AMS Press, 1999, Vol. 47, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 213-226.
76. Caprara, A.; Lancia, G.; Ng, S. Sorting permutations by reversals through branch and price. INFORMS J. Comp. 2001, 13, 224-244.
77. Caprara, A. The reversal median problem. INFORMS J. Comp. 2003, 15, 93-113.
78. Tang, J.; Moret, B. Linear programming for phylogenetic reconstruction based on gene rearrangements. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM). Springer-Verlag, Germany, 2005, Lecture Notes in Computer Science.
79. Snir, S.; Rao, S. Using max cut to enhance rooted trees consistency. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2006, 3, 323-333.
80. Moran, S.; Rao, S.; Snir, S. Using semi-definite programming to enhance supertree resovability. In Proceedings of Annual Workshop on Algorithms in Bioinformatics (WABI); Myers, G.; Casadio, R., Eds. Springer, 2005, Lecture Notes in Computer Science.