A concise necessary and sufficient condition for the existence of a galled-tree
暂无分享,去创建一个
[1] Kaizhong Zhang,et al. Perfect phylogenetic networks with recombination , 2001, J. Comput. Biol..
[2] J. Hein. A heuristic method to reconstruct the history of sequences subject to recombination , 1993, Journal of Molecular Evolution.
[3] Wing-Kin Sung,et al. Constructing a Smallest Refining Galled Phylogenetic Network , 2005, RECOMB.
[4] Dan Gusfield,et al. An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study , 2007, Discret. Appl. Math..
[5] Vineet Bafna,et al. The number of recombination events in a sample history: conflict graph and lower bounds , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[6] Dan Gusfield,et al. The Fine Structure of Galls in Phylogenetic Networks , 2004, INFORMS J. Comput..
[7] J. Hein. Reconstructing evolution of sequences subject to recombination using parsimony. , 1990, Mathematical biosciences.
[8] Geoffrey B. Nilsen,et al. Whole-Genome Patterns of Common DNA Variation in Three Human Populations , 2005, Science.
[9] Tandy J. Warnow,et al. Reconstructing reticulate evolution in species: theory and practice , 2004, RECOMB.
[10] Dan Gusfield,et al. Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination , 2005, J. Comput. Syst. Sci..
[11] Dan Gusfield,et al. Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination , 2004, J. Bioinform. Comput. Biol..
[12] P. Marjoram,et al. Ancestral Inference from Samples of DNA Sequences with Recombination , 1996, J. Comput. Biol..
[13] Yun S. Song,et al. On the minimum number of recombination events in the evolutionary history of DNA sequences , 2004, Journal of mathematical biology.