Phylogenetic Constraints Do Not Explain the Rarity of Nitrogen-Fixing Trees in Late-Successional Temperate Forests

Background

Symbiotic nitrogen (N)-fixing trees are rare in late-successional temperate forests, even though these forests are often N limited. Two hypotheses could explain this paradox. The ‘phylogenetic constraints hypothesis’ states that no late-successional tree taxa in temperate forests belong to clades that are predisposed to N fixation. Conversely, the ‘selective constraints hypothesis’ states that such taxa are present, but N-fixing symbioses would lower their fitness. Here we test the phylogenetic constraints hypothesis.

Methodology/Principal Findings

Using U.S. forest inventory data, we derived successional indices related to shade tolerance and stand age for N-fixing trees, non-fixing trees in the ‘potentially N-fixing clade’ (smallest angiosperm clade that includes all N fixers), and non-fixing trees outside this clade. We then used phylogenetically independent contrasts (PICs) to test for associations between these successional indices and N fixation. Four results stand out from our analysis of U.S. trees. First, N fixers are less shade-tolerant than non-fixers both inside and outside of the potentially N-fixing clade. Second, N fixers tend to occur in younger stands in a given geographical region than non-fixers both inside and outside of the potentially N-fixing clade. Third, the potentially N-fixing clade contains numerous late-successional non-fixers. Fourth, although the N fixation trait is evolutionarily conserved, the successional traits are relatively labile.

Conclusions/Significance

These results suggest that selective constraints, not phylogenetic constraints, explain the rarity of late-successional N-fixing trees in temperate forests. Because N-fixing trees could overcome N limitation to net primary production if they were abundant, this study helps to understand the maintenance of N limitation in temperate forests, and therefore the capacity of this biome to sequester carbon.     

Uprooted Phylogenetic Networks

The need for structures capable of accommodating complex evolutionary signals such as those found in, for example, wheat has fueled research into phylogenetic networks. Such structures generalize the standard model of a phylogenetic tree by also allowing for cycles and have been introduced in rooted and unrooted form. In contrast to phylogenetic trees or their unrooted versions, rooted phylogenetic networks are notoriously difficult to understand. To help alleviate this, recent work on them has also centered on their “uprooted” versions. By focusing on such graphs and the combinatorial concept of a split system which underpins an unrooted phylogenetic network, we show that not only can a so-called (uprooted) 1-nested network N be obtained from the Buneman graph (sometimes also called a median network) associated with the split system \(\Sigma (N)\) induced on the set of leaves of N but also that that graph is, in a well-defined sense, optimal. Along the way, we establish the 1-nested analogue of the fundamental “splits equivalence theorem” for phylogenetic trees and characterize maximal circular split systems.     

Tree-Based Unrooted Phylogenetic Networks

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is X. It is called a phylogenetic tree if the underlying graph is a tree. In this paper we consider properties of tree-based networks, that is, networks that can be constructed by adding edges into a phylogenetic tree. We show that although they have some properties in common with their rooted analogues which have recently drawn much attention in the literature, they have some striking differences in terms of both their structural and computational properties. We expect that our results could eventually have applications to, for example, detecting horizontal gene transfer or hybridization which are important factors in the evolution of many organisms.     

Drawing Rooted Phylogenetic Networks

The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.     

Binets: Fundamental Building Blocks for Phylogenetic Networks

Phylogenetic networks are a generalization of evolutionary trees that are used by biologists to represent the evolution of organisms which have undergone reticulate evolution. Essentially, a phylogenetic network is a directed acyclic graph having a unique root in which the leaves are labelled by a given set of species. Recently, some approaches have been developed to construct phylogenetic networks from collections of networks on 2- and 3-leaved networks, which are known as binets and trinets, respectively. Here we study in more depth properties of collections of binets, one of the simplest possible types of networks into which a phylogenetic network can be decomposed. More specifically, we show that if a collection of level-1 binets is compatible with some binary network, then it is also compatible with a binary level-1 network. Our proofs are based on useful structural results concerning lowest stable ancestors in networks. In addition, we show that, although the binets do not determine the topology of the network, they do determine the number of reticulations in the network, which is one of its most important parameters. We also consider algorithmic questions concerning binets. We show that deciding whether an arbitrary set of binets is compatible with some network is at least as hard as the well-known graph isomorphism problem. However, if we restrict to level-1 binets, it is possible to decide in polynomial time whether there exists a binary network that displays all the binets. We also show that to find a network that displays a maximum number of the binets is NP-hard, but that there exists a simple polynomial-time 1/3-approximation algorithm for this problem. It is hoped that these results will eventually assist in the development of new methods for constructing phylogenetic networks from collections of smaller networks.     

