An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study
Authors:
- 1 April 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (6-7) , 806-830
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Perfect Phylogenetic Networks: A New Methodology for Reconstructing the Evolutionary History of Natural LanguagesLanguage, 2005
- Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolutionBioinformatics, 2005
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombinationJournal of Computer and System Sciences, 2005
- Whole-Genome Patterns of Common DNA Variation in Three Human PopulationsScience, 2005
- The number of recombination events in a sample history: conflict graph and lower boundsIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- On the minimum number of recombination events in the evolutionary history of DNA sequencesJournal of Mathematical Biology, 2004
- Close look at gene conversion hot spotsNature Genetics, 2004
- Perfect Phylogenetic Networks with RecombinationJournal of Computational Biology, 2001
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- Reconstructing evolution of sequences subject to recombination using parsimonyMathematical Biosciences, 1990