A concise necessary and sufficient condition for the existence of a galled-tree

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 3, Issue 2, 2006, Pages 1000-9999

  Song, Yun S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Galled trees; Incompatibility; Quadpartition; Recombination

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; BIOMEDICAL ENGINEERING; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS;

GALLED-TREES; INCOMPATIBILITY; QUADPARTITION; RECOMBINATION;

TREES (MATHEMATICS);

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; GENETIC RECOMBINATION; GENETICS; MEIOSIS; METHODOLOGY; MOLECULAR EVOLUTION; PHYLOGENY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; MEIOSIS; MODELS, GENETIC; PHYLOGENY; RECOMBINATION, GENETIC;

EID: 33646723920     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2006.15     Document Type: Article

References (13)

1. V. Bafna and V. Bansal, "The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds," IEEE/ACM Trans. Computational Biology and Bioinformatics vol. 1, pp. 78-90, 2004.
2. R.C. Griffiths and P. Marjoram, "Ancestral Inference from Samples of DNA Sequences with Recombination," J. Computational Biology, vol. 3, pp. 479-502, 1996.
3. D. Gusfield, "Optimal, Efficient Reconstruction of Root-Unknown Phylogenetic Networks with Constrained Recombination," J. Computational Systems Science, vol. 70, pp. 381-398, 2005.
4. D. Gusfield, S. Eddhu, and C. Langley, "The Fine Structure of Galls in Phylogenetic Networks," INFORMS J. Computing, vol. 16, pp. 459-469, 2004.
5. D. Gusfield, S. Eddhu, and C. Langley, "Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination," J. Bioinformatics and Computational Biology, vol. 2, pp. 173-213, 2004.
6. D. Gusfield, D. Hickerson, and S. Eddhu, "An Efficiently Computed Lower Bound on the Number of Recombinations in Phylogenetic Networks: Theory and Empirical Study," Discrete Applied Math, to appear.
7. J. Hein, "Reconstructing Evolution of Sequences Subject to Recombination Using Parsimony," Math. Bioscience, vol. 98, pp. 185-200, 1990.
8. J. Hein, "A Heuristic Method to Reconstruct the History of Sequences Subject to Recombination," J. Molecular Evolution, vol. 36, pp. 396-405, 1993.
9. D. Hinds, L. Stuve, G. Nilsen, E. Halperin, E. Eskin, D. Gallinger, K. Frazer, and D. Cox, "Whole-Genome Patterns of Common DNA Variation in Three Human Populations," Science, vol. 307, pp. 1072-1079, 2005.
10. T.N.D. Huynh, J. Jansson, N.B. Nguyen, and W.-K. Sung, "Constructing a Smallest Refining Galled Phylogenetic Network," Proc. Research in Computational Molecular Biology Conf., pp. 265-280, 2005.
11. L. Nakhleh, T. Warnow, and C.R. Linder, "Reconstructing Reticulate Evolution in Species - Theory and Practice," Proc. Research in Computational Molecular Biology Conf., pp. 337-346, 2004.
12. Y.S. Song and J. Hein, "On the Minimum Number of Recombination Events in the Evolutionary History of DNA Sequences," J. Math. Biology, vol. 48, pp. 160-186, 2004.
13. L. Wang, K. Zhang, and L. Zhang, "Perfect Phylogenetic Networks with Recombination," J. Computational Biology, vol. 8, pp. 69-78, 2001.