Search arXivSearch

arXiv · 1602.04773

Competing metabolic strategies in a multilevel selection model

Abstract

The interplay between energy efficiency and evolutionary mechanisms is addressed. One important question is how evolutionary mechanisms can select for the optimised usage of energy in situations where it does not lead to immediate advantage. For example, this problem is of great importance to improve our understanding about the major transition from unicellular to multicellular form of life. The immediate advantage of gathering efficient individuals in an energetic context is not clear. Although this process increases relatedness among individuals, it also increases local competition. To address this question, we propose a model of two competing metabolic strategies that makes explicit reference to the resource usage. We assume the existence of an efficient strain, which converts resource into energy at high efficiency but displays a low rate of resource consumption, and an inefficient strain, which consumes resource at a high rate with a low efficiency in converting it to energy. We explore the dynamics in both well-mixed and structured populations. The selection for optimised energy usage is measured by the likelihood of that an efficient strain can invade a population only comprised by inefficient strains. It is found that the region of the parameter space at which the efficient strain can thrive in structured populations is always larger than observed in well-mixed populations. In fact, in well-mixed populations the efficient strain is only evolutionarily stable in the domain whereupon there is no evolutionary dilemma. We also observe that small group sizes enhance the chance of invasion by the efficient strain in spite of increasing the competition among relatives. This outcome corroborates the key role played by kin selection and shows that the group dynamics relied on group expansion, overlapping generations and group split can balance the negative effects of local competition.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

André Amado, Lenin Fernández, Weini Huang, Fernando F. Ferreira, Paulo R. A. Campos. 2016-02-15. Competing metabolic strategies in a multilevel selection model. https://doi.org/10.1098/rsos.160544

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE