@inbook{10.2307/j.ctt9qf9j4.6, ISBN = {9780262027526}, URL = {http://www.jstor.org/stable/j.ctt9qf9j4.6}, abstract = {Our main interest is in genealogical and phylogeneticnetworks, which by definition are not trees. However, many of the network models derive from tree models, and many of the tools that address networks rely critically on tools for trees. Further, if we are to understand when and why recombination is needed, we need to understand when and why recombination isnotneeded. Therefore we must first understand some models of treelike evolution and some combinatorial and algorithmic results about evolutionarytrees. The main tree-based model of evolution that we use is called the (rooted, binary character)perfect-phylogenymodel.Definition Let}, author = {Charles H. Langley and Yun S. Song and Yufeng Wu}, bookauthor = {Dan Gusfield}, booktitle = {ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks}, pages = {35--60}, publisher = {MIT Press}, title = {Trees First}, year = {2014} }