Minimum recombination histories by branch and bound

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

Volumn 3692 LNBI, Issue , 2005, Pages 239-250

  Lyngsø, Rune B ^a   Song, Yun S ^b   Hein, Jotun ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SOFTWARE; PROBLEM SOLVING; SET THEORY;

CHALLENGING PROBLEM; EVOLUTIONARY HISTORY; MINIMUM RECOMBINATION; SAMPLED SEQUENCES;

ALGORITHMS;

EID: 30744479464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557067_20     Document Type: Conference Paper

References (15)

1. Song, Y.S., Hein, J.: Parsimonious reconstruction of sequence evolution and haplotype blocks. In: Proceedings of the 3rd Workshop on Algorithms in Bioinformatics (WABI), (2003) 287-302
2. Hudson, R.R., Kaplan, N.L.: Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics 111 (1985) 147-164
3. Myers, S.R., Griffiths, R.C.: Bounds on the minimum number of recombination events in a sample history. Genetics 163 (2003) 375-394
4. Gusfield, D., Hickerson, D.: A new lower bound on the number of needed recombination nodes in both unrooted and rooted phylogenetic networks. Technical Report UCD-ECS-06, University of California, Davis (2004)
5. Song, Y.S., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. Journal of Mathematical Biology 48 (2004) 160-186
6. Bafna, V., Bansal, V.: Improved recombination lower bounds for haplotype data. In: Proceedings of the 9th Annual International Conference on Computational Molecular Biology (RECOMB). (2005)
7. Song, Y.S., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. In: Proceedings of the 13th International Conference on Intelligent Systems for Molecular Biology (ISMB). (2005) in press.
8. Fearnhead, P., Harding, R.M., Schneider, J.A., Myers, S., Donnelly, P.: Application of coalescent methods to reveal fine-scale rate variation and recombination hotspots. Genetics 167 (2004) 2067-2081
9. Griffiths, R.C., Marjoram, P.: An ancestral recombination graph. In: Progress in Population Genetics and Human Evolution. Volume 87 of IMA Volumes in Mathematics and its Applications. Springer Verlag (1997) 257-270
10. Kimura, M.: The number of heterozygous nucleotide sites maintained in a finite population due to steady flux of mutations. Genetics 61 (1969) 893-903
11. Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21 (1991) 19-28
12. Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. Journal of Computational Biology 8 (2001) 69-78
13. Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology 2 (2004) 173-213
14. Kreitman, M.: Nucleotide polymorphism at the alcohol dehydrogenase locus of Drosophila melanogaster. Nature 304 (1983) 412-417
15. Nickerson, D.A., Taylor, S.L., Weiss, K.M., Clark, A.C., Hutchinson, R.G., Stengard, J., Salomaa, V., Vartiainen, E., Boerwinkle, E., Sing, C.F.: DNA sequence diversity in a 9.7-kb region of the human lipoprotein lipase gene. Nature Genetics 19 (1998) 216-7