Characterization of the existence of galled-tree networks

Journal of Bioinformatics and Computational Biology

Volumn 4, Issue 6, 2006, Pages 1309-1328

  Gupta, Arvind ^a   Maňuch, Ján ^a   Zhao, Xiaohong ^a   Stacho, Ladislav ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; BIOINFORMATICS; GENETIC ALGORITHM; GENETIC RECOMBINATION; GENOMICS; HAPLOTYPE; PHYLOGENETIC TREE; PHYLOGENETIC TREE ROOT;

ALGORITHMS; CHROMOSOME MAPPING; COMPUTER SIMULATION; GENE FREQUENCY; HAPLOTYPES; MODELS, GENETIC; POLYMORPHISM, SINGLE NUCLEOTIDE; QUANTITATIVE TRAIT LOCI;

EID: 33846524472     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720006002478     Document Type: Article

References (14)

1. Day WH, Sankoff D, Computational complexity of inferring phylogenies by compatibility, Syst Zool 35(2):224-229, 1986.
2. Dragan, F, Strongly orderable graphs: A common generalization of strongly chordal and chordal bipartite graphs, Discrete Appl Math 99(1-3):427-442, 2000.
3. Gupta A, Maňuch J, Stacho L, Zhao X, Characterization of the existence of galledtree networks (extended abstract). Advances in Bioinformatics and Computational Biology (Proc 4th Asia-Pacific Bioinform Conf). Imperial College Press, 2006.
4. Gusfield D, Eddhu S, Langley C, Powerpoint slides for: Efficient reconstruction of phylogenetic networks (of SNPs) with constrained recombination, http://wwwcsif.cs.ucdavis.edu/~gusfield/talks.html.
5. Gusfield D, Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination, J Comput Syst Sci 70:381-398, 2005.
6. Gusfield D, Eddhu S, Langley C, The fine structure of galls in phylogenetic networks, INFORMS J Comput 16(4):459-469, 2004.
7. Gusfield D, Eddhu S, Langley C, Optimal, efficient reconstruction of phylogenetic networks with constrained recombination, J Bioinform Comput Biolo 2(1):173-213, 2004.
8. Helmuth L, Genome research: Map of the human genome 3.0., Science, 293(5530):583-585, 2001.
9. HuynhTND, Jansson J, Nguyen NB, Sung W-K, Constructing a smallest refining galled phylogenetic network, Proc. of RECOMB, pp. 265-280, 2005.
10. Nakhleh L, Warnow T, Linder CR, Reconstructing reticulate evolution in species - theory and practice, Proc RECOMB, pp. 337-346, 2004.
11. Posada D, Crandall KA, Intraspecific gene genealogies: Trees grafting into networks, Trends Ecol Evol 16(1):37-45, 2001.
12. Schierup M, Hein J, Consequences of recombination on traditional phylogenetic analysis, Genetics 156:879-891, 2000.
13. Song YS, A concise necessary and sufficient condition for the existence of a galled-tree, IEEE/ACM Trans Comput Biol Bioinform, 3(2):186-191, 2006.
14. Wang L, Zhang K, Zhang L, Perfect phylogenetic networks with recombination, SAC '01: Proc 2001 ACM Symp Appl Comput, pp. 46-50, New York, NY, USA, 2001. ACM Press, ISBN 1-58113-287-5. http://doi.acm.org/ 10.1145/372202.372271.