Integer programming formulations and computations solving phylogenetic and population genetic problems with missing or genotypic data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4598 LNCS, Issue , 2007, Pages 51-64

  Gusfield, Dan ^a   Frid, Yelena ^a   Brown, Dan ^b  

^a Davis   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; PROBLEM SOLVING;

GENOTYPIC DATA; HAPLOTYPE DATA;

GENE ENCODING;

EID: 37849054103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_8     Document Type: Conference Paper

References (31)

1. Bafna, V., Bansal, V.: Improved recombination lower bounds for haplotype data. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3678, Springer, Heidelberg (2005)
2. Bafna, V., Gusfield, D., Hannenhalli, S., Yooseph, S.: A note on efficient computation of haplotypes via perfect phylogeny. Journal of Computational Biology 11(5), 858-866 (2004)
3. Brown, D., Harrower, I.: A new formulation for haplotype inference by pure parsimony, report cs-2005-03. Technical report, University of Waterloo, School of Computer Science (2005)
4. Brown, D.G., Harrower, I.M.: Integer Programming Approaches to Haplotype Inference by Pure Parsimony. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(2), 141-154 (2006)
5. International HapMap Consortium. A haplotype map of the human genome. Nature, 437 1299-1320 (2005)
6. Ding, Z., Filkov, V., Gusfield, D.: A linear-time algorithm for the perfect phylogeny haplotyping problem. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 585-600. Springer, Heidelberg (2005)
7. Felsenstein, J.: Inferring Phylogenies. Sinauer, Sunderland, MA (2004)
8. Gusfield, D.: Efficient algorithms for inferring evolutionary history. Networks 21, 19-28 (1991)
9. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
10. Gusfield, D.: Haplotyping as Perfect Phylogeny: Conceptual Framework and Efficient Solutions (Extended Abstract). In: Proceedings of RECOMB 2002: The Sixth Annual International Conference on Computational Biology, pp. 166-175 (2002)
11. Gusfield, D.: Haplotype inference by pure parsimony. In: Baeza-Yates, R.A., Chavez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 144-155. Springer, Heidelberg (2003)
12. Gusfield, D., Orzack, S.: Haplotype inference. In: Aluru, S. (ed.) Handbook of Computational Molecular Biology, vol. 18, pp. 1-25. Chapman and Hall/CRC, Boca Raton (2005)
13. Halperin, E., Eskin, E.: Haplotype reconstruction from genotype data using Imperfect Phylogeny. Bioinformatics 20, 1842-1849 (2004)
14. Hein, J., Schierup, M., Wiuf, C.: Gene Genealogies, Variation and Evolution: A primer in coalescent theory. Oxford University Press, Oxford (2005)
15. Hudson, R.: Generating samples under the Wright-Fisher neutral model of genetic variation. Bioinformatics 18(2), 337-338 (2002)
16. Hudson, R., Kaplan, N.: Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics 111, 147-164 (1985)
17. Kimmel, G., Shamir, R.: GERBIL: Genotype resolution and block identification using likelihood. PNAS 102, 158-162 (2005)
18. Lancia, G., Pinotti, C., Rizzi, R.: Haplotyping populations by pure parsimony: Complexity, exact and approximation algorithms. INFORMS J. on Computing, special issue on Computational Biology 16, 348-359 (2004)
19. Lin, S., Cutler, D., Zwick, M., Chakravarti, A.: Haplotype inference in random population samples. Am. J. of Hum. Genet. 71, 1129-1137 (2002)
20. Marchini, J., Donnelly, P., et al.: A comparison of phasing algorithms for trios and unrelated individuals. Am. J. of Human Genetics 78, 437-450 (2006)
21. Pe'er, I., Pupko, T., Shamir, R., Sharan, R.: Incomplete directed perfect phylogeny. SIAM J. on Computing 33, 590-607 (2004)
22. Satya, R.V., Mukherjee, A.: An optimal algorithm for perfect phylogeny haplotyping. In: Proceedings of 4th CSB Bioinformatics Conference, IEEE Computer Society Press, Los Alamitos (2005)
23. Satya, R.V., Mukherjee, A., Alexe, G., Parida, L., Bhanot, G.: Constructing near-perfect phylogenies with multiple homoplasy events. Bioinformatics 22, 514-522 (2006) Bioinformatics Suppl., Proceedings of ISMB 2006
24. Scheet, P., Stephens, M.: A fast and flexible statistical model for large-scale population genotype data: applications to inferring missing genotypes and haplotypic phase. Am. J. Human Genetics 78, 629-644 (2006)
25. Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)
26. Song, Y.S., Wu, Y., Gusfield, D.: Haplotyping with one homoplasy or recombination event. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol. 3692, Springer, Heidelberg (2005)
27. Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. J. of Classification 9, 91-116 (1992)
28. Stephens, M., Smith, N., Donnelly, P.: A new statistical method for haplotype reconstruction from population data. Am. J. Human Genetics 68, 978-989 (2001)
29. Wiuf, C.: Inference of recombination and block structure using unphased data. Genetics 166, 537-545 (2004)
30. Wu, Y.: Personal Communication
31. Wu, Y., Gusfield, D.: Efficient computation of minimum recombination over genotypes (not haplotypes). In: Proceedings of Life Science Society Computational Systems Bioinformatics (CSB) 2006, pp. 145-156 (2006)