Constructing the Simplest Possible Phylogenetic Network from Triplets

This publication has 21 references indexed in Scilit:

• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study
  Discrete Applied Mathematics, 2007
• Computing the minimum number of hybridization events for a consistent evolutionary history
  Discrete Applied Mathematics, 2007
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
  Theoretical Computer Science, 2006
• Application of Phylogenetic Networks in Evolutionary Studies
  Molecular Biology and Evolution, 2005
• Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution
  Bioinformatics, 2005
• Computing the maximum agreement of phylogenetic networks
  Theoretical Computer Science, 2005
• Networks in phylogenetic analysis: new tools for population biology
  International Journal for Parasitology, 2005
• Phylogenetic networks: modeling, reconstructibility, and accuracy
  IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
• Perfect Phylogenetic Networks with Recombination
  Journal of Computational Biology, 2001
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
  SIAM Journal on Computing, 1981