<title>Background</title> <p>A phylogenetic tree models the evolutionary history of a set of taxa from their most recent common ancestor. The assumptions of strict divergence and vertical inheritance render trees appropriate for modeling the evolutionary histories of several groups of species or organisms. However, when <italic>reticulate </italic>evolutionary events such as horizontal gene transfer or interspecific recombination occur, the evolutionary history is more appropriately modeled by an evolutionary network.</p> <p>Evidence of reticulate evolution has been shown in various domains in the Tree of Life. Bacteria obtain a large proportion of their genetic diversity through the acquisition of sequences from distantly related organisms, via horizontal gene transfer (HGT) [##REF##10830951##1##]. Furthermore, more evidence of widespread HGT in plants is emerging recently [##REF##12853958##2##, ####REF##15598737##3##, ##REF##15538356##4####15538356##4##]. Interspecific recombination is believed to be ubiquitous among viruses [##REF##12429687##5##,##REF##11847565##6##], and hybrid speciation is a major evolutionary mechanisms in plants, and groups of fish and frogs [##REF##11607681##7##, ####REF##10849068##8##, ##REF##10688138##9##, ##REF##18677414##10####18677414##10##]. All of these processes result in networks, rather than trees, of evolutionary relationships, even though at the gene level evolutionary histories may be treelike, as we now describe.</p> <p>Figure ##FIG##0##1## illustrates the three major events that result in networks of evolutionary relationships among species, namely horizontal gene transfer, interspecific recombination, and hybrid speciation. The tubes depict the evolutionary network of the species, within which two gene trees are shown. In each box, the two possible gene trees <italic>T </italic>and <italic>T</italic>' are shown separately, as well as the network <italic>N </italic>at an abstract level. In an evolutionary scenario involving horizontal transfer, certain sites (specified by a specific substring within the DNA sequence of the species into which the horizontally transferred DNA was inserted) are inherited from another species (the tree <italic>T</italic>' in dashed lines in Figure ##FIG##0##1(a)##), while all others are inherited from the parent (the tree <italic>T </italic>in solid lines in Figure ##FIG##0##1(a)##). Thus, each site evolves down one of the trees contained inside the network.</p> <p>In the case of interspecific recombination, as illustrated in Figure ##FIG##0##1(b)##, some genetic material is exchanged between pairs of species; in this example, species <italic>B </italic>and <italic>C </italic>exchange genetic material. The genes involved in this exchange have an evolutionary history (gene tree <italic>T</italic>') that is different from that of the genes that are vertically transmitted (gene tree <italic>T</italic>).</p> <p>In the case of hybrid speciation, as illustrated in Figure ##FIG##0##1(c)##, the two parents contribute equally to the genetic material of the hybrid: in <italic>diploid </italic>hybridization, each parent contributes a single copy of each of its chromosomes, while in <italic>polyploid </italic>hybridization, each parent contributes all copies of its chromosomes. Thus, each set of "orthologous sites" from all taxa has an evolutionary history that is depicted by one of the trees inside the network.</p> <p>A few software tools for analyzing reticulate evolutionary relationships have been developed recently. The SplitsTree4 tool, which incorporates several algorithms that have been developed by Daniel Huson and his co-workers, is a tool for reconstructing and visualizing splits networks [##REF##16221896##11##]. The tool enables constructing networks from several types of data, including sequence data, distance matrices, and sets of trees. Two major differences exist between SplitsTree4 and PhyloNet. First, SplitsTree4 constructs and analyzes splits networks, which are graphical models of incompatibility in the data, whereas PhyloNet constructs and analyzes evolutionary networks, which are rooted, directed, acyclic graphs, that represent evolutionary relationships. Second, the two tools differ in the utilities they provide, and we view them as complementary. While SplitsTree4 is mainly aimed at reconstructing networks, PhyloNet has several utilities for evaluating networks.</p> <p>Programs such as EEEP [##REF##16472400##12##], HorizStory [##REF##15819979##13##], LatTrans [##UREF##0##14##], and T-REX [##REF##11448889##15##] are aimed at detecting horizontal gene transfer by reconciling a pair of species/gene trees. The PhyloNet software package that we developed contains an extended implementation of the RIATA-HGT algorithm [##UREF##1##16##] with several improved algorithmic techniques for computing multiple solutions and handling non-binary trees [##UREF##2##17##]. The new version of RIATA-HGT significantly outperforms, in terms of speed, EEEP, HorizStory and LatTrans, and performs at least as well in terms of accuracy [##UREF##2##17##,##REF##17572027##18##]. We have recently added a new heuristic for inferring the support of HGT moves from bootstrap values of gene tree edges. Further, we have added the capability of visualizing the networks computed by RIATA-HGT. Besides RIATA-HGT, the PhyloNet software package implements methods for comparing and characterizing evolutionary networks, which include: (1) evolutionary network representation: reading/writing evolutionary networks in a newly devised compact form; (2) evolutionary network characterization: analyzing evolutionary networks in terms of three basic building blocks – trees, clusters, and tripartitions; (3) evolutionary network comparison: comparing two evolutionary networks in terms of topological dissimilarities, as well as fitness to sequence evolution under a maximum parsimony criterion; and (4) evolutionary network reconstruction: reconstructing an evolutionary network from a species tree and a set of gene trees. Furthermore, since various evolutionary network utilities use functionalities from the phylogenetic trees domain, PhyloNet provides a set of standalone phylogenetic tree analysis tools.</p>
<title>Results and discussion</title> <title>The evolutionary network model</title> <p>In this paper, we assume the "evolutionary network" model, which was formulated independently by Moret <italic>et al</italic>. [##REF##17048405##19##] and Baroni <italic>et al</italic>. [##UREF##3##20##]. We now describe the model as well as some basic definitions and notations that we will use later.</p> <p>Let <italic>T </italic>= (<italic>V</italic>, <italic>E</italic>) be a tree, where <italic>V </italic>and <italic>E </italic>are the <italic>tree nodes </italic>and <italic>tree edges</italic>, respectively, and let <italic>L</italic>(<italic>T</italic>) denote the tree's leaf set. Further, let <italic>χ </italic>be a set of taxa (organisms). Then, <italic>T </italic>is a <italic>phylogenetic tree </italic>over <italic>χ </italic>if there is a bijection between <italic>χ </italic>and <italic>L</italic>(<italic>T</italic>). Henceforth, we will identify the taxa set with the leaves they are mapped to, and let [<italic>n</italic>] = {1,..., <italic>n</italic>} denote the set of leaf-labels. A tree <italic>T </italic>is said to be <italic>rooted </italic>if the set of edges <italic>E </italic>is directed and there is a single node <italic>r </italic>∈ <italic>V </italic>with in-degree 0. Let <italic>T </italic>be a phylogenetic tree on set <italic>χ </italic>of taxa, and let <italic>χ</italic>' ⊆ <italic>χ </italic>be a subset of taxa; then, we denote by <italic>T</italic>|<italic>χ</italic>' the subtree with minimum number of nodes and edges that spans the leaves in <italic>χ</italic>' (in other words, <italic>T</italic>|<italic>χ</italic>' is the tree <italic>T </italic>restricted to subset <italic>χ</italic>' of its leaves).</p> <p>An evolutionary (phylogenetic) network <italic>N </italic>= (<italic>V</italic>, <italic>E</italic>) over the set <italic>χ </italic>of taxa is a rooted, directed, acyclic graph such that there is a bijection between <italic>χ </italic>and the set <italic>L</italic>(<italic>N</italic>) of the network's leaves (see Figure ##FIG##1##2##). The set <italic>V </italic>is partitioned into two sets: <italic>V</italic><sub><italic>T</italic></sub>, the set of <italic>tree nodes</italic>, which are the nodes with in-degree smaller than two, and <italic>V</italic><sub><italic>N</italic></sub>, the set of <italic>network nodes</italic>, which are the nodes with in-degree greater than or equal to two. Similarly, the set <italic>E </italic>is partitioned into two sets: <italic>E</italic><sub><italic>T</italic></sub>, the set of <italic>tree edges</italic>, which are edges incident into tree nodes, and <italic>E</italic><sub><italic>N</italic></sub>, the set of <italic>network edges</italic>, which are the edges incident into network nodes.</p> <p>For two nodes <italic>u </italic>and <italic>v </italic>in directed graph <italic>G</italic>, we say that <italic>v </italic>is reachable from <italic>u</italic>, denoted by  if there exists a directed path from <italic>u </italic>to <italic>v </italic>in the tree <italic>G</italic>. For three nodes <italic>u</italic>, <italic>v </italic>and <italic>x </italic>in directed graph <italic>G</italic>, we write  if all directed paths from <italic>u </italic>to <italic>v </italic>go through node <italic>x</italic>;  if no directed paths from <italic>u </italic>to <italic>v </italic>go through node <italic>x</italic>; and  if at least one directed path from <italic>u </italic>to <italic>v </italic>goes through node <italic>x </italic>and at least one directed path from <italic>u </italic>to <italic>v </italic>does not go through node <italic>x</italic>. For example, in network <italic>N</italic><sub>1 </sub>in Figure ##FIG##1##2##, rooted at node r<sub>1</sub>, we have , , and .</p> <title>Evolutionary network representation</title> <p>The Newick format for representing and storing phylogenetic trees was adopted in 1986 [##REF##3024605##21##], and it has been the standard for almost all phylogeny software packages ever since. This format captures an elegant correspondence between leaf-labeled trees and matched parentheses, where the leaves are represented by their names and the internal nodes by a matched pair of parentheses that contains a list of the Newick representation of all its children. Shown in Figure ##FIG##2##3## are three trees along with their representations in the Newick format.</p> <p>Existing phylogenetic network software tools store these networks as adjacency lists of their underlying graphs, which are usually very large and necessitate translation of representations among the different tools. Morin and Moret [##REF##16717070##22##] proposed a modified version of the Newick format for representing such networks. In their format, network nodes are represented by nodes labeled with #H, and those nodes are considered as two separate nodes in the normal Newick format for trees. See Figure ##FIG##3##4## for an example. We have independently proposed a new method of <italic>tree decomposition </italic>of evolutionary networks, which provides the basis for a new format, <italic>extended Newick </italic>(or eNewick for short), and used it as a compact representation of evolutionary networks. The idea in our method is to break the network into a set of trees, and then represent the network as a collection of Newick representations of those trees. Since the eNewick format is nothing but a collection of trees in the Newick format, it follows that eNewick can represent unrooted networks. However, both in this paper as well as in the PhyloNet utilities, rooting is assumed, since different ways of rooting the same evolutionary networks may imply different evolutionary relationships.</p> <p>Let <italic>N </italic>= (<italic>V </italic>= (<italic>V</italic><sub><italic>N </italic></sub>∪ <italic>V</italic><sub><italic>T</italic></sub>); <italic>E</italic>) be an evolutionary network, with |<italic>V</italic><sub><italic>N</italic></sub>| = ℓ. We create a forest of ℓ trees as follows.</p> <p>• For every <italic>u</italic><sub><italic>i </italic></sub>∈ <italic>V</italic><sub><italic>N</italic></sub></p> <p>- Compute the set <italic>V</italic><sub><italic>i </italic></sub>= {<italic>v </italic>∈ <italic>V </italic>: (<italic>v</italic>, <italic>u</italic><sub><italic>i</italic></sub>) ∈ <italic>E</italic>} of <italic>u</italic><sub><italic>i</italic></sub>'s parents;</p> <p>- Create <italic>k </italic>new leaves, all labeled with <italic>x</italic><sub><italic>i </italic></sub>({<italic>x</italic><sub><italic>i</italic></sub>} ∩ <italic>L</italic>(<italic>N</italic>) = ∅);</p> <p>- Delete from <italic>V </italic>the set of all edges in <italic>V</italic><sub><italic>i </italic></sub>× {<italic>u</italic><sub><italic>i</italic></sub>};</p> <p>- Add to <italic>V </italic>the set of edges <italic>V</italic><sub><italic>i </italic></sub>× {<italic>x</italic><sub><italic>i</italic></sub>};</p> <p>- Assign <italic>x</italic><sub><italic>i </italic></sub>as the name of the tree rooted at node <italic>u</italic><sub><italic>i</italic></sub>;</p> <p>The result is a forest of trees  = {<italic>t</italic><sub>1</sub>,..., <italic>t</italic><sub>ℓ</sub>} such that (1) |<italic>L</italic>(<italic>t</italic><sub><italic>i</italic></sub>)| ≥ 1 for every 1 ≤ <italic>i </italic>≤ ℓ, (2)  and (3) <italic>L</italic>(<italic>t</italic><sub><italic>i</italic></sub>) ∩ <italic>L</italic>(<italic>t</italic><sub><italic>j</italic></sub>) = ∅ for every 1 ≤ <italic>i</italic>, <italic>j </italic>≤ ℓ and <italic>i </italic>≠ <italic>j</italic>. We call  the <italic>tree decomposition </italic>of <italic>N</italic>. Then, the eNewick representation of <italic>N </italic>is the ℓ-tuple ⟨<italic>n</italic>(<italic>t</italic><sub>1</sub>);...; <italic>n</italic>(<italic>t</italic><sub>ℓ</sub>)⟩, where <italic>n</italic>(<italic>t</italic><sub><italic>i</italic></sub>) is the Newick representation of tree <italic>t</italic><sub><italic>i</italic></sub>. Figure ##FIG##2##3## shows the tree decomposition and eNewick representation of the network <italic>N</italic><sub>1 </sub>in Figure ##FIG##1##2##.</p> <p>In the case of modeling networks with horizontal gene transfer events, it is often very helpful to the biologist to know what the species tree is and what the additional set of HGT events are. Such information is "lost" in an eNewick representation, unless the representation is extended further to keep a record of the "species tree parent" of each network node. Therefore, in this case (which is the output of RIATA-HGT) we opt for the format of a species tree <italic>T</italic>, in Newick format, followed by a list of the HGT edges, each written as <italic>X </italic>→ <italic>Y</italic>, where <italic>X </italic>and <italic>Y </italic>are two nodes in <italic>T</italic>.</p> <title>Evolutionary network characterization</title> <p>As we described in the background section, an evolutionary network induces, or contains, a set of trees. We now formalize this concept and characterize networks in terms of the trees they induce. A tree <italic>T </italic>is induced by a network <italic>N </italic>if <italic>T </italic>is obtained from <italic>N </italic>as follows: (1) for each node of in-degree larger than one, remove all but one of the network edges incident into it, and (2) for every node of in-degree and out-degree 1, and whose parent is <italic>u </italic>and child is <italic>v</italic>, remove the two edges incident with it, and add an edge from <italic>u </italic>to <italic>v</italic>. We denote by (<italic>N</italic>) the set of all trees induced by <italic>N</italic>. Figure ##FIG##4##5## shows the sets (<italic>N</italic><sub>1</sub>) and (<italic>N</italic><sub>2</sub>) for the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2##. It is important to note that this set of trees is completely different from the set of trees obtained by the tree decomposition we introduced to facilitate the eNewick format. An evolutionary network <italic>N </italic>with <italic>V</italic><sub><italic>N </italic></sub>= {<italic>v</italic><sub>1</sub>,..., <italic>v</italic><sub>ℓ</sub>}, such that <italic>indegree</italic>(<italic>v</italic><sub><italic>i</italic></sub>) = <italic>ρ</italic><sub><italic>i</italic></sub>, induces <italic>m </italic>trees, where </p> <p>Given an evolutionary network <italic>N</italic>, the set (<italic>N</italic>) is unique. Further, this set informs about the possible gene histories that the network reconciles.</p> <p>In addition to characterizing evolutionary networks by the set of trees they induce, we consider a <italic>cluster</italic>-based characterization. This view of evolutionary networks is very important for understanding the relationships among the "evolutionary perspective" of evolutionary networks and the "cluster, or splits, perspective", which is adopted in various methods [##REF##9520503##23##,##UREF##4##24##]. Let <italic>T </italic>= (<italic>V</italic>, <italic>E</italic>) be a phylogenetic tree on set <italic>χ </italic>of taxa and rooted at node <italic>r</italic>. Each edge <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>) ∈ <italic>E </italic>induces a <italic>cluster </italic>of taxa, denoted <italic>c</italic><sub><italic>e</italic></sub>, which is the set . The (nontrivial) clusters of tree <italic>T </italic>is the set (<italic>T</italic>) = {<italic>c</italic><sub><italic>e </italic></sub>: <italic>e </italic>is an internal edge in <italic>E</italic>}. The topology of a tree is a compact graphical representation of its clusters, where the root of the clade that corresponds to cluster <italic>c</italic><sub><italic>e</italic>' </sub>lies on the path from the root of the tree to the root of the clade that corresponds to cluster <italic>c</italic><sub><italic>e </italic></sub>if and only if <italic>c</italic><sub><italic>e </italic></sub>⊆ <italic>c</italic><sub><italic>e</italic>'</sub>. Hence, clusters play an important role in phylogenetic tree characterization and reconstruction. A straightforward way to extend this concept to evolutionary networks is to define the set of clusters of evolutionary network <italic>N </italic>as . The clusters of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##0##1##.</p> <p>In this form of cluster-based characterization, clusters are unweighted; equivalently, all clusters are weighted equally. One option of weighting the clusters is by considering the fraction of trees in which it appears. In other words, the weight of a cluster <italic>c</italic><sub><italic>e </italic></sub>can be computed as</p> <p></p> <p>This weighting scheme informs not only about the clusters of taxa that the network represents, but also how many gene trees in the input share each cluster. It is important to note here that this weighting of a cluster should not be confused with, or used in lieu of, support values of clusters, since a cluster may appear in only one gene tree and have a high support (e.g., by having a high bootstrap value on the edge that defines it) whereas a poorly supported cluster may appear in several trees.</p> <p>Nakhleh and colleagues have recently introduced a new characterization of evolutionary networks based on the <italic>tripartitions </italic>of their edges [##REF##17048405##19##]. Let <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>) be an edge in an evolutionary network on set <italic>χ </italic>of taxa and rooted at node <italic>r</italic>. We define three disjoint sets <italic>A</italic><sub><italic>e </italic></sub>= , <italic>B</italic><sub><italic>e </italic></sub>= , and <italic>C</italic><sub><italic>e </italic></sub>= . Then, the tripartition induced by edge <italic>e</italic>, denoted <italic>θ</italic><sub><italic>e</italic></sub>, is the triplet ⟨<italic>A</italic><sub><italic>e</italic></sub>; <italic>B</italic><sub><italic>e</italic></sub>; <italic>C</italic><sub><italic>e</italic></sub>⟩. Roughly speaking, the tripartition induced by an edge is the three sets of taxa reachable from the root only through that edge (<italic>A</italic><sub><italic>e</italic></sub>), reachable through that edge but not exclusively (<italic>B</italic><sub><italic>e</italic></sub>), and not reachable through that edge (<italic>C</italic><sub><italic>e</italic></sub>). The set of (nontrivial) tripartitions induced by a evolutionary network <italic>N</italic>, denoted by <italic>θ</italic>(<italic>N</italic>), is {<italic>θ</italic><sub><italic>e </italic></sub>: <italic>e </italic>is an internal edge in <italic>E</italic>}. The tripartitions of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##1##2##.</p> <p>Tripartition-based characterization of an evolutionary network helps to identify clades across which no genetic transfer occurred. If <italic>A</italic><sub><italic>e </italic></sub>= <italic>X </italic>and <italic>B</italic><sub><italic>e </italic></sub>= ∅ for an edge <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>), this implies that the clade rooted at node <italic>v </italic>has set <italic>X </italic>of leaves, and there does not exist any exchange or transfer of genetic material between any organism in <italic>X </italic>and another organism that is not in <italic>X</italic>. Equivalently, an evolutionary network can be partitioned into a collection {<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>,..., <italic>N</italic><sub><italic>k</italic></sub>} of evolutionary networks that result from <italic>N </italic>by deleting every edge <italic>e </italic>for which <italic>B</italic><sub><italic>e </italic></sub>= ∅. Such a partition informs about the "locality" of reticulation events: each event in <italic>N </italic>is local to one of the <italic>k </italic>components in {<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>,..., <italic>N</italic><sub><italic>k</italic></sub>}. Further, this partition implies that each of the trees in (<italic>N</italic>) has <italic>k </italic>clades that have the sets {<italic>L</italic>(<italic>N</italic><sub>1</sub>), <italic>L</italic>(<italic>N</italic><sub>2</sub>),..., <italic>L</italic>(<italic>N</italic><sub><italic>k</italic></sub>)} of leaves.</p> <title>Evolutionary network comparison</title> <p>Researchers are often interested in quantifying the similarities and differences between two phylogenies reconstructed either from two different sources of data or from two different reconstruction methods. Such a quantification provides insights into agreements and disagreements among analyses, confidence values for different parts of the phylogenies, and metrics for comparing the performance of phylogenetic reconstruction methods. In the context of phylogenetic trees, this quantification is most commonly done based on one of two criteria:</p> <p>• <italic>Topological differences</italic>. The topologies, or shapes, of two phylogenetic trees are compared, and their differences are quantified. Several measures have been introduced to quantify topological differences and similarities between a pair of trees, such as the Robinson-Foulds measure and the SPR distance; see [##UREF##5##25##,##UREF##6##26##] for a description of several such measures.</p> <p>• <italic>Fitness to sequence evolution</italic>. When two phylogenies are reconstructed from the same sequence data set, it is common to compare them in terms of how well they model the evolution of the sequences. The most commonly used criteria for measuring such fitness are maximum parsimony, maximum likelihood, and the Bayesian posterior probability; see [##UREF##5##25##] for a detailed discussion of all three criteria.</p> <p>In this section, we report on the capabilities in PhyloNet for comparing two evolutionary networks in terms of their topological differences and similarities, as well as in terms of their fitness to sequence evolution based on the maximum parsimony criterion.</p> <p>For quantifying the dissimilarity between two evolutionary network topologies <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2</sub>, we want a measure <italic>m</italic>(·,·) that satisfies three conditions:</p> <p><italic>Identity</italic>: <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = 0 if and only if <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>are <italic>equivalent</italic>;</p> <p><italic>Symmetry</italic>: <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = <italic>m</italic>(<italic>N</italic><sub>2</sub>, <italic>N</italic><sub>1</sub>); and</p> <p><italic>Triangle inequality</italic>: <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>3</sub>) + <italic>m</italic>(<italic>N</italic><sub>3</sub>, <italic>N</italic><sub>2</sub>) ≥ <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) for any evolutionary network <italic>N</italic><sub>3</sub>.</p> <p>This issue of evolutionary network equivalence was discussed in [##REF##17048405##19##]. The three characterizations of evolutionary networks that we described above induce three measures which we now define. Let <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>be two evolutionary networks on the same set <italic>X </italic>of leaves; we define the three measures as follows.</p> <title>Tree-based comparison</title> <p>Let (<italic>N</italic><sub>1</sub>) and (<italic>N</italic><sub>2</sub>) be the two sets of all trees induced by the two networks, and let <italic>d</italic>(·,·) be a distance metric on trees (see [##UREF##6##26##] for examples of such metrics). The idea is to compare the two networks based on how similar their corresponding sets of trees are. We formalize this as follows. Construct a weighted complete bipartite graph <italic>G</italic>(<italic>U</italic><sub>1</sub>, <italic>U</italic><sub>2</sub>, <italic>E</italic>), where |<italic>U</italic><sub><italic>i</italic></sub>| = |(<italic>N</italic><sub><italic>i</italic></sub>)|, and there are two bijections <italic>f</italic><sub><italic>i </italic></sub>: <italic>U</italic><sub><italic>i </italic></sub>→ (<italic>N</italic><sub><italic>i</italic></sub>) for <italic>i </italic>= 1, 2. The weight of an edge <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>) ∈ <italic>E </italic>for <italic>u </italic>∈ <italic>U</italic><sub>1 </sub>and <italic>v </italic>∈ <italic>U</italic><sub>2</sub>, <italic>w</italic>(<italic>e</italic>) = <italic>d</italic>(<italic>f</italic><sub>1</sub>(<italic>u</italic>), <italic>f</italic><sub>2</sub>(<italic>v</italic>)). Then, the tree-based measure <italic>m</italic><sup><italic>tree</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) is defined as the weight of a minimum-weight edge cover of <italic>G </italic>divided by, the number of the edges in the cover. In its current implementation, PhyloNet uses the Robinson-Foulds distance measure [##UREF##7##27##] for <italic>d</italic>. The tree-based measure was first introduced by Nakhleh <italic>et al</italic>. [##UREF##8##28##]. An illustration of tree-based comparison of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## is given in Figure ##FIG##5##6##. Shown on the left of Figure ##FIG##5##6## is the bipartite graph <italic>G </italic>built from the sets (<italic>N</italic><sub>1</sub>) and (<italic>N</italic><sub>2</sub>) of trees induced by the two networks; these two sets are shown in Figure ##FIG##4##5##. The weight of each edge connecting two nodes in <italic>G </italic>is the RF distance between the two trees corresponding to these two nodes. These weights can be normalized by the number of internal edges in the trees. Since each of the eight trees has six internal edges, the weight of each edge in <italic>G </italic>can be divided by six to normalize it.</p> <p>Shown on the right of Figure ##FIG##5##6## is the minimum-weight edge cover of <italic>G</italic>, which is the set of edges that satisfies two conditions: (1) each node in <italic>G </italic>must be the endpoint of at least one edge in the set, and (2) the sum of the weights of the edges in the set is minimum among all sets of edges satisfying condition 1. In this case, the four edges shown are a cover, since each node in <italic>G </italic>is "covered" by at least one edge (here, each node is covered by exactly one edge). Further, it is of minimum weight, which equals 2, since a simple inspection yields that every other cover has a weight larger than 2. Since the cover has four edges in it, we have <italic>m</italic><sup><italic>tree</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = (0 + 0 + 1/6 + 1/6)/4 = 1/12. If we use the raw RF values, then <italic>m</italic><sup><italic>tree</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = (0 + 0 + 1 + 1)/4 = 1/2.</p> <title>Cluster-based comparison</title> <p>Let <italic>C</italic><sub>1 </sub>= (<italic>N</italic><sub>1</sub>) and <italic>C</italic><sub>2 </sub>= (<italic>N</italic><sub>2</sub>) be the two sets of all clusters induced by the two networks. We define the measure based on these two sets to be</p> <p></p> <p>The rationale behind this measure is that it is the sum of the ratios of clusters present in one but not both networks. The cluster-based measure was first introduced by Nakhleh <italic>et al</italic>. [##UREF##9##29##]. The sets <italic>C</italic><sub>1 </sub>= (<italic>N</italic><sub>1</sub>) and <italic>C</italic><sub>2 </sub>= (<italic>N</italic><sub>2</sub>) of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##0##1##, with |<italic>C</italic><sub>1</sub>| = |<italic>C</italic><sub>2</sub>| = 14. Since |<italic>C</italic><sub>1 </sub>- <italic>C</italic><sub>2</sub>| = |<italic>C</italic><sub>2 </sub>- <italic>C</italic><sub>1</sub>| = 2 (the two highlighted clusters in Table ##TAB##0##1##), we have <italic>m</italic><sup><italic>cluster</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = 1/7. A similar weighting scheme to that described in the previous section can be used to incorporate the fraction of trees in which a cluster appears into the measure calculation.</p> <title>Tripartition-based comparison</title> <p>Let <italic>θ</italic><sub>1 </sub>= <italic>θ</italic>(<italic>N</italic><sub>1</sub>) and <italic>θ</italic><sub>2 </sub>= <italic>θ</italic>(<italic>N</italic><sub>2</sub>) be the two sets of all tripartitions induced by the two networks. We define the measure based on these two sets to be</p> <p></p> <p>This measure views the two networks in terms of the sets of edges they define (where an edge is in a 1-1 correspondence with a tripartition) and computes the sum of the ratios of edges present in one but not both networks. The tripartition-based measure was devised by Moret <italic>et al</italic>. [##REF##17048405##19##]. The sets <italic>θ</italic><sub>1 </sub>= <italic>θ</italic>(<italic>N</italic><sub>1</sub>) and <italic>θ</italic><sub>2 </sub>= <italic>θ</italic>(<italic>N</italic><sub>2</sub>) of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##1##2##, with |<italic>θ</italic><sub>1</sub>| = |<italic>θ</italic><sub>2</sub>| = 12. Since |<italic>θ</italic><sub>1 </sub>- <italic>θ</italic><sub>2</sub>| = |<italic>θ</italic><sub>2 </sub>- <italic>θ</italic><sub>1</sub>| = 1 (the highlighted tripartition in Table ##TAB##1##2##), we have <italic>m</italic><sup><italic>tripartition</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = 1/12.</p> <title>Which measure to use?</title> <p>Several distance measures, such as the Robinson-Fould measure and the Subtree Prune and Regraft (SPR) distance, have been introduced over the years to quantify the difference between the topologies of a pair of phylogenetic trees; e.g., see [##UREF##5##25##,##UREF##6##26##] for description of many of these measures. Even though these measures may compute different distance values on the same pair of trees, there has been no consensus as to which measure should be used in general [##UREF##10##30##]. It may be the case that the Robinson-Foulds measure is more commonly used than the others, but this may be a mere reflection of its very low time requirements as compared to the other, more compute-intensive, measures.</p> <p>Regarding the three measures for comparing networks, a scenario analogous to that in phylogenetic trees arises here: each measure gives a different quantification of the dissimilarity between two networks based on one of the three ways to characterize a given network. As shown in the examples above, some or all of these measures may compute the same value for a given pair of networks, but that may not always be the case. Tree-based comparison of networks can be viewed as a method to quantify how similar, or dissimilar, two networks are in terms of their quality as a summary of a collection of trees. In some cases, even though two networks "look different," they may be identical in terms of the trees they induce – this is the issue of indistinguishability of networks from a collection of trees that Nakhleh and colleagues discussed in [##REF##17048405##19##]. In such a case, using the tree-based comparison, or equivalently the cluster-based comparison, is most appropriate. However, if the similarity/dissimilarity of two networks means something close to an <italic>isomorphism</italic>, then the tripartition-based measure is more appropriate. However, it is important to note that none of the three measures described here is a metric on the general space of all evolutionary networks labeled by a given set of taxa.</p> <p>A practical distinction among the three measures can be derived based on the methods used to infer the evolutionary history of the set of species under study. Methods such as SplitsTree [##REF##9520503##23##] and NeighborNet [##UREF##4##24##] represent the evolutionary history as a set of splits, or clusters, hence making it more natural to use cluster-based comparison to study their performance. Methods such as RIATA-HGT [##UREF##1##16##] and LatTrans [##UREF##0##14##] compute evolutionary networks that are rooted, directed, acylic graphs, where internal nodes have an evolutionary implication in terms of ancestry. For these two methods, all three measures are appropriate. When the evolutionary history of a set of species is represented as a collection of its constituent gene trees, the tree-based measure is most appropriate.</p> <p>Finally, a clear distinction can be made among the methods in terms of computational requirements. In their current implementations, the tripartition-based measure is very fast in practice, taking time that is polynomial in the size of the two networks. On the other hand, the tree- and cluster-based measures are much slower, taking time that is exponential in the number of network nodes in the two networks (since these measures compute explicitly all trees inside each of the two networks). In light of recent complexity results that we obtained [##UREF##11##31##], it is very likely that no polynomial-time algorithms exist for computing the tree- and cluster-based measures in general.</p> <title>Parsimony of evolutionary networks</title> <p>Nakhleh and colleagues have recently formalized a maximum parsimony (MP) criterion for evolutionary networks [##REF##16447967##32##] and demonstrated its utility in reconstructing evolutionary networks on both biological and synthetic data sets [##REF##17068107##33##]. In this section, we describe a PhyloNet utility that allows for comparing two evolutionary networks in terms of their fitness to the evolution of a sequence data set, based on the MP criterion. We first begin with a brief review of the MP criterion, based on the exposition in [##REF##16447967##32##].</p> <p>The relationship between an evolutionary network and its constituent trees, as described in the background section, is the basis for the MP extension to evolutionary networks.</p> <p><bold>Definition 1 </bold><italic>The Hamming distance between two equal-length sequences x and y, denoted by H</italic>(<italic>x</italic>, <italic>y</italic>)<italic>, is the number of positions j such that x</italic><sub><italic>j </italic></sub>≠ <italic>y</italic><sub><italic>j</italic></sub>.</p> <p>Given a fully-labeled tree <italic>T</italic>, i.e., a tree in which each node <italic>v </italic>is labeled by a sequence <italic>s</italic><sub><italic>v </italic></sub>over some alphabet Σ, we define the Hamming distance of an edge <italic>e </italic>∈ <italic>E</italic>(<italic>T</italic>), denoted by <italic>H</italic>(<italic>e</italic>), to be <italic>H</italic>(<italic>s</italic><sub><italic>u</italic></sub>, <italic>s</italic><sub><italic>v</italic></sub>), where <italic>u </italic>and <italic>v </italic>are the two endpoints of <italic>e</italic>. We now define the parsimony score of a tree <italic>T</italic>.</p> <p><bold>Definition 2 </bold><italic>The parsimony score of a fully-labeled tree T, is Σ</italic><sub><italic>e </italic>∈ <italic>E</italic>(<italic>T</italic>) </sub><italic>H</italic>(<italic>e</italic>)<italic>. Given a set S of sequences, a maximum parsimony tree for S is a tree leaf-labeled by S and assigned labels for the internal nodes, of minimum parsimony score</italic>.</p> <p>The parsimony definitions can be extended in a straightforward manner to incorporate different site substitution matrices, where different substitutions do not necessarily contribute equally to the parsimony score, by simply modifying the formula <italic>H</italic>(<italic>x</italic>, <italic>y</italic>) to reflect the weights. Let Σ be the set of states that the two sequences <italic>x </italic>and <italic>y </italic>can take (e.g., Σ = {<italic>A</italic>, <italic>C</italic>, <italic>T</italic>, <italic>G</italic>} for DNA sequences), and <italic>W </italic>the site substitution matrix such that <italic>W</italic>[<italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2</sub>] is the weight of replacing <italic>σ</italic><sub>1 </sub>by <italic>σ</italic><sub>2</sub>, for every <italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2 </sub>∈ Σ. In particular, the <italic>identity </italic>site substitution matrix satisfies <italic>W</italic>[<italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2</sub>] = 0 when <italic>σ</italic><sub>1 </sub>= <italic>σ</italic><sub>2</sub>, and <italic>W</italic>[<italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2</sub>] = 1 otherwise. The weighted Hamming distance between two sequence is <italic>H</italic>(<italic>x</italic>, <italic>y</italic>) = Σ<sub>1 ≤ <italic>i </italic>≤ <italic>k </italic></sub><italic>W</italic>(<italic>x</italic><sub><italic>i</italic></sub>, <italic>y</italic><sub><italic>i</italic></sub>), where <italic>k </italic>is the length of the sequences <italic>x </italic>and <italic>y</italic>. The rest of the definitions are identical to the simple Hamming distance case. As described above, the evolutionary history of a single (non-recombining) gene is modeled by one of the trees contained inside the evolutionary network of the species containing that gene. Therefore the evolutionary history of a site <italic>s </italic>is also modeled by a tree contained inside the evolutionary network. A natural way to extend the tree-based parsimony score to fit a dataset that evolved on a network is to define the parsimony score for each site as the minimum parsimony score of that site over all trees contained inside the network.</p> <p><bold>Definition 3 </bold><italic>(</italic>[##REF##16447967##32##]<italic>) The parsimony score of a network N leaf-labeled by a set S of taxa, is</italic></p> <p></p> <p><italic>where TCost</italic>(<italic>T</italic>, <italic>s</italic><sub><italic>i</italic></sub>) <italic>is the parsimony score of site s</italic><sub><italic>i </italic></sub><italic>on tree T</italic>.</p> <p>Notice that as usually large segments of DNA, rather than single sites, evolve together, Definition 3 can be extended easily to reflect this fact, by partitioning the sequences <italic>S </italic>into non-overlapping blocks <italic>b</italic><sub><italic>i </italic></sub>of sites, rather than sites <italic>s</italic><sub><italic>i</italic></sub>, and replacing <italic>s</italic><sub><italic>i </italic></sub>by <italic>b</italic><sub><italic>i </italic></sub>in Definition 3. This extension may be very significant if, for example, the evolutionary history of a gene includes some recombination events, and hence that evolutionary history is not a single tree. In this case, the recombination breakpoint can be detected by experimenting with different block sizes.</p> <p>The MP utility in PhyloNet allows the user to specify two evolutionary networks (either or both of which can be a tree) <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>and a sequence data set <italic>S</italic>, and computes the parsimony scores <italic>NCost</italic>(<italic>N</italic><sub>1</sub>, <italic>S</italic>) and <italic>NCost</italic>(<italic>N</italic><sub>2</sub>, <italic>S</italic>). The user can then compare the two scores and evaluate the fitness of the networks to the data set <italic>S </italic>based on the difference in the scores. Further, the utility allows the user, for example, to evaluate the significance of each network edge in a network <italic>N </italic>by comparing the parsimony scores of two different versions of <italic>N </italic>that contain different subsets of the network edges in <italic>N</italic>.</p> <title>Reconstructing evolutionary networks from species/gene trees</title> <p>Assuming incongruence among gene and species trees is the result of HGT events only, the <italic>Phylogeny-based HGT Reconstruction Problem</italic>, or HGT Reconstruction Problem for short, is defined as follows:</p> <p><bold>Problem 1 </bold><italic>(HGT Reconstruction Problem)</italic></p> <p><bold>Input: </bold><italic>A species tree ST and a set </italic> = {<italic>T</italic><sub>1</sub>,..., <italic>T</italic><sub><italic>p</italic></sub>}<italic>of gene trees</italic>.</p> <p><bold>Output: </bold><italic>An evolutionary network N, obtained by adding a minimal set of edges Ξ to T, such that N contains every tree T</italic><sub><italic>i </italic></sub>∈ </p> <p>The minimization criterion is a reflection of Occam's razor: in the absence of any additional biological knowledge, HGT events should be used sparingly to explain data features otherwise explainable under a tree model. The problem of finding a minimum-cardinality set of HGT events whose occurrence on species tree <italic>ST </italic>would give rise to the gene trees in set  is computationally hard [##UREF##12##34##]. In [##UREF##1##16##], Nakhleh <italic>et al</italic>. introduced an accurate, polynomial-time heuristic, RIATA-HGT, for solving the HGT Reconstruction Problem for a pair of species and gene trees (in other words, RIATA-HGT currently handles the case where || = 1). In a nutshell, the method computes the maximum agreement subtree [##UREF##13##35##] of the species tree and each of the gene trees, and adds HGT edges to connect all subtrees that do not appear in the maximum agreement subtree. Theoretically, RIATA-HGT may not compute the minimum-cardinality set of HGT events; nonetheless, experimental results show very good empirical performance on synthetic as well as biological data [##UREF##1##16##].</p> <title>Computing multiple solutions and the graphical output</title> <p>RIATA-HGT was designed originally to compute a single solution to the problem, and was mainly aimed at binary trees. Later, Than and Nakhleh [##UREF##2##17##] extended the method to compute multiple solutions and to handle non-binary trees. These two features are very significant: the former allows biologists to explore multiple potential HGT scenarios, whereas the latter allows for analyzing trees in which some edges were contracted due to inaccuracies (see [##UREF##14##36##] for example). We have conducted an experimental study to compare the performance of RIATA-HGT with LatTrans [##REF##17572027##18##]. Although RIATA-HGT and LatTrans [##UREF##0##14##] have almost the same performance in terms of the number of HGT solutions and the solution size, the former runs much faster than the latter.</p> <p>For a compact representation of multiple solutions, we introduce four terms:</p> <p>• An <italic>event</italic>: this is a single HGT edge, written in the form of <italic>X </italic>→ <italic>Y</italic>, where <italic>X </italic>and <italic>Y </italic>are two nodes in the species tree.</p> <p>• A <italic>subsolution</italic>: this is an <italic>atomic </italic>set of events, which forms a part of an overall solution. In other words, either all or none of the events of a subsolution are taken in a solution.</p> <p>• A <italic>component</italic>: a set of components and/or subsolutions. Two components at the same level of decomposition are independent, in that an element of each component is needed to form a solution.</p> <p>• A <italic>solution</italic>: the union of a single element from each component at the highest level.</p> <p>To illustrate these concepts, consider species tree (((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>), (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>))) and the gene tree (((<italic>a</italic>, <italic>c</italic>), <italic>b</italic>), ((<italic>d</italic>, <italic>f</italic>), <italic>e</italic>)). Observe, that each HGT event required to reconcile the two trees has both endpoints in the subtree ((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>) or both endpoints in the subtree (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>)), and no HGT event has endpoints in both subtrees. In this case, RIATA-HGT divides the pair of trees into two pairs:</p> <p>• Pair 1: ((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>) and ((<italic>a</italic>, <italic>c</italic>), <italic>b</italic>)</p> <p>• Pair 2: (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>)) and ((<italic>d</italic>, <italic>f</italic>), <italic>e</italic>),</p> <p>and solves the HGT Reconstruction Problem on each of the two pairs <italic>independently</italic>. The set of solutions of each pair is a component. Notice that for each pair there are three possible ways to reconcile them; each such way is a called a subsolution. Each subsolution is a set of events, which in this case is only one event. Figure ##FIG##6##7(a)## shows the screen captures of two graphical outputs that correspond to two solutions on this pair of trees. Notice that if a component can be further divided into independent components, RIATA-HGT would do so, which will result in components at different levels, with the largest components being at the highest level.</p> <p>The compact representation of RIATA-HGT's output in terms of subsolutions and components is especially helpful when the number of solutions is large. RIATA-HGT also has an option to display all complete solutions. RIATA-HGT enumerates all complete solutions that are compactly represented as described in the preceding paragraphs. Each solution, which is a set of HGT events, along with the species tree defines an evolutionary network, which RIATA-HGT displays in the eNewick format. For example, for the trees (((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>), (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>))) and (((<italic>a</italic>, <italic>c</italic>), <italic>b</italic>), ((<italic>d</italic>, <italic>f</italic>), <italic>e</italic>)), RIATA-HGT outputs 9 different networks in the eNewick format, if RIATA-HGT's option for displaying complete solutions is on. Figure ##FIG##6##7(b)## shows the corresponding eNewick representations.</p> <p>From the multiple comparisons between a species and a set of trees, RIATA-HGT offers a (strict) consensus network. For each pair of species tree and gene tree, RIATA-HGT computes a set of HGT events for reconciling them. To obtain the consensus network, RIATA-HGT retains only HGT events that appear in every set of solutions for every pair of species tree and gene tree. Those events are then added to the species to build the consensus network.</p> <p>We note here that while offering a simple summary of solutions, this way of computing consensus networks may not be appropriate in general; work is under way to address this issue more properly.</p> <p>Finally, RIATA-HGT may report '[time violation?]' next to an inferred HGT <italic>X </italic>→ <italic>Y</italic>. If this is the case, this indicates that node <italic>X </italic>lies on the path from <italic>Y </italic>to the root of the species tree. Theoretically, this indicates that two nodes that do not co-exist in time, <italic>X </italic>and <italic>Y </italic>in this case, shared genetic material, and hence the warning of 'time violation.' However, this may be the case simply due to incomplete taxon sampling, as discussed in [##REF##17048405##19##]. Therefore, the warning is issued in this case so as to alert that user that this inferred HGT edge is worth further inspection.</p> <title>Assessing the support of HGT edges</title> <p>In [##UREF##15##37##] we proposed a method for assessing the support of HGT edges. Roughly speaking, the support value of HGT edge <italic>X </italic>→ <italic>Y </italic>in the species tree, where <italic>Y</italic>'is the sibling of <italic>Y</italic>, is derived from the bootstrap values of the gene tree branches that separate the clade under <italic>Y </italic>from the clade under <italic>Y</italic>'. The rationale behind the idea is that if <italic>Y</italic>' and <italic>Y </italic>are well separated in the gene trees (i.e., some branches in the path from <italic>Y </italic>to <italic>Y</italic>' have high bootstrap values), HGT is necessary to move <italic>Y </italic>away from <italic>Y</italic>'). For example, the support of HGT edge <italic>X </italic>→ <italic>Y </italic>in Figure ##FIG##7##8(a)## is calculated based on the bootstrap values of the branches separating <italic>B </italic>from <italic>A </italic>in the gene tree, and it is 80 (which is the maximum bootstrap value of all edges on the path separating <italic>A </italic>and <italic>B </italic>in the gene tree). More technical details can be found in [##UREF##15##37##].</p> <p>Than <italic>et al</italic>. [##UREF##15##37##] have studied the reliability of this method for assessing the support of HGT edges on various data sets from [##REF##15598737##38##]. In this paper, we illustrate the output of RIATA-HGT on a pair of species/gene trees from [##REF##15598737##38##], as shown in Figure ##FIG##8##9##. The output of RIATA-HGT on this pair of trees is shown in Figure ##FIG##9##10##. RIATA-HGT computed four solutions, each of which has nine HGT edges. To allow for a compact representation of the solutions, they are divided into two components (which are computed automatically by RIATA-HGT), and each solution is formed by taking one subsolution from each component. HGT edges for the solutions are divided into two components, which means that a complete solution is formed by taking one solution from each component. Each component is labeled by the name of the internal node that is the root of the clade corresponding to that component. In the case of the solutions presented in Figure ##FIG##9##10##, each solution contains nine HGT edges, eight of which form a single subsolution in Component I18 and the ninth is the only edge in the only subsolution in Component I8. The value in parentheses next to each HGT edge is its support value computed from the bootstrap values of the gene tree branches (Figure ##FIG##8##9(b)##). Bergthorsson <italic>et. al</italic>. [##REF##15598737##38##] reported three HGTs involving <italic>Amborella</italic>: one HGT with donor being a species in the <italic>Moss </italic>group (species <italic>Brachythecium</italic>, <italic>Hypnum</italic>, and <italic>Thuidium</italic>, under the internal node I14 in the species tree) and the other two with donors being species in the <italic>Eudicot </italic>group (species <italic>Arabidopsis</italic>, <italic>Beta</italic>, <italic>Brassica</italic>, <italic>Daucus</italic>, <italic>Petunia</italic>, and <italic>Oenothera</italic>, under the internal node I5 in the species tree). The HGT from <italic>Moss </italic>has high SH support value [##UREF##16##39##]. RIATA-HGT finds this event, I14 → <italic>Amborella_H_M</italic>, with bootstrap value 98.0%. The other two HGT events from <italic>Eudicot </italic>do not have significant SH support values. RIATA-HGT also finds these events, I5 → <italic>Amborella_H_E1 </italic>and I2 → <italic>Amborella_H_E2</italic>. However, their support values are 73.0%, much smaller than that of the event from <italic>Moss</italic>. In addition to these three HGT edges, RIATA-HGT identified six more edges, four out of which had support values smaller than 50.0% (RIATA-HGT does not display support values that are smaller than 50.0%). The HGT edge from Component I8, which is shared among all four solutions, has support value of 100.0%. This edge was not reported in [##REF##15598737##38##]. A similar situation arises with the HGT edge I5 → I8, which is part of the three solutions that contain subsolutions 1, 3, and 4 from Component I18: the HGT edge has support of 100.0%, and was not reported in [##REF##15598737##38##], which may be a reflection that the authors focused only on HGT events involving <italic>Amborella</italic>. The ninth HGT edge in Subsolution2 of Component I18 has support value smaller than 50.0%.</p> <title>Other utilities</title> <p>As evident from the description of the methods above, there are fundamental correlations between phylogenetic trees and networks. Hence, many of the evolutionary network utilities use functionalities from the phylogenetic trees domain, which we have implemented and provide as standalone tools in PhyloNet:</p> <p>• A tool for computing the maximum agreement subtree (MAST) of a pair of trees using the algorithm of Steel and Warnow [##UREF##13##35##]. We also extended the algorithm so that it computes <italic>all </italic>MASTs of a pair of tree, and this feature is implemented as well.</p> <p>• A tool for computing the Robinson-Foulds distance measure between two phylogenetic trees [##UREF##7##27##].</p> <p>• A tool for computing the <italic>last common ancestor </italic>(lca) of a set of nodes in a phylogenetic tree.</p> <p>Additionally, PhyloNet provides an implementation of the parsimony-based method RECOMP of Ruths and Nakhleh [##REF##18048130##40##,##UREF##17##41##] for detecting interspecific recombination in a sequence alignment.</p>
<title>Results and discussion</title> <title>The evolutionary network model</title> <p>In this paper, we assume the "evolutionary network" model, which was formulated independently by Moret <italic>et al</italic>. [##REF##17048405##19##] and Baroni <italic>et al</italic>. [##UREF##3##20##]. We now describe the model as well as some basic definitions and notations that we will use later.</p> <p>Let <italic>T </italic>= (<italic>V</italic>, <italic>E</italic>) be a tree, where <italic>V </italic>and <italic>E </italic>are the <italic>tree nodes </italic>and <italic>tree edges</italic>, respectively, and let <italic>L</italic>(<italic>T</italic>) denote the tree's leaf set. Further, let <italic>χ </italic>be a set of taxa (organisms). Then, <italic>T </italic>is a <italic>phylogenetic tree </italic>over <italic>χ </italic>if there is a bijection between <italic>χ </italic>and <italic>L</italic>(<italic>T</italic>). Henceforth, we will identify the taxa set with the leaves they are mapped to, and let [<italic>n</italic>] = {1,..., <italic>n</italic>} denote the set of leaf-labels. A tree <italic>T </italic>is said to be <italic>rooted </italic>if the set of edges <italic>E </italic>is directed and there is a single node <italic>r </italic>∈ <italic>V </italic>with in-degree 0. Let <italic>T </italic>be a phylogenetic tree on set <italic>χ </italic>of taxa, and let <italic>χ</italic>' ⊆ <italic>χ </italic>be a subset of taxa; then, we denote by <italic>T</italic>|<italic>χ</italic>' the subtree with minimum number of nodes and edges that spans the leaves in <italic>χ</italic>' (in other words, <italic>T</italic>|<italic>χ</italic>' is the tree <italic>T </italic>restricted to subset <italic>χ</italic>' of its leaves).</p> <p>An evolutionary (phylogenetic) network <italic>N </italic>= (<italic>V</italic>, <italic>E</italic>) over the set <italic>χ </italic>of taxa is a rooted, directed, acyclic graph such that there is a bijection between <italic>χ </italic>and the set <italic>L</italic>(<italic>N</italic>) of the network's leaves (see Figure ##FIG##1##2##). The set <italic>V </italic>is partitioned into two sets: <italic>V</italic><sub><italic>T</italic></sub>, the set of <italic>tree nodes</italic>, which are the nodes with in-degree smaller than two, and <italic>V</italic><sub><italic>N</italic></sub>, the set of <italic>network nodes</italic>, which are the nodes with in-degree greater than or equal to two. Similarly, the set <italic>E </italic>is partitioned into two sets: <italic>E</italic><sub><italic>T</italic></sub>, the set of <italic>tree edges</italic>, which are edges incident into tree nodes, and <italic>E</italic><sub><italic>N</italic></sub>, the set of <italic>network edges</italic>, which are the edges incident into network nodes.</p> <p>For two nodes <italic>u </italic>and <italic>v </italic>in directed graph <italic>G</italic>, we say that <italic>v </italic>is reachable from <italic>u</italic>, denoted by  if there exists a directed path from <italic>u </italic>to <italic>v </italic>in the tree <italic>G</italic>. For three nodes <italic>u</italic>, <italic>v </italic>and <italic>x </italic>in directed graph <italic>G</italic>, we write  if all directed paths from <italic>u </italic>to <italic>v </italic>go through node <italic>x</italic>;  if no directed paths from <italic>u </italic>to <italic>v </italic>go through node <italic>x</italic>; and  if at least one directed path from <italic>u </italic>to <italic>v </italic>goes through node <italic>x </italic>and at least one directed path from <italic>u </italic>to <italic>v </italic>does not go through node <italic>x</italic>. For example, in network <italic>N</italic><sub>1 </sub>in Figure ##FIG##1##2##, rooted at node r<sub>1</sub>, we have , , and .</p> <title>Evolutionary network representation</title> <p>The Newick format for representing and storing phylogenetic trees was adopted in 1986 [##REF##3024605##21##], and it has been the standard for almost all phylogeny software packages ever since. This format captures an elegant correspondence between leaf-labeled trees and matched parentheses, where the leaves are represented by their names and the internal nodes by a matched pair of parentheses that contains a list of the Newick representation of all its children. Shown in Figure ##FIG##2##3## are three trees along with their representations in the Newick format.</p> <p>Existing phylogenetic network software tools store these networks as adjacency lists of their underlying graphs, which are usually very large and necessitate translation of representations among the different tools. Morin and Moret [##REF##16717070##22##] proposed a modified version of the Newick format for representing such networks. In their format, network nodes are represented by nodes labeled with #H, and those nodes are considered as two separate nodes in the normal Newick format for trees. See Figure ##FIG##3##4## for an example. We have independently proposed a new method of <italic>tree decomposition </italic>of evolutionary networks, which provides the basis for a new format, <italic>extended Newick </italic>(or eNewick for short), and used it as a compact representation of evolutionary networks. The idea in our method is to break the network into a set of trees, and then represent the network as a collection of Newick representations of those trees. Since the eNewick format is nothing but a collection of trees in the Newick format, it follows that eNewick can represent unrooted networks. However, both in this paper as well as in the PhyloNet utilities, rooting is assumed, since different ways of rooting the same evolutionary networks may imply different evolutionary relationships.</p> <p>Let <italic>N </italic>= (<italic>V </italic>= (<italic>V</italic><sub><italic>N </italic></sub>∪ <italic>V</italic><sub><italic>T</italic></sub>); <italic>E</italic>) be an evolutionary network, with |<italic>V</italic><sub><italic>N</italic></sub>| = ℓ. We create a forest of ℓ trees as follows.</p> <p>• For every <italic>u</italic><sub><italic>i </italic></sub>∈ <italic>V</italic><sub><italic>N</italic></sub></p> <p>- Compute the set <italic>V</italic><sub><italic>i </italic></sub>= {<italic>v </italic>∈ <italic>V </italic>: (<italic>v</italic>, <italic>u</italic><sub><italic>i</italic></sub>) ∈ <italic>E</italic>} of <italic>u</italic><sub><italic>i</italic></sub>'s parents;</p> <p>- Create <italic>k </italic>new leaves, all labeled with <italic>x</italic><sub><italic>i </italic></sub>({<italic>x</italic><sub><italic>i</italic></sub>} ∩ <italic>L</italic>(<italic>N</italic>) = ∅);</p> <p>- Delete from <italic>V </italic>the set of all edges in <italic>V</italic><sub><italic>i </italic></sub>× {<italic>u</italic><sub><italic>i</italic></sub>};</p> <p>- Add to <italic>V </italic>the set of edges <italic>V</italic><sub><italic>i </italic></sub>× {<italic>x</italic><sub><italic>i</italic></sub>};</p> <p>- Assign <italic>x</italic><sub><italic>i </italic></sub>as the name of the tree rooted at node <italic>u</italic><sub><italic>i</italic></sub>;</p> <p>The result is a forest of trees  = {<italic>t</italic><sub>1</sub>,..., <italic>t</italic><sub>ℓ</sub>} such that (1) |<italic>L</italic>(<italic>t</italic><sub><italic>i</italic></sub>)| ≥ 1 for every 1 ≤ <italic>i </italic>≤ ℓ, (2)  and (3) <italic>L</italic>(<italic>t</italic><sub><italic>i</italic></sub>) ∩ <italic>L</italic>(<italic>t</italic><sub><italic>j</italic></sub>) = ∅ for every 1 ≤ <italic>i</italic>, <italic>j </italic>≤ ℓ and <italic>i </italic>≠ <italic>j</italic>. We call  the <italic>tree decomposition </italic>of <italic>N</italic>. Then, the eNewick representation of <italic>N </italic>is the ℓ-tuple ⟨<italic>n</italic>(<italic>t</italic><sub>1</sub>);...; <italic>n</italic>(<italic>t</italic><sub>ℓ</sub>)⟩, where <italic>n</italic>(<italic>t</italic><sub><italic>i</italic></sub>) is the Newick representation of tree <italic>t</italic><sub><italic>i</italic></sub>. Figure ##FIG##2##3## shows the tree decomposition and eNewick representation of the network <italic>N</italic><sub>1 </sub>in Figure ##FIG##1##2##.</p> <p>In the case of modeling networks with horizontal gene transfer events, it is often very helpful to the biologist to know what the species tree is and what the additional set of HGT events are. Such information is "lost" in an eNewick representation, unless the representation is extended further to keep a record of the "species tree parent" of each network node. Therefore, in this case (which is the output of RIATA-HGT) we opt for the format of a species tree <italic>T</italic>, in Newick format, followed by a list of the HGT edges, each written as <italic>X </italic>→ <italic>Y</italic>, where <italic>X </italic>and <italic>Y </italic>are two nodes in <italic>T</italic>.</p> <title>Evolutionary network characterization</title> <p>As we described in the background section, an evolutionary network induces, or contains, a set of trees. We now formalize this concept and characterize networks in terms of the trees they induce. A tree <italic>T </italic>is induced by a network <italic>N </italic>if <italic>T </italic>is obtained from <italic>N </italic>as follows: (1) for each node of in-degree larger than one, remove all but one of the network edges incident into it, and (2) for every node of in-degree and out-degree 1, and whose parent is <italic>u </italic>and child is <italic>v</italic>, remove the two edges incident with it, and add an edge from <italic>u </italic>to <italic>v</italic>. We denote by (<italic>N</italic>) the set of all trees induced by <italic>N</italic>. Figure ##FIG##4##5## shows the sets (<italic>N</italic><sub>1</sub>) and (<italic>N</italic><sub>2</sub>) for the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2##. It is important to note that this set of trees is completely different from the set of trees obtained by the tree decomposition we introduced to facilitate the eNewick format. An evolutionary network <italic>N </italic>with <italic>V</italic><sub><italic>N </italic></sub>= {<italic>v</italic><sub>1</sub>,..., <italic>v</italic><sub>ℓ</sub>}, such that <italic>indegree</italic>(<italic>v</italic><sub><italic>i</italic></sub>) = <italic>ρ</italic><sub><italic>i</italic></sub>, induces <italic>m </italic>trees, where </p> <p>Given an evolutionary network <italic>N</italic>, the set (<italic>N</italic>) is unique. Further, this set informs about the possible gene histories that the network reconciles.</p> <p>In addition to characterizing evolutionary networks by the set of trees they induce, we consider a <italic>cluster</italic>-based characterization. This view of evolutionary networks is very important for understanding the relationships among the "evolutionary perspective" of evolutionary networks and the "cluster, or splits, perspective", which is adopted in various methods [##REF##9520503##23##,##UREF##4##24##]. Let <italic>T </italic>= (<italic>V</italic>, <italic>E</italic>) be a phylogenetic tree on set <italic>χ </italic>of taxa and rooted at node <italic>r</italic>. Each edge <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>) ∈ <italic>E </italic>induces a <italic>cluster </italic>of taxa, denoted <italic>c</italic><sub><italic>e</italic></sub>, which is the set . The (nontrivial) clusters of tree <italic>T </italic>is the set (<italic>T</italic>) = {<italic>c</italic><sub><italic>e </italic></sub>: <italic>e </italic>is an internal edge in <italic>E</italic>}. The topology of a tree is a compact graphical representation of its clusters, where the root of the clade that corresponds to cluster <italic>c</italic><sub><italic>e</italic>' </sub>lies on the path from the root of the tree to the root of the clade that corresponds to cluster <italic>c</italic><sub><italic>e </italic></sub>if and only if <italic>c</italic><sub><italic>e </italic></sub>⊆ <italic>c</italic><sub><italic>e</italic>'</sub>. Hence, clusters play an important role in phylogenetic tree characterization and reconstruction. A straightforward way to extend this concept to evolutionary networks is to define the set of clusters of evolutionary network <italic>N </italic>as . The clusters of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##0##1##.</p> <p>In this form of cluster-based characterization, clusters are unweighted; equivalently, all clusters are weighted equally. One option of weighting the clusters is by considering the fraction of trees in which it appears. In other words, the weight of a cluster <italic>c</italic><sub><italic>e </italic></sub>can be computed as</p> <p></p> <p>This weighting scheme informs not only about the clusters of taxa that the network represents, but also how many gene trees in the input share each cluster. It is important to note here that this weighting of a cluster should not be confused with, or used in lieu of, support values of clusters, since a cluster may appear in only one gene tree and have a high support (e.g., by having a high bootstrap value on the edge that defines it) whereas a poorly supported cluster may appear in several trees.</p> <p>Nakhleh and colleagues have recently introduced a new characterization of evolutionary networks based on the <italic>tripartitions </italic>of their edges [##REF##17048405##19##]. Let <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>) be an edge in an evolutionary network on set <italic>χ </italic>of taxa and rooted at node <italic>r</italic>. We define three disjoint sets <italic>A</italic><sub><italic>e </italic></sub>= , <italic>B</italic><sub><italic>e </italic></sub>= , and <italic>C</italic><sub><italic>e </italic></sub>= . Then, the tripartition induced by edge <italic>e</italic>, denoted <italic>θ</italic><sub><italic>e</italic></sub>, is the triplet ⟨<italic>A</italic><sub><italic>e</italic></sub>; <italic>B</italic><sub><italic>e</italic></sub>; <italic>C</italic><sub><italic>e</italic></sub>⟩. Roughly speaking, the tripartition induced by an edge is the three sets of taxa reachable from the root only through that edge (<italic>A</italic><sub><italic>e</italic></sub>), reachable through that edge but not exclusively (<italic>B</italic><sub><italic>e</italic></sub>), and not reachable through that edge (<italic>C</italic><sub><italic>e</italic></sub>). The set of (nontrivial) tripartitions induced by a evolutionary network <italic>N</italic>, denoted by <italic>θ</italic>(<italic>N</italic>), is {<italic>θ</italic><sub><italic>e </italic></sub>: <italic>e </italic>is an internal edge in <italic>E</italic>}. The tripartitions of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##1##2##.</p> <p>Tripartition-based characterization of an evolutionary network helps to identify clades across which no genetic transfer occurred. If <italic>A</italic><sub><italic>e </italic></sub>= <italic>X </italic>and <italic>B</italic><sub><italic>e </italic></sub>= ∅ for an edge <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>), this implies that the clade rooted at node <italic>v </italic>has set <italic>X </italic>of leaves, and there does not exist any exchange or transfer of genetic material between any organism in <italic>X </italic>and another organism that is not in <italic>X</italic>. Equivalently, an evolutionary network can be partitioned into a collection {<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>,..., <italic>N</italic><sub><italic>k</italic></sub>} of evolutionary networks that result from <italic>N </italic>by deleting every edge <italic>e </italic>for which <italic>B</italic><sub><italic>e </italic></sub>= ∅. Such a partition informs about the "locality" of reticulation events: each event in <italic>N </italic>is local to one of the <italic>k </italic>components in {<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>,..., <italic>N</italic><sub><italic>k</italic></sub>}. Further, this partition implies that each of the trees in (<italic>N</italic>) has <italic>k </italic>clades that have the sets {<italic>L</italic>(<italic>N</italic><sub>1</sub>), <italic>L</italic>(<italic>N</italic><sub>2</sub>),..., <italic>L</italic>(<italic>N</italic><sub><italic>k</italic></sub>)} of leaves.</p> <title>Evolutionary network comparison</title> <p>Researchers are often interested in quantifying the similarities and differences between two phylogenies reconstructed either from two different sources of data or from two different reconstruction methods. Such a quantification provides insights into agreements and disagreements among analyses, confidence values for different parts of the phylogenies, and metrics for comparing the performance of phylogenetic reconstruction methods. In the context of phylogenetic trees, this quantification is most commonly done based on one of two criteria:</p> <p>• <italic>Topological differences</italic>. The topologies, or shapes, of two phylogenetic trees are compared, and their differences are quantified. Several measures have been introduced to quantify topological differences and similarities between a pair of trees, such as the Robinson-Foulds measure and the SPR distance; see [##UREF##5##25##,##UREF##6##26##] for a description of several such measures.</p> <p>• <italic>Fitness to sequence evolution</italic>. When two phylogenies are reconstructed from the same sequence data set, it is common to compare them in terms of how well they model the evolution of the sequences. The most commonly used criteria for measuring such fitness are maximum parsimony, maximum likelihood, and the Bayesian posterior probability; see [##UREF##5##25##] for a detailed discussion of all three criteria.</p> <p>In this section, we report on the capabilities in PhyloNet for comparing two evolutionary networks in terms of their topological differences and similarities, as well as in terms of their fitness to sequence evolution based on the maximum parsimony criterion.</p> <p>For quantifying the dissimilarity between two evolutionary network topologies <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2</sub>, we want a measure <italic>m</italic>(·,·) that satisfies three conditions:</p> <p><italic>Identity</italic>: <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = 0 if and only if <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>are <italic>equivalent</italic>;</p> <p><italic>Symmetry</italic>: <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = <italic>m</italic>(<italic>N</italic><sub>2</sub>, <italic>N</italic><sub>1</sub>); and</p> <p><italic>Triangle inequality</italic>: <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>3</sub>) + <italic>m</italic>(<italic>N</italic><sub>3</sub>, <italic>N</italic><sub>2</sub>) ≥ <italic>m</italic>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) for any evolutionary network <italic>N</italic><sub>3</sub>.</p> <p>This issue of evolutionary network equivalence was discussed in [##REF##17048405##19##]. The three characterizations of evolutionary networks that we described above induce three measures which we now define. Let <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>be two evolutionary networks on the same set <italic>X </italic>of leaves; we define the three measures as follows.</p> <title>Tree-based comparison</title> <p>Let (<italic>N</italic><sub>1</sub>) and (<italic>N</italic><sub>2</sub>) be the two sets of all trees induced by the two networks, and let <italic>d</italic>(·,·) be a distance metric on trees (see [##UREF##6##26##] for examples of such metrics). The idea is to compare the two networks based on how similar their corresponding sets of trees are. We formalize this as follows. Construct a weighted complete bipartite graph <italic>G</italic>(<italic>U</italic><sub>1</sub>, <italic>U</italic><sub>2</sub>, <italic>E</italic>), where |<italic>U</italic><sub><italic>i</italic></sub>| = |(<italic>N</italic><sub><italic>i</italic></sub>)|, and there are two bijections <italic>f</italic><sub><italic>i </italic></sub>: <italic>U</italic><sub><italic>i </italic></sub>→ (<italic>N</italic><sub><italic>i</italic></sub>) for <italic>i </italic>= 1, 2. The weight of an edge <italic>e </italic>= (<italic>u</italic>, <italic>v</italic>) ∈ <italic>E </italic>for <italic>u </italic>∈ <italic>U</italic><sub>1 </sub>and <italic>v </italic>∈ <italic>U</italic><sub>2</sub>, <italic>w</italic>(<italic>e</italic>) = <italic>d</italic>(<italic>f</italic><sub>1</sub>(<italic>u</italic>), <italic>f</italic><sub>2</sub>(<italic>v</italic>)). Then, the tree-based measure <italic>m</italic><sup><italic>tree</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) is defined as the weight of a minimum-weight edge cover of <italic>G </italic>divided by, the number of the edges in the cover. In its current implementation, PhyloNet uses the Robinson-Foulds distance measure [##UREF##7##27##] for <italic>d</italic>. The tree-based measure was first introduced by Nakhleh <italic>et al</italic>. [##UREF##8##28##]. An illustration of tree-based comparison of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## is given in Figure ##FIG##5##6##. Shown on the left of Figure ##FIG##5##6## is the bipartite graph <italic>G </italic>built from the sets (<italic>N</italic><sub>1</sub>) and (<italic>N</italic><sub>2</sub>) of trees induced by the two networks; these two sets are shown in Figure ##FIG##4##5##. The weight of each edge connecting two nodes in <italic>G </italic>is the RF distance between the two trees corresponding to these two nodes. These weights can be normalized by the number of internal edges in the trees. Since each of the eight trees has six internal edges, the weight of each edge in <italic>G </italic>can be divided by six to normalize it.</p> <p>Shown on the right of Figure ##FIG##5##6## is the minimum-weight edge cover of <italic>G</italic>, which is the set of edges that satisfies two conditions: (1) each node in <italic>G </italic>must be the endpoint of at least one edge in the set, and (2) the sum of the weights of the edges in the set is minimum among all sets of edges satisfying condition 1. In this case, the four edges shown are a cover, since each node in <italic>G </italic>is "covered" by at least one edge (here, each node is covered by exactly one edge). Further, it is of minimum weight, which equals 2, since a simple inspection yields that every other cover has a weight larger than 2. Since the cover has four edges in it, we have <italic>m</italic><sup><italic>tree</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = (0 + 0 + 1/6 + 1/6)/4 = 1/12. If we use the raw RF values, then <italic>m</italic><sup><italic>tree</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = (0 + 0 + 1 + 1)/4 = 1/2.</p> <title>Cluster-based comparison</title> <p>Let <italic>C</italic><sub>1 </sub>= (<italic>N</italic><sub>1</sub>) and <italic>C</italic><sub>2 </sub>= (<italic>N</italic><sub>2</sub>) be the two sets of all clusters induced by the two networks. We define the measure based on these two sets to be</p> <p></p> <p>The rationale behind this measure is that it is the sum of the ratios of clusters present in one but not both networks. The cluster-based measure was first introduced by Nakhleh <italic>et al</italic>. [##UREF##9##29##]. The sets <italic>C</italic><sub>1 </sub>= (<italic>N</italic><sub>1</sub>) and <italic>C</italic><sub>2 </sub>= (<italic>N</italic><sub>2</sub>) of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##0##1##, with |<italic>C</italic><sub>1</sub>| = |<italic>C</italic><sub>2</sub>| = 14. Since |<italic>C</italic><sub>1 </sub>- <italic>C</italic><sub>2</sub>| = |<italic>C</italic><sub>2 </sub>- <italic>C</italic><sub>1</sub>| = 2 (the two highlighted clusters in Table ##TAB##0##1##), we have <italic>m</italic><sup><italic>cluster</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = 1/7. A similar weighting scheme to that described in the previous section can be used to incorporate the fraction of trees in which a cluster appears into the measure calculation.</p> <title>Tripartition-based comparison</title> <p>Let <italic>θ</italic><sub>1 </sub>= <italic>θ</italic>(<italic>N</italic><sub>1</sub>) and <italic>θ</italic><sub>2 </sub>= <italic>θ</italic>(<italic>N</italic><sub>2</sub>) be the two sets of all tripartitions induced by the two networks. We define the measure based on these two sets to be</p> <p></p> <p>This measure views the two networks in terms of the sets of edges they define (where an edge is in a 1-1 correspondence with a tripartition) and computes the sum of the ratios of edges present in one but not both networks. The tripartition-based measure was devised by Moret <italic>et al</italic>. [##REF##17048405##19##]. The sets <italic>θ</italic><sub>1 </sub>= <italic>θ</italic>(<italic>N</italic><sub>1</sub>) and <italic>θ</italic><sub>2 </sub>= <italic>θ</italic>(<italic>N</italic><sub>2</sub>) of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure ##FIG##1##2## are listed in Table ##TAB##1##2##, with |<italic>θ</italic><sub>1</sub>| = |<italic>θ</italic><sub>2</sub>| = 12. Since |<italic>θ</italic><sub>1 </sub>- <italic>θ</italic><sub>2</sub>| = |<italic>θ</italic><sub>2 </sub>- <italic>θ</italic><sub>1</sub>| = 1 (the highlighted tripartition in Table ##TAB##1##2##), we have <italic>m</italic><sup><italic>tripartition</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = 1/12.</p> <title>Which measure to use?</title> <p>Several distance measures, such as the Robinson-Fould measure and the Subtree Prune and Regraft (SPR) distance, have been introduced over the years to quantify the difference between the topologies of a pair of phylogenetic trees; e.g., see [##UREF##5##25##,##UREF##6##26##] for description of many of these measures. Even though these measures may compute different distance values on the same pair of trees, there has been no consensus as to which measure should be used in general [##UREF##10##30##]. It may be the case that the Robinson-Foulds measure is more commonly used than the others, but this may be a mere reflection of its very low time requirements as compared to the other, more compute-intensive, measures.</p> <p>Regarding the three measures for comparing networks, a scenario analogous to that in phylogenetic trees arises here: each measure gives a different quantification of the dissimilarity between two networks based on one of the three ways to characterize a given network. As shown in the examples above, some or all of these measures may compute the same value for a given pair of networks, but that may not always be the case. Tree-based comparison of networks can be viewed as a method to quantify how similar, or dissimilar, two networks are in terms of their quality as a summary of a collection of trees. In some cases, even though two networks "look different," they may be identical in terms of the trees they induce – this is the issue of indistinguishability of networks from a collection of trees that Nakhleh and colleagues discussed in [##REF##17048405##19##]. In such a case, using the tree-based comparison, or equivalently the cluster-based comparison, is most appropriate. However, if the similarity/dissimilarity of two networks means something close to an <italic>isomorphism</italic>, then the tripartition-based measure is more appropriate. However, it is important to note that none of the three measures described here is a metric on the general space of all evolutionary networks labeled by a given set of taxa.</p> <p>A practical distinction among the three measures can be derived based on the methods used to infer the evolutionary history of the set of species under study. Methods such as SplitsTree [##REF##9520503##23##] and NeighborNet [##UREF##4##24##] represent the evolutionary history as a set of splits, or clusters, hence making it more natural to use cluster-based comparison to study their performance. Methods such as RIATA-HGT [##UREF##1##16##] and LatTrans [##UREF##0##14##] compute evolutionary networks that are rooted, directed, acylic graphs, where internal nodes have an evolutionary implication in terms of ancestry. For these two methods, all three measures are appropriate. When the evolutionary history of a set of species is represented as a collection of its constituent gene trees, the tree-based measure is most appropriate.</p> <p>Finally, a clear distinction can be made among the methods in terms of computational requirements. In their current implementations, the tripartition-based measure is very fast in practice, taking time that is polynomial in the size of the two networks. On the other hand, the tree- and cluster-based measures are much slower, taking time that is exponential in the number of network nodes in the two networks (since these measures compute explicitly all trees inside each of the two networks). In light of recent complexity results that we obtained [##UREF##11##31##], it is very likely that no polynomial-time algorithms exist for computing the tree- and cluster-based measures in general.</p> <title>Parsimony of evolutionary networks</title> <p>Nakhleh and colleagues have recently formalized a maximum parsimony (MP) criterion for evolutionary networks [##REF##16447967##32##] and demonstrated its utility in reconstructing evolutionary networks on both biological and synthetic data sets [##REF##17068107##33##]. In this section, we describe a PhyloNet utility that allows for comparing two evolutionary networks in terms of their fitness to the evolution of a sequence data set, based on the MP criterion. We first begin with a brief review of the MP criterion, based on the exposition in [##REF##16447967##32##].</p> <p>The relationship between an evolutionary network and its constituent trees, as described in the background section, is the basis for the MP extension to evolutionary networks.</p> <p><bold>Definition 1 </bold><italic>The Hamming distance between two equal-length sequences x and y, denoted by H</italic>(<italic>x</italic>, <italic>y</italic>)<italic>, is the number of positions j such that x</italic><sub><italic>j </italic></sub>≠ <italic>y</italic><sub><italic>j</italic></sub>.</p> <p>Given a fully-labeled tree <italic>T</italic>, i.e., a tree in which each node <italic>v </italic>is labeled by a sequence <italic>s</italic><sub><italic>v </italic></sub>over some alphabet Σ, we define the Hamming distance of an edge <italic>e </italic>∈ <italic>E</italic>(<italic>T</italic>), denoted by <italic>H</italic>(<italic>e</italic>), to be <italic>H</italic>(<italic>s</italic><sub><italic>u</italic></sub>, <italic>s</italic><sub><italic>v</italic></sub>), where <italic>u </italic>and <italic>v </italic>are the two endpoints of <italic>e</italic>. We now define the parsimony score of a tree <italic>T</italic>.</p> <p><bold>Definition 2 </bold><italic>The parsimony score of a fully-labeled tree T, is Σ</italic><sub><italic>e </italic>∈ <italic>E</italic>(<italic>T</italic>) </sub><italic>H</italic>(<italic>e</italic>)<italic>. Given a set S of sequences, a maximum parsimony tree for S is a tree leaf-labeled by S and assigned labels for the internal nodes, of minimum parsimony score</italic>.</p> <p>The parsimony definitions can be extended in a straightforward manner to incorporate different site substitution matrices, where different substitutions do not necessarily contribute equally to the parsimony score, by simply modifying the formula <italic>H</italic>(<italic>x</italic>, <italic>y</italic>) to reflect the weights. Let Σ be the set of states that the two sequences <italic>x </italic>and <italic>y </italic>can take (e.g., Σ = {<italic>A</italic>, <italic>C</italic>, <italic>T</italic>, <italic>G</italic>} for DNA sequences), and <italic>W </italic>the site substitution matrix such that <italic>W</italic>[<italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2</sub>] is the weight of replacing <italic>σ</italic><sub>1 </sub>by <italic>σ</italic><sub>2</sub>, for every <italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2 </sub>∈ Σ. In particular, the <italic>identity </italic>site substitution matrix satisfies <italic>W</italic>[<italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2</sub>] = 0 when <italic>σ</italic><sub>1 </sub>= <italic>σ</italic><sub>2</sub>, and <italic>W</italic>[<italic>σ</italic><sub>1</sub>, <italic>σ</italic><sub>2</sub>] = 1 otherwise. The weighted Hamming distance between two sequence is <italic>H</italic>(<italic>x</italic>, <italic>y</italic>) = Σ<sub>1 ≤ <italic>i </italic>≤ <italic>k </italic></sub><italic>W</italic>(<italic>x</italic><sub><italic>i</italic></sub>, <italic>y</italic><sub><italic>i</italic></sub>), where <italic>k </italic>is the length of the sequences <italic>x </italic>and <italic>y</italic>. The rest of the definitions are identical to the simple Hamming distance case. As described above, the evolutionary history of a single (non-recombining) gene is modeled by one of the trees contained inside the evolutionary network of the species containing that gene. Therefore the evolutionary history of a site <italic>s </italic>is also modeled by a tree contained inside the evolutionary network. A natural way to extend the tree-based parsimony score to fit a dataset that evolved on a network is to define the parsimony score for each site as the minimum parsimony score of that site over all trees contained inside the network.</p> <p><bold>Definition 3 </bold><italic>(</italic>[##REF##16447967##32##]<italic>) The parsimony score of a network N leaf-labeled by a set S of taxa, is</italic></p> <p></p> <p><italic>where TCost</italic>(<italic>T</italic>, <italic>s</italic><sub><italic>i</italic></sub>) <italic>is the parsimony score of site s</italic><sub><italic>i </italic></sub><italic>on tree T</italic>.</p> <p>Notice that as usually large segments of DNA, rather than single sites, evolve together, Definition 3 can be extended easily to reflect this fact, by partitioning the sequences <italic>S </italic>into non-overlapping blocks <italic>b</italic><sub><italic>i </italic></sub>of sites, rather than sites <italic>s</italic><sub><italic>i</italic></sub>, and replacing <italic>s</italic><sub><italic>i </italic></sub>by <italic>b</italic><sub><italic>i </italic></sub>in Definition 3. This extension may be very significant if, for example, the evolutionary history of a gene includes some recombination events, and hence that evolutionary history is not a single tree. In this case, the recombination breakpoint can be detected by experimenting with different block sizes.</p> <p>The MP utility in PhyloNet allows the user to specify two evolutionary networks (either or both of which can be a tree) <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>and a sequence data set <italic>S</italic>, and computes the parsimony scores <italic>NCost</italic>(<italic>N</italic><sub>1</sub>, <italic>S</italic>) and <italic>NCost</italic>(<italic>N</italic><sub>2</sub>, <italic>S</italic>). The user can then compare the two scores and evaluate the fitness of the networks to the data set <italic>S </italic>based on the difference in the scores. Further, the utility allows the user, for example, to evaluate the significance of each network edge in a network <italic>N </italic>by comparing the parsimony scores of two different versions of <italic>N </italic>that contain different subsets of the network edges in <italic>N</italic>.</p> <title>Reconstructing evolutionary networks from species/gene trees</title> <p>Assuming incongruence among gene and species trees is the result of HGT events only, the <italic>Phylogeny-based HGT Reconstruction Problem</italic>, or HGT Reconstruction Problem for short, is defined as follows:</p> <p><bold>Problem 1 </bold><italic>(HGT Reconstruction Problem)</italic></p> <p><bold>Input: </bold><italic>A species tree ST and a set </italic> = {<italic>T</italic><sub>1</sub>,..., <italic>T</italic><sub><italic>p</italic></sub>}<italic>of gene trees</italic>.</p> <p><bold>Output: </bold><italic>An evolutionary network N, obtained by adding a minimal set of edges Ξ to T, such that N contains every tree T</italic><sub><italic>i </italic></sub>∈ </p> <p>The minimization criterion is a reflection of Occam's razor: in the absence of any additional biological knowledge, HGT events should be used sparingly to explain data features otherwise explainable under a tree model. The problem of finding a minimum-cardinality set of HGT events whose occurrence on species tree <italic>ST </italic>would give rise to the gene trees in set  is computationally hard [##UREF##12##34##]. In [##UREF##1##16##], Nakhleh <italic>et al</italic>. introduced an accurate, polynomial-time heuristic, RIATA-HGT, for solving the HGT Reconstruction Problem for a pair of species and gene trees (in other words, RIATA-HGT currently handles the case where || = 1). In a nutshell, the method computes the maximum agreement subtree [##UREF##13##35##] of the species tree and each of the gene trees, and adds HGT edges to connect all subtrees that do not appear in the maximum agreement subtree. Theoretically, RIATA-HGT may not compute the minimum-cardinality set of HGT events; nonetheless, experimental results show very good empirical performance on synthetic as well as biological data [##UREF##1##16##].</p> <title>Computing multiple solutions and the graphical output</title> <p>RIATA-HGT was designed originally to compute a single solution to the problem, and was mainly aimed at binary trees. Later, Than and Nakhleh [##UREF##2##17##] extended the method to compute multiple solutions and to handle non-binary trees. These two features are very significant: the former allows biologists to explore multiple potential HGT scenarios, whereas the latter allows for analyzing trees in which some edges were contracted due to inaccuracies (see [##UREF##14##36##] for example). We have conducted an experimental study to compare the performance of RIATA-HGT with LatTrans [##REF##17572027##18##]. Although RIATA-HGT and LatTrans [##UREF##0##14##] have almost the same performance in terms of the number of HGT solutions and the solution size, the former runs much faster than the latter.</p> <p>For a compact representation of multiple solutions, we introduce four terms:</p> <p>• An <italic>event</italic>: this is a single HGT edge, written in the form of <italic>X </italic>→ <italic>Y</italic>, where <italic>X </italic>and <italic>Y </italic>are two nodes in the species tree.</p> <p>• A <italic>subsolution</italic>: this is an <italic>atomic </italic>set of events, which forms a part of an overall solution. In other words, either all or none of the events of a subsolution are taken in a solution.</p> <p>• A <italic>component</italic>: a set of components and/or subsolutions. Two components at the same level of decomposition are independent, in that an element of each component is needed to form a solution.</p> <p>• A <italic>solution</italic>: the union of a single element from each component at the highest level.</p> <p>To illustrate these concepts, consider species tree (((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>), (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>))) and the gene tree (((<italic>a</italic>, <italic>c</italic>), <italic>b</italic>), ((<italic>d</italic>, <italic>f</italic>), <italic>e</italic>)). Observe, that each HGT event required to reconcile the two trees has both endpoints in the subtree ((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>) or both endpoints in the subtree (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>)), and no HGT event has endpoints in both subtrees. In this case, RIATA-HGT divides the pair of trees into two pairs:</p> <p>• Pair 1: ((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>) and ((<italic>a</italic>, <italic>c</italic>), <italic>b</italic>)</p> <p>• Pair 2: (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>)) and ((<italic>d</italic>, <italic>f</italic>), <italic>e</italic>),</p> <p>and solves the HGT Reconstruction Problem on each of the two pairs <italic>independently</italic>. The set of solutions of each pair is a component. Notice that for each pair there are three possible ways to reconcile them; each such way is a called a subsolution. Each subsolution is a set of events, which in this case is only one event. Figure ##FIG##6##7(a)## shows the screen captures of two graphical outputs that correspond to two solutions on this pair of trees. Notice that if a component can be further divided into independent components, RIATA-HGT would do so, which will result in components at different levels, with the largest components being at the highest level.</p> <p>The compact representation of RIATA-HGT's output in terms of subsolutions and components is especially helpful when the number of solutions is large. RIATA-HGT also has an option to display all complete solutions. RIATA-HGT enumerates all complete solutions that are compactly represented as described in the preceding paragraphs. Each solution, which is a set of HGT events, along with the species tree defines an evolutionary network, which RIATA-HGT displays in the eNewick format. For example, for the trees (((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>), (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>))) and (((<italic>a</italic>, <italic>c</italic>), <italic>b</italic>), ((<italic>d</italic>, <italic>f</italic>), <italic>e</italic>)), RIATA-HGT outputs 9 different networks in the eNewick format, if RIATA-HGT's option for displaying complete solutions is on. Figure ##FIG##6##7(b)## shows the corresponding eNewick representations.</p> <p>From the multiple comparisons between a species and a set of trees, RIATA-HGT offers a (strict) consensus network. For each pair of species tree and gene tree, RIATA-HGT computes a set of HGT events for reconciling them. To obtain the consensus network, RIATA-HGT retains only HGT events that appear in every set of solutions for every pair of species tree and gene tree. Those events are then added to the species to build the consensus network.</p> <p>We note here that while offering a simple summary of solutions, this way of computing consensus networks may not be appropriate in general; work is under way to address this issue more properly.</p> <p>Finally, RIATA-HGT may report '[time violation?]' next to an inferred HGT <italic>X </italic>→ <italic>Y</italic>. If this is the case, this indicates that node <italic>X </italic>lies on the path from <italic>Y </italic>to the root of the species tree. Theoretically, this indicates that two nodes that do not co-exist in time, <italic>X </italic>and <italic>Y </italic>in this case, shared genetic material, and hence the warning of 'time violation.' However, this may be the case simply due to incomplete taxon sampling, as discussed in [##REF##17048405##19##]. Therefore, the warning is issued in this case so as to alert that user that this inferred HGT edge is worth further inspection.</p> <title>Assessing the support of HGT edges</title> <p>In [##UREF##15##37##] we proposed a method for assessing the support of HGT edges. Roughly speaking, the support value of HGT edge <italic>X </italic>→ <italic>Y </italic>in the species tree, where <italic>Y</italic>'is the sibling of <italic>Y</italic>, is derived from the bootstrap values of the gene tree branches that separate the clade under <italic>Y </italic>from the clade under <italic>Y</italic>'. The rationale behind the idea is that if <italic>Y</italic>' and <italic>Y </italic>are well separated in the gene trees (i.e., some branches in the path from <italic>Y </italic>to <italic>Y</italic>' have high bootstrap values), HGT is necessary to move <italic>Y </italic>away from <italic>Y</italic>'). For example, the support of HGT edge <italic>X </italic>→ <italic>Y </italic>in Figure ##FIG##7##8(a)## is calculated based on the bootstrap values of the branches separating <italic>B </italic>from <italic>A </italic>in the gene tree, and it is 80 (which is the maximum bootstrap value of all edges on the path separating <italic>A </italic>and <italic>B </italic>in the gene tree). More technical details can be found in [##UREF##15##37##].</p> <p>Than <italic>et al</italic>. [##UREF##15##37##] have studied the reliability of this method for assessing the support of HGT edges on various data sets from [##REF##15598737##38##]. In this paper, we illustrate the output of RIATA-HGT on a pair of species/gene trees from [##REF##15598737##38##], as shown in Figure ##FIG##8##9##. The output of RIATA-HGT on this pair of trees is shown in Figure ##FIG##9##10##. RIATA-HGT computed four solutions, each of which has nine HGT edges. To allow for a compact representation of the solutions, they are divided into two components (which are computed automatically by RIATA-HGT), and each solution is formed by taking one subsolution from each component. HGT edges for the solutions are divided into two components, which means that a complete solution is formed by taking one solution from each component. Each component is labeled by the name of the internal node that is the root of the clade corresponding to that component. In the case of the solutions presented in Figure ##FIG##9##10##, each solution contains nine HGT edges, eight of which form a single subsolution in Component I18 and the ninth is the only edge in the only subsolution in Component I8. The value in parentheses next to each HGT edge is its support value computed from the bootstrap values of the gene tree branches (Figure ##FIG##8##9(b)##). Bergthorsson <italic>et. al</italic>. [##REF##15598737##38##] reported three HGTs involving <italic>Amborella</italic>: one HGT with donor being a species in the <italic>Moss </italic>group (species <italic>Brachythecium</italic>, <italic>Hypnum</italic>, and <italic>Thuidium</italic>, under the internal node I14 in the species tree) and the other two with donors being species in the <italic>Eudicot </italic>group (species <italic>Arabidopsis</italic>, <italic>Beta</italic>, <italic>Brassica</italic>, <italic>Daucus</italic>, <italic>Petunia</italic>, and <italic>Oenothera</italic>, under the internal node I5 in the species tree). The HGT from <italic>Moss </italic>has high SH support value [##UREF##16##39##]. RIATA-HGT finds this event, I14 → <italic>Amborella_H_M</italic>, with bootstrap value 98.0%. The other two HGT events from <italic>Eudicot </italic>do not have significant SH support values. RIATA-HGT also finds these events, I5 → <italic>Amborella_H_E1 </italic>and I2 → <italic>Amborella_H_E2</italic>. However, their support values are 73.0%, much smaller than that of the event from <italic>Moss</italic>. In addition to these three HGT edges, RIATA-HGT identified six more edges, four out of which had support values smaller than 50.0% (RIATA-HGT does not display support values that are smaller than 50.0%). The HGT edge from Component I8, which is shared among all four solutions, has support value of 100.0%. This edge was not reported in [##REF##15598737##38##]. A similar situation arises with the HGT edge I5 → I8, which is part of the three solutions that contain subsolutions 1, 3, and 4 from Component I18: the HGT edge has support of 100.0%, and was not reported in [##REF##15598737##38##], which may be a reflection that the authors focused only on HGT events involving <italic>Amborella</italic>. The ninth HGT edge in Subsolution2 of Component I18 has support value smaller than 50.0%.</p> <title>Other utilities</title> <p>As evident from the description of the methods above, there are fundamental correlations between phylogenetic trees and networks. Hence, many of the evolutionary network utilities use functionalities from the phylogenetic trees domain, which we have implemented and provide as standalone tools in PhyloNet:</p> <p>• A tool for computing the maximum agreement subtree (MAST) of a pair of trees using the algorithm of Steel and Warnow [##UREF##13##35##]. We also extended the algorithm so that it computes <italic>all </italic>MASTs of a pair of tree, and this feature is implemented as well.</p> <p>• A tool for computing the Robinson-Foulds distance measure between two phylogenetic trees [##UREF##7##27##].</p> <p>• A tool for computing the <italic>last common ancestor </italic>(lca) of a set of nodes in a phylogenetic tree.</p> <p>Additionally, PhyloNet provides an implementation of the parsimony-based method RECOMP of Ruths and Nakhleh [##REF##18048130##40##,##UREF##17##41##] for detecting interspecific recombination in a sequence alignment.</p>
<title>Conclusion</title> <p>Analyzing and understanding reticulate evolutionary relationships have been hindered by the lack of software tools for conducting these tasks. The proposed software package, PhyloNet, offers an array of utilities to allow for efficient and accurate analysis of such evolutionary relationships. These utilities allow for representing networks in a compact way, characterizing networks in terms of basic building blocks and comparing them based on these characterizations, comparing networks in terms of their fitness to the evolution of a given data set of sequences under the maximum parsimony model, and reconstructing networks from species/gene trees.</p> <p>The software package will help significantly in analyzing large data sets, as well as in studying the performance of evolutionary network reconstruction methods. Further, the software package offers the novel eNewick format for compact representation of evolutionary networks, a feature that allows for efficient interoperability of evolutionary network software tools.</p>
<p>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/2.0"/>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p> <title>Background</title> <p>Phylogenies, i.e., the evolutionary histories of groups of taxa, play a major role in representing the interrelationships among biological entities. Many software tools for reconstructing and evaluating such phylogenies have been proposed, almost all of which assume the underlying evolutionary history to be a tree. While trees give a satisfactory first-order approximation for many families of organisms, other families exhibit evolutionary mechanisms that cannot be represented by trees. Processes such as horizontal gene transfer (HGT), hybrid speciation, and interspecific recombination, collectively referred to as <italic>reticulate evolutionary events</italic>, result in <italic>networks</italic>, rather than trees, of relationships. Various software tools have been recently developed to analyze reticulate evolutionary relationships, which include SplitsTree4, LatTrans, EEEP, HorizStory, and T-REX.</p> <title>Results</title> <p>In this paper, we report on the PhyloNet software package, which is a suite of tools for analyzing reticulate evolutionary relationships, or <italic>evolutionary networks</italic>, which are rooted, directed, acyclic graphs, leaf-labeled by a set of taxa. These tools can be classified into four categories: (1) evolutionary network representation: reading/writing evolutionary networks in a newly devised compact form; (2) evolutionary network characterization: analyzing evolutionary networks in terms of three basic building blocks – trees, clusters, and tripartitions; (3) evolutionary network comparison: comparing two evolutionary networks in terms of topological dissimilarities, as well as fitness to sequence evolution under a maximum parsimony criterion; and (4) evolutionary network reconstruction: reconstructing an evolutionary network from a species tree and a set of gene trees.</p> <title>Conclusion</title> <p>The software package, PhyloNet, offers an array of utilities to allow for efficient and accurate analysis of evolutionary networks. The software package will help significantly in analyzing large data sets, as well as in studying the performance of evolutionary network reconstruction methods. Further, the software package supports the proposed eNewick format for compact representation of evolutionary networks, a feature that allows for efficient interoperability of evolutionary network software tools. Currently, all utilities in PhyloNet are invoked on the command line.</p>
<title>Implementation</title> <p>A major goal for the PhyloNet package was to make its functionality platform-independent and accessible both to end users for data analysis and to researchers designing new computational methods and techniques. In order to encompass as many platforms as possible, PhyloNet was implemented in Java. As a result, any system with the Java 2 Platform (Version 5.0 or higher) installed can run PhyloNet.</p> <p>PhyloNet can be used in two ways, depending on how the functionality needs to be accessed. A command-line interface exposes all of PhyloNet's tools on a Unix or DOS command-line. Each command accepts input from and writes output to text files. This allows PhyloNet's functionality to be used for manual data analysis or integrated into scripts for performing larger-scale processing. Additionally, a rich and thoroughly documented object model allows the incorporation of any of PhyloNet's functionality into existing Java programs. Also bundled are various programmatic utilities that represent trees, networks, and that read and write these various data structures to and from files.</p> <title>The command line interface</title> <p>PhyloNet has a consistent and easy-to-use command line interface. A detailed discussion of this interface and all available options is available in the documentation that accompanies a download of the tool. Here we provide a brief overview of the design of the command-line tool and the tools that can be accessed. Table ##TAB##2##3## lists all the commands that are currently available from the command-line. Each of these commands accepts a set of parameters as command-line arguments. All trees, networks, sequences, and other major data structures are read in either from standard in or from text files. Similarly all results can be written either to standard out or to a desired text file. All trees are read and written in Newick format. Networks are read and written in eNewick format. These design features allow the easy use of PhyloNet for manual data analysis or as a tool used within a larger scripted automated analysis.</p> <p>With the exception of the RECOMP tool, all the functionality of PhyloNet is independent of other third party tools. Because RECOMP must compute many trees using Maximum Parsimony trees, this tool requires that PAUP* [##UREF##18##42##] be installed on the local system. To run a tool in PhyloNet, invoke the executable <italic>.jar </italic>file downloaded from the PhyloNet project homepage:</p> <p>java -jar phylonet.jar charnet -i net.in -m tree</p> <p>Here phylonet.jar is the executable jar downloaded from the project homepage (the fle is assumed to be in the current directory where the user invokes this command), charnet is the name of the tool that decomposes the network contained in file net.in into a set of trees. The reference manual included with the executable jar provides very detailed instructions regarding how to run each tool in the PhyloNet package.</p> <title>Programmatic interface</title> <p>Many phylogenetic methods comprise critical, but intermediate, steps in much larger methods. As a result, there is also a need for the functionality in PhyloNet to be available for incorporation into larger programs. As a result, all of PhyloNet's functionality is exposed through an extensive set of Java classes. Each tool is contained within its own Java class and exposes a carefully constructed set of public methods that will be preserved and maintained even as PhyloNet grows. This modular design allows for the easy addition functionality in the future without effecting existing programs that use PhyloNet as a programmatic library. In addition to exposing a consistent API, PhyloNet also provides implementations of the most common phylogenetic data structures: trees and networks. Utility classes are also included that read and write these data structures to and from files. These classes can accelerate not only incorporation of PhyloNet's functionality, but also the development of new phylogenetic functionality within other applications. As PhyloNet grows, programmatic interfaces will be added to provide access to new functionality and tools. Detailed documentation of these libraries is available in JavaDoc form on the PhyloNet website.</p> <title>Availability and requirements</title> <p>1. <bold>Project name: </bold>PhyloNet | Phylogenetic Networks Toolkit.</p> <p>2. <bold>Project home page: </bold><ext-link ext-link-type="uri" xlink:href="http://bioinfo.cs.rice.edu/phylonet/index.html"/>.</p> <p>3. <bold>Operating system: </bold>Platform independent.</p> <p>4. <bold>Programming language: </bold>Java.</p> <p>5. <bold>Other requirements: </bold>Java 1.5, PAUP* (for some applications).</p> <p>6. <bold>License: </bold>GNU GPL.</p> <p>7. <bold>Any restrictions to use by non-academics: </bold>The GNU GPL license applies.</p> <title>Authors' contributions</title> <p>All authors contributed equally to the work described in this manuscript.</p>
<title>Acknowledgements</title> <p>The authors would like to acknowledge the very helpful comments from three anonymous reviewers which helped improve the manuscript, as well as the software tool, significantly. This work is supported in part by the Department of Energy grant DE-FG02-06ER25734, the National Science Foundation grant CCF-0622037, the George R. Brown School of Engineering Roy E. Campbell Faculty Development Award, and the Department of Computer Science at Rice University.</p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p><bold>Evolutionary networks and gene trees</bold>. Gene trees <italic>T </italic>and <italic>T</italic>' within species networks <italic>N</italic>. (a) The gene whose tree is depicted with a dashed line is transferred from the genome of species <italic>C </italic>to that of species <italic>B</italic>. (b) Species <italic>B </italic>and <italic>C </italic>exchanged the two genes whose trees are <italic>T </italic>and <italic>T</italic>'. (c) Species <italic>B </italic>is a hybrid whose two parents are species <italic>A </italic>and <italic>C</italic>; each gene in the genome of species <italic>B </italic>has an evolutionary tree that is either <italic>T </italic>or <italic>T</italic>'.</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p><bold>Sample evolutionary networks</bold>. Two evolutionary networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2</sub>, each with eight leaves (labeled <italic>A</italic>,..., <italic>H</italic>) and two network nodes <italic>X </italic>and <italic>Y</italic>. Shown are the orientation of the network edges; all other edges are directed away from the root (toward the leaves) Notice that the difference between the two networks is that node <italic>X </italic>in <italic>N</italic><sub>1 </sub>has lineage <italic>G </italic>as one of its parents, whereas node <italic>X </italic>in <italic>N</italic><sub>2 </sub>has lineage <italic>H </italic>as one of its parents.</p></caption></fig> <fig position="float" id="F3"><label>Figure 3</label><caption><p><bold>A modified Newick format</bold>. Three trees, <italic>N</italic>', <italic>X</italic>, and <italic>Y</italic>, along with their Newick representation. These three trees form the tree decomposition  of the evolutionary network <italic>N</italic><sub>1 </sub>in Figure 2. The eNewick representation of <italic>N </italic>is the triplet ⟨<italic>N</italic>'; <italic>X</italic>; <italic>Y</italic>⟩.</p></caption></fig> <fig position="float" id="F4"><label>Figure 4</label><caption><p><bold>The eNewick format</bold>. A modified Newick format for representing evolutionary networks. The figure is taken from the paper by Morin <italic>et. al</italic>. [##REF##16717070##22##].</p></caption></fig> <fig position="float" id="F5"><label>Figure 5</label><caption><p><bold>Trees within networks</bold>. The sets  and  of all eight trees induced by the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2</sub>, respectively, in Figure 2.</p></caption></fig> <fig position="float" id="F6"><label>Figure 6</label><caption><p><bold>Tree-based comparison of networks</bold>. Illustration of the tree-based network comparison measure. (a) The weighted bipartite graph <italic>G </italic>that is constructed from the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure 2. On the left are four nodes that correspond to the four trees in (<italic>N</italic><sub>1</sub>) and on the right are four nodes that correspond to the four trees in (<italic>N</italic><sub>2</sub>). The weight of an edge between  and  is the values of the Robinson-Foulds (RF) distance between the two trees, which is computed as the number of clusters present in one but not both of the trees, divided by 2. (b) The edges that comprise the minimum-weight edge cover of the bipartite graph <italic>G</italic>. The weight of this cover is 2, which is the sum of the weights of the edges in the cover; therefore, <italic>m</italic><sup><italic>tree</italic></sup>(<italic>N</italic><sub>1</sub>, <italic>N</italic><sub>2</sub>) = 2.</p></caption></fig> <fig position="float" id="F7"><label>Figure 7</label><caption><p><bold>Screenshot of the graphical output of RIATA-HGT</bold>. (a) Screen captures of the graphical output of RIATA-HGT on the pair of trees (((<italic>a</italic>, <italic>b</italic>), <italic>c</italic>), (<italic>d</italic>, (<italic>e</italic>, <italic>f</italic>))) and (((<italic>a</italic>, <italic>c</italic>), <italic>b</italic>), ((<italic>d</italic>, <italic>f</italic>), <italic>e</italic>)). (b) The eNewick representations of the two selected networks.</p></caption></fig> <fig position="float" id="F8"><label>Figure 8</label><caption><p><bold>An illustration of computing the support value of an HGT edge</bold>. An illustration of computing the support value of an HGT edge. In this case, the support of HGT edge <italic>X </italic>→ <italic>Y </italic>added on the species tree (a), is calculated based on the bootstrap of the branches that separate <italic>Y </italic>(or <italic>B</italic>) from <italic>A </italic>in the gene tree (b). The value for the event <italic>X </italic>→ <italic>Y </italic>is 80.</p></caption></fig> <fig position="float" id="F9"><label>Figure 9</label><caption><p><bold>The cox2 trees</bold>. The species tree (a): (((Pallavicinia, (Porella, Trichocolea)I15)I16, Marchantia)I17, (Thuidium, Brachythecium, Hypnum)I14, (((Amborella_V, Amborella_H_M, Amborella_H_E1, Amborella_H_E2)I9, ((Eichhornia, (Zea, Oryza)I6)I7, Philodendron, Agave)I8, ((Daucus, Petunia)I4, Beta, (Oenothera, (Brassica, Arabidopsis)I2)I3)I5, ((Piper, Asarum)I10, (Liriodendron, Laurus)I11)I1)I12, (Pinus, Zamia)I13)I0)I18; and gene tree (b): ((((((((Petunia, Amborella_H_E1, (((Arabidopsis, Brassica)I2:99.0, Amborella_H_E2), Oenothera, Daucus)), Beta):73.0, ((Agave, Eichhornia, Philodendron), (Oryza, Zea)I6:100.0)), (Asarum, Piper)I10), (Laurus, Liriodendron)I11), Amborella_V), (Pinus, Zamia)I13:72.0), (((Thuidium, Hypnum, Amborella_H_M):91.0, Brachythecium):98.0, (Marchantia, ((Porella, Trichocolea):97.0, Pallavicinia))I17)); for gene <italic>cox2</italic>. Bootstrap values for the branches in the gene tree that are greater than 50.0% are included in the tree Newick representation. The species tree branches do not have bootstrap values.</p></caption></fig> <fig position="float" id="F10"><label>Figure 10</label><caption><p><bold>An example of RIATA-HGT output</bold>. The output of RIATA-HGT on the species tree and <italic>cox2 </italic>gene tree in Figure 9. RIATA-HGT finds 4 solutions, summarized in terms of two components, so that each solution is the union of exactly one subsolution from each component.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>The clusters of the two networks in Figure 2.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Network <italic>N</italic><sub>1</sub></td><td align="left">Network <italic>N</italic><sub>2</sub></td></tr></thead><tbody><tr><td align="left">{<italic>B</italic>, <italic>C</italic>}</td><td align="left">{<italic>B</italic>, <italic>C</italic>}</td></tr><tr><td align="left">{<italic>C</italic>, <italic>D</italic>}</td><td align="left">{<italic>C</italic>, <italic>D</italic>}</td></tr><tr><td align="left">{<italic>B</italic>, <italic>C</italic>, <italic>D</italic>}</td><td align="left">{<italic>B</italic>, <italic>C</italic>, <italic>D</italic>}</td></tr><tr><td align="left">{<italic>D</italic>, <italic>E</italic>}</td><td align="left">{<italic>D</italic>, <italic>E</italic>}</td></tr><tr><td align="left">{<italic>E</italic>, <italic>F</italic>}</td><td align="left">{<italic>E</italic>, <italic>F</italic>}</td></tr><tr><td align="left">{<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}</td><td align="left">{<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}</td></tr><tr><td align="left">{<italic>B</italic>, <italic>C</italic>, <italic>D</italic>, <italic>E</italic>, <italic>F</italic>}</td><td align="left">{<italic>B</italic>, <italic>C</italic>, <italic>D</italic>, <italic>E</italic>, <italic>F</italic>}</td></tr><tr><td align="left">{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>}</td><td align="left">{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>}</td></tr><tr><td align="left">{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>D</italic>}</td><td align="left">{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>D</italic>}</td></tr><tr><td align="left">{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>D</italic>, <italic>E</italic>, <italic>F</italic>}</td><td align="left">{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>D</italic>, <italic>E</italic>, <italic>F</italic>}</td></tr><tr><td align="left">{<bold>E</bold>, <bold>F</bold>, <bold>G</bold>}</td><td align="left">{<bold>E</bold>, <bold>F</bold>, <bold>H</bold>}</td></tr><tr><td align="left">{<bold>D</bold>, <bold>E</bold>, <bold>F</bold>, <bold>G</bold>}</td><td align="left">{<bold>D</bold>, <bold>E</bold>, <bold>F</bold>, <bold>H</bold>}</td></tr><tr><td align="left">{<italic>G</italic>, <italic>H</italic>}</td><td align="left">{<italic>G</italic>, <italic>H</italic>}</td></tr><tr><td align="left">{<italic>D</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}</td><td align="left">{<italic>D</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T2"><label>Table 2</label><caption><p>The tripartitions of the two networks in Figure 2.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Edge Label</td><td align="left">Network <italic>N</italic><sub>1</sub></td><td align="left">Network <italic>N</italic><sub>2</sub></td></tr></thead><tbody><tr><td align="left">1</td><td align="left">⟨{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>}, {<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}, {<italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>A</italic>, <italic>B</italic>, <italic>C</italic>}, {<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}, {<italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">2</td><td align="left">⟨{<italic>G</italic>, <italic>H</italic>}, {<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>}⟩</td><td align="left">⟨{<italic>G</italic>, <italic>H</italic>}, {<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>}⟩</td></tr><tr><td align="left">3</td><td align="left">⟨{<italic>B</italic>, <italic>C</italic>}, {<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}, {<italic>A</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>B</italic>, <italic>C</italic>}, {<italic>D</italic>, <italic>E</italic>, <italic>F</italic>}, {<italic>A</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left"><bold>4</bold></td><td align="left">⟨{<bold>G</bold>}, {<bold>D</bold>, <bold>E</bold>, <bold>F</bold>}, {<bold>A</bold>, <bold>B</bold>, <bold>C</bold>, <bold>H</bold>}⟩</td><td align="left">⟨{<bold>H</bold>}, {<bold>D</bold>, <bold>E</bold>, <bold>F</bold>}, {<bold>A</bold>, <bold>B</bold>, <bold>C</bold>, <bold>G</bold>}⟩</td></tr><tr><td align="left">5</td><td align="left">⟨{<italic>B</italic>, <italic>C</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>B</italic>, <italic>C</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">6</td><td align="left">⟨{<italic>C</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>C</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">7</td><td align="left">⟨{<italic>E</italic>, <italic>F</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>E</italic>, <italic>F</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">8</td><td align="left">⟨{<italic>E</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>E</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">9</td><td align="left">⟨{<italic>D</italic>}, {}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>D</italic>}, {}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">10</td><td align="left">⟨{<italic>D</italic>}, {}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>D</italic>}, {}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>E</italic>, <italic>F</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">11</td><td align="left">⟨{<italic>E</italic>, <italic>F</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>E</italic>, <italic>F</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr><tr><td align="left">12</td><td align="left">⟨{<italic>E</italic>, <italic>F</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td><td align="left">⟨{<italic>E</italic>, <italic>F</italic>}, {<italic>D</italic>}, {<italic>A</italic>, <italic>B</italic>, <italic>C</italic>, <italic>G</italic>, <italic>H</italic>}⟩</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T3"><label>Table 3</label><caption><p>List of tools and their description.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left"><bold>Tool name</bold></td><td align="left"><bold>Purpose</bold></td></tr></thead><tbody><tr><td align="left">charnet</td><td align="left">Computing clusters, trees and tripartitions in a network</td></tr><tr><td align="left">cmpnets</td><td align="left">Computing the distance between two networks</td></tr><tr><td align="left">lca</td><td align="left">Finding the last common ancestor of a set of nodes</td></tr><tr><td align="left">mast</td><td align="left">Computing the maximum agreement subtree</td></tr><tr><td align="left">netpars</td><td align="left">Scoring the parsimony of sequences on a pair of networks</td></tr><tr><td align="left">riatahgt</td><td align="left">Reconstructing HGT events from a pair of species/gene trees</td></tr><tr><td align="left">rf</td><td align="left">Computing the Robinson-Foulds tree measure</td></tr></tbody></table></table-wrap>
<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="1471-2105-9-322-i1" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>u</mml:mi><mml:mo>⇝</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="1471-2105-9-322-i2" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>u</mml:mi><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>v</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="1471-2105-9-322-i3" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>u</mml:mi><mml:mo>/</mml:mo><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>v</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="1471-2105-9-322-i4" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>u</mml:mi><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>v</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="1471-2105-9-322-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>D</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6" name="1471-2105-9-322-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>/</mml:mo><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>E</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M7" name="1471-2105-9-322-i7" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mover accent="true"><mml:mi>X</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>D</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M8" name="1471-2105-9-322-i8" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M9" name="1471-2105-9-322-i8" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M10" name="1471-2105-9-322-i9" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mo>∪</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>ℓ</mml:mi></mml:msubsup><mml:mi>L</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>L</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M11" name="1471-2105-9-322-i8" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M12" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M13" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M14" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M15" name="1471-2105-9-322-i11" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>m</mml:mi><mml:mo>≤</mml:mo><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo>∏</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>ℓ</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>ρ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M16" name="1471-2105-9-322-i12" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>{</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>1</mml:mn><mml:mn>1</mml:mn></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>1</mml:mn><mml:mn>3</mml:mn></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>1</mml:mn><mml:mn>4</mml:mn></mml:msubsup><mml:mo>}</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M17" name="1471-2105-9-322-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>{</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>2</mml:mn><mml:mn>1</mml:mn></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>2</mml:mn><mml:mn>2</mml:mn></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>2</mml:mn><mml:mn>3</mml:mn></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mn>2</mml:mn><mml:mn>4</mml:mn></mml:msubsup><mml:mo>}</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M18" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M19" name="1471-2105-9-322-i14" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>{</mml:mo><mml:mi>x</mml:mi><mml:mo>∈</mml:mo><mml:mi>χ</mml:mi><mml:mo>:</mml:mo><mml:mi>r</mml:mi><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>x</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M20" name="1471-2105-9-322-i15" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">C</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M21" name="1471-2105-9-322-i16" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">C</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mo>∪</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>∈</mml:mo><mml:mi mathvariant="script">T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mi mathvariant="script">C</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M22" name="1471-2105-9-322-i15" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">C</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M23" name="1471-2105-9-322-i15" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">C</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M24" name="1471-2105-9-322-i17" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>w</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:mo>{</mml:mo><mml:mi>T</mml:mi><mml:mo>∈</mml:mo><mml:mi mathvariant="script">T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>:</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mi mathvariant="script">C</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>}</mml:mo><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi mathvariant="script">T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mo>.</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M25" name="1471-2105-9-322-i14" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>{</mml:mo><mml:mi>x</mml:mi><mml:mo>∈</mml:mo><mml:mi>χ</mml:mi><mml:mo>:</mml:mo><mml:mi>r</mml:mi><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>x</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M26" name="1471-2105-9-322-i18" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>{</mml:mo><mml:mi>x</mml:mi><mml:mo>∈</mml:mo><mml:mi>χ</mml:mi><mml:mo>:</mml:mo><mml:mi>r</mml:mi><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mover accent="true"><mml:mi>v</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>x</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M27" name="1471-2105-9-322-i19" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>{</mml:mo><mml:mi>x</mml:mi><mml:mo>∈</mml:mo><mml:mi>χ</mml:mi><mml:mo>:</mml:mo><mml:mi>r</mml:mi><mml:mo>/</mml:mo><mml:msup><mml:mo>⇝</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup><mml:mi>x</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M28" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M29" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M30" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M31" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M32" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M33" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M34" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M35" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M36" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M37" name="1471-2105-9-322-i20" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>T</mml:mi><mml:mn>1</mml:mn><mml:mi>i</mml:mi></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M38" name="1471-2105-9-322-i21" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>T</mml:mi><mml:mn>2</mml:mn><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M39" name="1471-2105-9-322-i15" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">C</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M40" name="1471-2105-9-322-i15" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">C</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M41" name="1471-2105-9-322-i22" overflow="scroll"><mml:semantics><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mn>2.</mml:mn></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M42" name="1471-2105-9-322-i15" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">C</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M43" name="1471-2105-9-322-i15" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">C</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M44" name="1471-2105-9-322-i23" overflow="scroll"><mml:semantics><mml:mrow><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mn>2.</mml:mn></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M45" name="1471-2105-9-322-i24" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>N</mml:mi><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>:</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:msub><mml:mo>∑</mml:mo><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mi>min</mml:mi><mml:mo>⁡</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>∈</mml:mo><mml:mi mathvariant="script">T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mi>T</mml:mi><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M46" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M47" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M48" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M49" name="1471-2105-9-322-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">T</mml:mi></mml:semantics></mml:math></inline-formula>
<table-wrap-foot><p>A table of the (nontrivial) clusters of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure 2, denoted by (<italic>N</italic><sub>1</sub>) and (<italic>N</italic><sub>2</sub>), respectively, in the text. Highlighted are rows corresponding to clusters that differ between the two networks.</p></table-wrap-foot> <table-wrap-foot><p>A table of the (nontrivial) tripartitions of the two networks <italic>N</italic><sub>1 </sub>and <italic>N</italic><sub>2 </sub>in Figure 2, denoted by <italic>θ</italic>(<italic>N</italic><sub>1</sub>) and <italic>θ</italic>(<italic>N</italic><sub>2</sub>), respectively, in the text. Highlighted are rows corresponding to tripartitions that differ between the two networks.</p></table-wrap-foot> <table-wrap-foot><p>A table of the tools currently implemented in PhyloNet. With the exception of the three phylogenetic trees tools lca, mast, and rf, all the other tools are for analyzing reticulate evolutionary relationships.</p></table-wrap-foot>
<graphic xlink:href="1471-2105-9-322-1"/> <graphic xlink:href="1471-2105-9-322-2"/> <graphic xlink:href="1471-2105-9-322-3"/> <graphic xlink:href="1471-2105-9-322-4"/> <graphic xlink:href="1471-2105-9-322-5"/> <graphic xlink:href="1471-2105-9-322-6"/> <graphic xlink:href="1471-2105-9-322-7"/> <graphic xlink:href="1471-2105-9-322-8"/> <graphic xlink:href="1471-2105-9-322-9"/> <graphic xlink:href="1471-2105-9-322-10"/>
[{"surname": ["Hallett", "Lagergren"], "given-names": ["M", "J"], "article-title": ["Efficient algorithms for lateral gene transfer problems"], "source": ["Proc 5th Ann Int'l Conf Comput Mol Biol (RECOMB01)"], "year": ["2001"], "publisher-name": ["New York: ACM Press"], "fpage": ["149"], "lpage": ["156"]}, {"surname": ["Nakhleh", "Ruths", "Wang", "Wang L"], "given-names": ["L", "D", "L"], "article-title": ["RIATA-HGT: A Fast and accurate heuristic for reconstrucing horizontal gene transfer"], "source": ["Proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON 05)"], "year": ["2005"], "fpage": ["84"], "lpage": ["93"], "comment": ["[LNCS #3595]"]}, {"surname": ["Than", "Nakhleh"], "given-names": ["C", "L"], "article-title": ["SPR-based tree reconciliation: Non-binary trees and multiple solutions"], "source": ["Proceedings of the Sixth Asia Pacific Bioinformatics Conference (APBC)"], "year": ["2008"], "fpage": ["251"], "lpage": ["260"]}, {"surname": ["Baroni", "Semple", "Steel"], "given-names": ["M", "C", "M"], "article-title": ["A framework for representing reticulate evolution"], "source": ["Annals of Combinatorics"], "year": ["2004"], "volume": ["8"], "fpage": ["391"], "lpage": ["408"]}, {"surname": ["Bryant", "Moulton"], "given-names": ["D", "V"], "article-title": ["NeighborNet: An agglomerative method for the construction of planar phylogenetic networks"], "source": ["Proc 2nd Int'l Workshop Algorithms in Bioinformatics (WABI02), Volume 2452 of Lecture Notes in Computer Science, Springer-Verlag"], "year": ["2002"], "fpage": ["375"], "lpage": ["391"]}, {"surname": ["Felsenstein"], "given-names": ["J"], "source": ["Inferring Phylogenies"], "year": ["2003"], "publisher-name": ["Sunderland, MA: Sinauer Associates, Inc"]}, {"surname": ["Semple", "Steel"], "given-names": ["C", "M"], "source": ["Phylogenetics"], "year": ["2003"], "publisher-name": ["Oxford Lecture Series in Mathematics and its Applications 24, Oxford University Press"]}, {"surname": ["Robinson", "Foulds"], "given-names": ["D", "L"], "article-title": ["Comparison of phylogenetic trees"], "source": ["Math Biosciences"], "year": ["1981"], "volume": ["53"], "fpage": ["131"], "lpage": ["147"]}, {"surname": ["Nakhleh", "Sun", "Warnow", "Linder", "Moret", "Tholse"], "given-names": ["L", "J", "T", "R", "B", "A"], "article-title": ["Towards the development of computational tools for evaluating phylogenetic network reconstruction methods"], "source": ["Proc 8th Pacific Symp on Biocomputing (PSB03), World Scientific Pub"], "year": ["2003"], "fpage": ["315"], "lpage": ["326"]}, {"surname": ["Nakhleh", "Warnow", "Linder"], "given-names": ["L", "T", "C"], "article-title": ["Reconstructing reticulate evolution in species-theory and practice"], "source": ["Proc 8th Ann Int'l Conf Comput Mol Biol (RECOMB04)"], "year": ["2004"], "fpage": ["337"], "lpage": ["346"]}, {"surname": ["Penny", "Hendy"], "given-names": ["D", "MD"], "article-title": ["The use of tree comparison metrics"], "source": ["Systematic Zoology"], "year": ["1985"], "volume": ["34"], "fpage": ["75"], "lpage": ["82"]}, {"surname": ["Kanj", "Nakhleh", "Than", "Xia"], "given-names": ["I", "L", "C", "G"], "article-title": ["Seeing the trees and their branches in the network in hard"], "source": ["Theoretical Computer Science"], "year": ["2008"], "volume": ["401"], "fpage": ["153"], "lpage": ["164"]}, {"surname": ["Bordewich", "Semple"], "given-names": ["M", "C"], "article-title": ["On the computational complexity of the rooted subtree prune and regraft distance"], "source": ["Annals of Combinatorics"], "year": ["2005"], "volume": ["8"], "fpage": ["409"], "lpage": ["423"]}, {"surname": ["Steel", "Warnow"], "given-names": ["M", "T"], "article-title": ["Kaikoura tree theorems: computing the maximum agreement subtree"], "source": ["Information Processing Letters"], "year": ["1993"], "volume": ["48"], "fpage": ["77"], "lpage": ["82"]}, {"surname": ["Ruths", "Nakhleh"], "given-names": ["D", "L"], "article-title": ["Techniques for Assessing Phylogenetic Branch Support: A Performance Study"], "source": ["Proceedings of the 4th Asia Pacific Bioinformatics Conference"], "year": ["2006"], "fpage": ["187"], "lpage": ["196"]}, {"surname": ["Than", "Jin", "Nakhleh"], "given-names": ["C", "G", "L"], "article-title": ["Integrating sequence and topology for efficient and accurate detection of horizontal gene transfer"], "source": ["Proceedings of the Sixth RECOM Comparative Genomics Satellite Workshop"], "year": ["2008"]}, {"surname": ["Shimodaira", "Hasegawa"], "given-names": ["H", "M"], "article-title": ["Multiple comparisons of log-likelihoods with applications to phylogenetic inference"], "source": ["Molecular Biology and Evolution"], "year": ["1999"], "volume": ["16"], "fpage": ["1114"], "lpage": ["1116"]}, {"surname": ["Ruths", "Nakhleh"], "given-names": ["D", "L"], "article-title": ["RECOMP: A Parsimony-based Method for Detecting Recombination"], "source": ["Proceedings of the 4th Asia Pacific Bioinformatics Conference"], "year": ["2006"], "fpage": ["59"], "lpage": ["68"]}, {"surname": ["Swofford"], "given-names": ["DL"], "article-title": ["PAUP*: Phylogenetic Analysis Using Parsimony (and Other Methods)"], "source": ["Version 40"], "year": ["1996"], "publisher-name": ["Sinauer Associates, Underland, Massachusetts"]}]
BMC Bioinformatics. 2008 Jul 28; 9:322