- Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution, Yun S. Song, Yufeng Wu and Dan Gusfield, Bioinformatics 2005 21(Suppl 1): i413-i422.
- A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem, Zhihong Ding, Vladimir Filkov, Dan Gusfield. Journal of Computational Biology. 2006, 13(2): 522-553.
- Inference about Recombination from Haplotype Data: Lower Bounds and Recombination Hotspots, Vineet Bafna and Vikas Bansal, Journal of Computational Biology. 2006, 13(2): 501-521.
- Perfect phylogeny and haplotype assignment, E. Halperin and R. M. Karp, RECOMB ’04.
- Whole genome association mapping by incompatibilities and local perfect phylogenies, Thomas Mailund, Søren Besenbacher, and Mikkel H Schierup, BMC Bioinformatics 2006, 7:454
References for Interval Paper
Posted in Uncategorized