Modern accounts of eukaryogenesis entail an endosymbiotic encounter between an archaeal host and a proteobacterial endosymbiont, with subsequent evolution giving rise to a unicell possessing a single nucleus and mitochondria. The mononucleate state of the last eukaryotic common ancestor, LECA, is seldom, if ever, questioned, even though cells harboring multiple (syncytia, coenocytes, polykaryons) are surprisingly common across eukaryotic supergroups. Here we present a survey of multinucleated forms. Ancestral character state reconstruction for representatives of 106 eukaryotic taxa using 16 different possible roots and supergroup sister relationships, indicate that LECA, in addition to being mitochondriate, sexual, and meiotic, was multinucleate. LECA exhibited closed mitosis, which is the rule for modern syncytial forms, shedding light on the mechanics of its chromosome segregation. A simple mathematical model shows that within LECA’s multinucleate cytosol, relationships among mitochondria and nuclei were neither one-to-one, nor one-to-many, but many-to-many, placing mitonuclear interactions and cytonuclear compatibility at the evolutionary base of eukaryotic cell origin. Within a syncytium, individual nuclei and individual mitochondria function as the initial lower-level evolutionary units of selection, as opposed to individual cells, during eukaryogenesis. Nuclei within a syncytium rescue each other’s lethal mutations, thereby postponing selection for viable nuclei and cytonuclear compatibility to the generation of spores, buffering transitional bottlenecks at eukaryogenesis. The prokaryote-to-eukaryote transition is traditionally thought to have left no intermediates, yet if eukaryogenesis proceeded via a syncytial common ancestor, intermediate forms have persisted to the present throughout the eukaryotic tree as syncytia, but have so far gone unrecognized.
Phylogenetic networks are a generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered 'tree-like' or not, which leads to the introduction of tree-based networks in the rooted, binary context. Tree-based networks are those networks which can be constructed by adding additional edges into a phylogenetic tree, called the base tree. Previous extensions have considered extending to the binary, unrooted case and the nonbinary, rooted case. In this paper, we extend tree-based networks to the context of unrooted, nonbinary networks in three ways, depending on the types of additional edges that are permitted. Further, we study fully tree-based networks which are phylogenetic networks in which every embedded tree is a base tree. We also extend this concept to unrooted, nonbinary, phylogenetic networks and classify the resulting networks. Finally, we derive some results on the colourability of tree-based networks, which can be useful to determine whether a network is tree-based.
Knowledge on the pygmy grasshoppers of Australia is, despite the numerous endemics being described from this unique continent, still scarce. Of interest is the Vingselina genus group, including genera Anaselina Storozhenko, 2019, Paraselina Storozhenko, 2019, Selivinga Storozhenko, 2019 and Vingselina Sjöstedt, 1921. The systematic position of this group, currently assigned to Batrachideinae (Bufonidini), is probably not correct. In this study new records are presented of Anaselina minor (Sjöstedt, 1921), Paraselina brunneri (Bolívar, 1887), P. trituberculata (Sjöstedt, 1932), and Selivinga tribulata Storozhenko, 2019, all except A. minor the first records of the species since their original descriptions. The first photographs of living specimens of A. minor, P. brunneri, P. trituberculata and S. tribulata are provided and their habitats described. All the records were compiled by citizen scientists who use online social media, such as iNaturalist. Lastly, P. multifora (Rehn, 1952) syn. nov. represents a junior synonym of P. brunneri.
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this paper, we generalize a complete polynomial invariant on trees to a class of phylogenetic networks called separable networks, which will include orchard networks. Networks are becoming increasingly important for their ability to represent reticulation events, such as hybridization, in evolutionary history. We provide a function from the space of internally multi-labelled phylogenetic networks, a more generic graph structure than phylogenetic networks where the reticulations are also labelled, to a polynomial ring. We prove that the separability condition allows us to characterize, via the polynomial, the phylogenetic networks with the same number of leaves and same number of reticulations by considering their internally labelled versions. While the invariant for trees is a polynomial in Z [ x 1 , … , x n , y ] where n is the number of leaves, the invariant for internally multi-labelled phylogenetic networks is an element of Z [ x 1 , … , x n , λ 1 , … , λ r , y ], where r is the number of reticulations in the network. When the networks are considered without leaf labels the number of variables reduces to r + 2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.