Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Dan Gusfield, Satish Eddhu, Charles H. Langley. Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. In 2nd IEEE Computer Society Bioinformatics Conference (CSB 2003), 11-14 August 2003, Stanford, CA, USA. pages 363-374, IEEE Computer Society, 2003. [doi]

The following publications are possibly variants of this publication:

Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained RecombinationDan Gusfield, Satish Eddhu, Charles H. Langley. jbcb, 2(1):173-214, 2004. [doi]

Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombinationDan Gusfield. jcss, 70(3):381-398, 2005. [doi]

Invited Talk: Phylogenetic Networks with Constrained and Unconstrained RecombinationDan Gusfield. gcb 2004: 1-2

An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical studyDan Gusfield, Dean Hickerson, Satish Eddhu. DAM, 155(6-7):806-830, 2007. [doi]

runs on WebDSL