Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- 1 May 2005
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 70 (3) , 381-398
- https://doi.org/10.1016/j.jcss.2004.12.009
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The number of recombination events in a sample history: conflict graph and lower boundsIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- A Note on Efficient Computation of Haplotypes via Perfect PhylogenyJournal of Computational Biology, 2004
- Phylogenetic networks: modeling, reconstructibility, and accuracyIEEE/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
- Perfect phylogeny and haplotype assignmentPublished by Association for Computing Machinery (ACM) ,2004
- Parsimonious Reconstruction of Sequence Evolution and Haplotype BlocksPublished by Springer Nature ,2003
- Perfect Phylogenetic Networks with RecombinationJournal of Computational Biology, 2001
- A heuristic method to reconstruct the history of sequences subject to recombinationJournal of Molecular Evolution, 1993
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- Reconstructing evolution of sequences subject to recombination using parsimonyMathematical Biosciences, 1990