The Fine Structure of Galls in Phylogenetic Networks

References

• Day W. H., Sankoff D. Computational complexity of inferring phylogenies by compatibility. Systematic Zoology (1986) 35:224–229Crossref, Google Scholar
• Dragan F. Strongly orderable graphs: A common generalization of strongly chordal and chordal bipartite graphs. Discrete Appl. Math. (2000) 99:427–442Crossref, Google Scholar
• Felsenstein J.Inferring Phylogenies (2004) (Sinauer, Sunderland, MA) Google Scholar
• Gusfield D. Efficient algorithms for inferring evolutionary history. Networks (1991) 21:19–28Crossref, Google Scholar
• Gusfield D.Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Gusfield D. Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained recombination. (2004) . Technical report, Department of Computer Science, University of California, Davis, CAGoogle Scholar
• Gusfield D., Eddhu S., Langley C. Efficient reconstruction of phylogenetic networks (of SNPs) with constrained recombination. Proc. Second CSB Bioinformatics Conf. (2003) (IEEE Press, Los Alamitos, CA) Google Scholar
• Gusfield D., Eddhu S., Langley C. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinformatics Comput. Biol. (2004) 2:173–213Crossref, Google Scholar
• Hein J. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. (1990) 98:185–200Crossref, Google Scholar
• Hein J. A heuristic method to reconstruct the history of sequences subject to recombination. J. Molecular Evolution (1993) 36:396–405Crossref, Google Scholar
• Kececioglu J. D., Gusfield D. Reconstructing a history of recombinations from a set of sequences. Discrete Appl. Math. (1998) 88:239–260Crossref, Google Scholar
• Myers S. R., Griffiths R. C. Bounds on the minimum number of recombination events in a sample history. Genetics (2003) 163:375–394Crossref, Google Scholar
• Norborg M., Tavare S. Linkage disequilibrium: What history has to tell us. Trends Genetics (2002) 18:83–90Crossref, Google Scholar
• Posada D., Crandall K. Intraspecific gene genealogies: Trees grafting into networks. Trends Ecology Evolution (2001) 16:37–45Crossref, Google Scholar
• Schierup M. H., Hein J. Consequences of recombination on traditional phylogenetic analysis. Genetics (2000) 156:879–891Crossref, Google Scholar
• Semple C., Steel M.Phylogenetics (2003) (Oxford University Press, Oxford, UK) Crossref, Google Scholar
• Song Y., Hein J. Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events. Proc. 2003 Workshop Algorithms Bioinformatics, Lecture Notes in Computer Science (2003) (Springer-Verlag, Berlin, Germany) 287–302No. 2812Crossref, Google Scholar
• Wang L., Zhang K., Zhang L. Perfect phylogenetic networks with recombination. J. Comput. Biol. (2001) 8:69–78Crossref, Google Scholar