Search research articles
Contact Us
Filters
Showing results (11-20 of 20) with videos related to
Page
of 2
Sort By:
You have reached the last page of results.
This site can display upto 20 results.
Proceedings. IEEE Computer Society Bioinformatics Conference
|
February 3, 2006
Efficient reconstruction of phylogenetic networks with constrained recombination
Dan Gusfield, Satish Eddhu, Charles Langley
Journal of Bioinformatics and Computational Biology
|
July 24, 2004
Optimal, efficient reconstruction of phylogenetic networks with constrained recombination
Dan Gusfield, Satish Eddhu, Charles Langley
Algorithms for Molecular Biology : AMB
|
September 26, 2012
Constructing perfect phylogenies and proper triangulations for three-state characters
Rob Gysel, Fumei Lam, Dan Gusfield
Bioinformatics (Oxford, England)
|
June 18, 2005
Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution
Yun S Song, Yufeng Wu, Dan Gusfield
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
August 26, 2003
Haplotyping as perfect phylogeny: a direct approach
Vineet Bafna, Dan Gusfield, Giuseppe Lancia, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
February 11, 2005
A note on efficient computation of haplotypes via perfect phylogeny
Vineet Bafna, Dan Gusfield, Sridhar Hannenhalli, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
June 10, 2010
Untangling tanglegrams: comparing trees by their drawings
Balaji Venkatachalam, Jim Apple, Katherine St John, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
December 1, 2007
A decomposition theory for phylogenetic networks and incompatible characters
Dan Gusfield, Vikas Bansal, Vineet Bafna, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
February 18, 2016
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound
Julia Matsieva, Steven Kelk, Celine Scornavacca, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
December 1, 2007
Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of SNP sequences in populations
Yun S Song, Zhihong Ding, Dan Gusfield, et al.
Page
of 2
Search research articles
Search
Showing results (11-20 of 20) with videos related to
Sort By:
Page
of 2
You have reached the last page of results.
This site can display upto 20 results.
Proceedings. IEEE Computer Society Bioinformatics Conference
|
February 3, 2006
Efficient reconstruction of phylogenetic networks with constrained recombination
Dan Gusfield, Satish Eddhu, Charles Langley
Journal of Bioinformatics and Computational Biology
|
July 24, 2004
Optimal, efficient reconstruction of phylogenetic networks with constrained recombination
Dan Gusfield, Satish Eddhu, Charles Langley
Algorithms for Molecular Biology : AMB
|
September 26, 2012
Constructing perfect phylogenies and proper triangulations for three-state characters
Rob Gysel, Fumei Lam, Dan Gusfield
Bioinformatics (Oxford, England)
|
June 18, 2005
Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution
Yun S Song, Yufeng Wu, Dan Gusfield
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
August 26, 2003
Haplotyping as perfect phylogeny: a direct approach
Vineet Bafna, Dan Gusfield, Giuseppe Lancia, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
February 11, 2005
A note on efficient computation of haplotypes via perfect phylogeny
Vineet Bafna, Dan Gusfield, Sridhar Hannenhalli, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
June 10, 2010
Untangling tanglegrams: comparing trees by their drawings
Balaji Venkatachalam, Jim Apple, Katherine St John, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
December 1, 2007
A decomposition theory for phylogenetic networks and incompatible characters
Dan Gusfield, Vikas Bansal, Vineet Bafna, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics
|
February 18, 2016
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound
Julia Matsieva, Steven Kelk, Celine Scornavacca, et al.
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
December 1, 2007
Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of SNP sequences in populations
Yun S Song, Zhihong Ding, Dan Gusfield, et al.
Page
of 2