Comparison of Tree-Child Phylogenetic Networks

Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of nontreelike evolutionary events, like recombination, hybridization, or lateral gene transfer. While much progress has been made to find practical algorithms for reconstructing a phylogenetic network from a set of sequences, all attempts to endorse a class of phylogenetic networks (strictly extending the class of phylogenetic trees) with a well-founded distance measure have, to the best of our knowledge and with the only exception of the bipartition distance on regular networks, failed so far. In this paper, we present and study a new meaningful class of phylogenetic networks, called tree-child phylogenetic networks, and we provide an injective representation of these networks as multisets of vectors of natural numbers, their path multiplicity vectors. We then use this representation to define a distance on this class that extends the well-known Robinson-Foulds distance for phylogenetic trees and to give an alignment method for pairs of networks in this class. Simple polynomial algorithms for reconstructing a tree-child phylogenetic network from its path multiplicity vectors, for computing the distance between two tree-child phylogenetic networks and for aligning a pair of tree-child phylogenetic networks, are provided. They have been implemented as a Perl package and a Java applet, which can be found at http://bioinfo.uib.es/~recerca/phylonetworks/mudistance/.     

Properties of Normal Phylogenetic Networks

A phylogenetic network is a rooted acyclic digraph with vertices corresponding to taxa. Let X denote a set of vertices containing the root, the leaves, and all vertices of outdegree 1. Regard X as the set of vertices on which measurements such as DNA can be made. A vertex is called normal if it has one parent, and hybrid if it has more than one parent. The network is called normal if it has no redundant arcs and also from every vertex there is a directed path to a member of X such that all vertices after the first are normal. This paper studies properties of normal networks. Under a simple model of inheritance that allows homoplasies only at hybrid vertices, there is essentially unique determination of the genomes at all vertices by the genomes at members of X if and only if the network is normal. This model is a limiting case of more standard models of inheritance when the substitution rate is sufficiently low. Various mathematical properties of normal networks are described. These properties include that the number of vertices grows at most quadratically with the number of leaves and that the number of hybrid vertices grows at most linearly with the number of leaves.     

Rare Genomic Characters Do Not Support Coelomata: RGC_CAMs

Recently there has been a lively debate about a new class of rare genomic characters, RGC_CAMs, and their implications for deep bilaterian phylogeny. Most recently, nine bilaterian species were analyzed along with subsets of six outgroups (Rogozin et al. 2007b), and support for a coelomate clade reported. The authors suggested that our previously reported support for an ecdysozoan clade (Irimia et al. 2007) reflected (i) one outgroup, Nematostella vectensis, being too closely related to bilaterians and (ii) lack of “rigorous statistical analysis.” Here, we report further studies of these characters. First, we discuss general issues of outgroup choice. Second, we point out that an argument used by Rogozin et al. against backmutation is not statistically significant. Third, we point out that the statistical method of Rogozin et al. fails to incorporate backmutations, leading to systematic placement of the long-branch taxon as the outgroup. A simple modification of the method yields very different results: 51 of 63 outgroup combinations favor Ecdysozoa, inlcuding 51 of 52 with at least eight phylogenetically informative characters, and all 19 with statistically significant signal. These results indicate that the Coelomata signal is a long-branch artifact.     

Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric

The assessment of phylogenetic network reconstruction methods requires the ability to compare phylogenetic networks. This is the first in a series of papers devoted to the analysis and comparison of metrics for tree-child time consistent phylogenetic networks on the same set of taxa. In this paper, we study three metrics that have already been introduced in the literature: the Robinson-Foulds distance, the tripartitions distance and the $mu$-distance. They generalize to networks the classical Robinson-Foulds or partition distance for phylogenetic trees. We analyze the behavior of these metrics by studying their least and largest values and when they achieve them. As a by-product of this study, we obtain tight bounds on the size of a tree-child time consistent phylogenetic network.     

What We Do Not Know About Differentiation

The outstanding recent advances in the analysis of differentiationare in concept and method. In this paper examples are providedto demonstrate that formulation of the problem of differentiationin terms of biosynthesis and its control poses questions innew and more manageable ways. As examples, reference will bemade to: (1) the question of control of the sets of specializedproperties by which we define a cell type; (2) propagabilityof differentiated states; (3) developmental bias in relationto intracellular events; and (4) the mechanisms of extrinsiccontrol of differentiation. Particular attention, also, willbe focused on the relationship of morphogenetic to biosyntheticevents.     

Moribund Ants Do Not Call for Help

When an antlion captures a foraging ant, the victim’s nestmates may display rescue behaviour. This study tested the hypothesis that the expression of rescue behaviour depends on the life expectancy of the captured ant. This hypothesis predicts that the expression of rescue behaviour will be less frequent when the captured ant has a lower life expectancy than when it has a higher life expectancy because such a response would be adaptive at the colony level. Indeed, significant differences were found in the frequency of rescue behaviours in response to antlion victims with differing life expectancies. In agreement with prediction, victims with lower life expectancies were rescued less frequently, and those rescues had a longer latency and shorter duration. There was also a qualitative difference in the behaviour of rescuers to victims from the low and high life expectancy groups. Several explanations for these findings are proposed.     

Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics

The assessment of phylogenetic network reconstruction methods requires the ability to compare phylogenetic networks. This is the second in a series of papers devoted to the analysis and comparison of metrics for tree-child time consistent phylogenetic networks on the same set of taxa. In this paper, we generalize to phylogenetic networks two metrics that have already been introduced in the literature for phylogenetic trees: the nodal distance and the triplets distance. We prove that they are metrics on any class of tree-child time consistent phylogenetic networks on the same set of taxa, as well as some basic properties for them. To prove these results, we introduce a reduction/expansion procedure that can be used not only to establish properties of tree-child time consistent phylogenetic networks by induction, but also to generate all tree-child time consistent phylogenetic networks with a given number of leaves.     

Isotopic Data Do Not Support Food Sharing Within Large Networks of Female Vampire Bats (Desmodus rotundus)

Reciprocal altruism is considered to be particularly stable when occurring in small networks. Using a stable isotope approach, we tested in colonies of vampire bats (Desmodus rotundus) whether food sharing occurs among few or many females; vampires are known to regurgitate recently ingested blood for starving conspecifics. Accordingly, the isotopic signatures of vampires depend not only on individual prey choice but also on the extent of food sharing among isotopically contrasting conspecifics. By measuring the stable carbon isotope ratio in tissues with varying isotopic retention in individual vampires (blood: approx. 2 wk; wing membrane tissue: approx. 2 mo; fur: >6 mo), we estimated the variation in the percentages of carbon derived from pasture (via blood from cattle and horses). We expected to find narrow ranges of percentages in individual vampires, because we anticipated food sharing only within small female networks if food sharing happened at all. Overall, vampire bats obtained 79.2 ± 12.3% of carbon from grazers. The range of percentages was small within the majority of individuals in relation to that across all individuals, suggesting that most vampires were isotopic specialists. We expected females to be more isotopically generalistic than males, as food sharing was observed to occur more often between females than between males. Indeed, stable isotope evidence suggested that more females obtained carbon from isotopically contrasting sources than males. This pattern is consistent with food sharing in small groups of female vampires, provided that food sharing occurred at all.     

Phylogenetic Networks that Display a Tree Twice

In the last decade, the use of phylogenetic networks to analyze the evolution of species whose past is likely to include reticulation events, such as horizontal gene transfer or hybridization, has gained popularity among evolutionary biologists. Nevertheless, the evolution of a particular gene can generally be described without reticulation events and therefore be represented by a phylogenetic tree. While this is not in contrast to each other, it places emphasis on the necessity of algorithms that analyze and summarize the tree-like information that is contained in a phylogenetic network. We contribute to the toolbox of such algorithms by investigating the question of whether or not a phylogenetic network embeds a tree twice and give a quadratic-time algorithm to solve this problem for a class of networks that is more general than tree-child networks.     

Mutant Cells Selected during Persistent Reovirus Infection Do Not Express Mature Cathepsin L and Do Not Support Reovirus Disassembly

Persistent reovirus infections of murine L929 cells select cellular mutations that inhibit viral disassembly within the endocytic pathway. Mutant cells support reovirus growth when infection is initiated with infectious subvirion particles (ISVPs), which are intermediates in reovirus disassembly formed following proteolysis of viral outer-capsid proteins. However, mutant cells do not support growth of virions, indicating that these cells have a defect in virion-to-ISVP processing. To better understand mechanisms by which viruses use the endocytic pathway to enter cells, we defined steps in reovirus replication blocked in mutant cells selected during persistent infection. Subcellular localization of reovirus after adsorption to parental and mutant cells was assessed using confocal microscopy and virions conjugated to a fluorescent probe. Parental and mutant cells did not differ in the capacity to internalize virions or distribute them to perinuclear compartments. Using pH-sensitive probes, the intravesicular pH was determined and found to be equivalent in parental and mutant cells. In both cell types, virions localized to acidified intracellular organelles. The capacity of parental and mutant cells to support proteolysis of reovirus virions was assessed by monitoring the appearance of disassembly intermediates following adsorption of radiolabeled viral particles. Within 2 h after adsorption to parental cells, proteolysis of viral outer-capsid proteins was observed, consistent with formation of ISVPs. However, in mutant cells, no proteolysis of viral proteins was detected up to 8 h postadsorption. Since treatment of cells with E64, an inhibitor of cysteine-containing proteases, blocks reovirus disassembly, we used immunoblot analysis to assess the expression of cathepsin L, a lysosomal cysteine protease. In contrast to parental cells, mutant cells did not express the mature, proteolytically active form of the enzyme. The defect in cathepsin L maturation was not associated with mutations in procathepsin L mRNA, was not complemented by procathepsin L overexpression, and did not affect the maturation of cathepsin B, another lysosomal cysteine protease. These findings indicate that persistent reovirus infections select cellular mutations that affect the maturation of cathepsin L and suggest that alterations in the expression of lysosomal proteases can modulate viral cytopathicity.     

On Nakhleh's Metric for Reduced Phylogenetic Networks

We prove that Nakhleh's metric for reduced phylogenetic networks is also a metric on the classes of tree-child phylogenetic networks, semibinary tree-sibling time consistent phylogenetic networks, and multilabeled phylogenetic trees. We also prove that it separates distinguishable phylogenetic networks. In this way, it becomes the strongest dissimilarity measure for phylogenetic networks available so far. Furthermore, we propose a generalization of that metric that separates arbitrary phylogenetic networks.