Correction: Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable.
Ontology highlight
ABSTRACT:
SUBMITTER: PLOS Computational Biology Staff
PROVIDER: S-EPMC6568377 | biostudies-literature | 2019 Jun
REPOSITORIES: biostudies-literature
Publications
Correction: Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable.
PLoS computational biology 20190614 6
[This corrects the article DOI: 10.1371/journal.pcbi.1004135.]. ...[more]
Similar Datasets
Project description:Phylogenetic networks represent the evolution of organisms that have undergone reticulate events, such as recombination, hybrid speciation or lateral gene transfer. An important way to interpret a phylogenetic network is in terms of the trees it displays, which represent all the possible histories of the characters carried by the organisms in the network. Interestingly, however, different networks may display exactly the same set of trees, an observation that poses a problem for network reconstruction: from the perspective of many inference methods such networks are "indistinguishable". This is true for all methods that evaluate a phylogenetic network solely on the basis of how well the displayed trees fit the available data, including all methods based on input data consisting of clades, triples, quartets, or trees with any number of taxa, and also sequence-based approaches such as popular formalisations of maximum parsimony and maximum likelihood for networks. This identifiability problem is partially solved by accounting for branch lengths, although this merely reduces the frequency of the problem. Here we propose that network inference methods should only attempt to reconstruct what they can uniquely identify. To this end, we introduce a novel definition of what constitutes a uniquely reconstructible network. For any given set of indistinguishable networks, we define a canonical network that, under mild assumptions, is unique and thus representative of the entire set. Given data that underwent reticulate evolution, only the canonical form of the underlying phylogenetic network can be uniquely reconstructed. While on the methodological side this will imply a drastic reduction of the solution space in network inference, for the study of reticulate evolution this is a fundamental limitation that will require an important change of perspective when interpreting phylogenetic networks.
| S-EPMC4388854 | biostudies-literature
Project description:For N indistinguishable bosons or fermions impinged on a M-port Haar-random unitary network the average probability to count n 1, … n r particles in a small number r ≪ N of binned-together output ports takes a Gaussian form as N ≫ 1. The discovered Gaussian asymptotic law is the well-known asymptotic law for distinguishable particles, governed by a multinomial distribution, modified by the quantum statistics with stronger effect for greater particle density N/M. Furthermore, it is shown that the same Gaussian law is the asymptotic form of the probability to count particles at the output bins of a fixed multiport with the averaging performed over all possible configurations of the particles in the input ports. In the limit N → ∞, the average counting probability for indistinguishable bosons, fermions, and distinguishable particles differs only at a non-vanishing particle density N/M and only for a singular binning K/M → 1, where K output ports belong to a single bin.
| S-EPMC5428393 | biostudies-literature
Project description: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 [Formula: see text] 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.
| S-EPMC5552900 | biostudies-other
Project description:The serine protease ?-thrombin is a dual-action protein that mediates the blood-clotting cascade. Thrombin alone is a procoagulant, cleaving fibrinogen to make the fibrin clot, but the thrombin-thrombomodulin (TM) complex initiates the anticoagulant pathway by cleaving protein C. A TM fragment consisting of only the fifth and sixth EGF-like domains (TM56) is sufficient to bind thrombin, but the presence of the fourth EGF-like domain (TM456) is critical to induce the anticoagulant activity of thrombin. Crystallography of the thrombin-TM456 complex revealed no significant structural changes in thrombin, suggesting that TM4 may only provide a scaffold for optimal alignment of protein C for its cleavage by thrombin. However, a variety of experimental data have suggested that the presence of TM4 may affect the dynamic properties of the active site loops. In the present work, we have used both conventional and accelerated molecular dynamics simulation to study the structural dynamic properties of thrombin, thrombin:TM56, and thrombin:TM456 across a broad range of time scales. Two distinct yet interrelated allosteric pathways are identified that mediate both the pro- and anticoagulant activities of thrombin. One allosteric pathway, which is present in both thrombin:TM56 and thrombin:TM456, directly links the TM5 domain to the thrombin active site. The other allosteric pathway, which is only present on slow time scales in the presence of the TM4 domain, involves an extended network of correlated motions linking the TM4 and TM5 domains and the active site loops of thrombin.
| S-EPMC3535651 | biostudies-literature
Project description:This SuperSeries is composed of the SubSeries listed below.
2017-07-01 | GSE94628 | GEO
Project description:Locked-in syndrome and vegetative state are distinct outcomes from coma. Despite their differences, they are clinically difficult to distinguish at the early stage and current diagnostic tools remain insufficient. Since some brain functions are preserved in locked-in syndrome, we postulated that networks of spontaneously co-activated brain areas might be present in locked-in patients, similar to healthy controls, but not in patients in a vegetative state.Five patients with locked-in syndrome, 12 patients in a vegetative state and 19 healthy controls underwent a resting-state fMRI scan. Individual spatial independent component analysis was used to separate spontaneous brain co-activations from noise. These co-activity maps were selected and then classified by two raters as either one of eight resting-state networks commonly shared across subjects or as specific to a subject.The numbers of spontaneous co-activity maps, total resting-state networks, and resting-state networks underlying high-level cognitive activity were shown to differentiate controls and locked-in patients from patients in a vegetative state. Analyses of each common resting-state network revealed that the default mode network accurately distinguished locked-in from vegetative-state patients. The frontoparietal network also had maximum specificity but more limited sensitivity.This study reinforces previous reports on the preservation of the default mode network in locked-in syndrome in contrast to vegetative state but extends them by suggesting that other networks might be relevant to the diagnosis of locked-in syndrome. The aforementioned analysis of fMRI brain activity at rest might be a step in the development of a diagnostic biomarker to distinguish locked-in syndrome from vegetative state.
| S-EPMC4913176 | biostudies-other
Project description:Pluripotent stem cells are capable of differentiating into all cell types of the body and therefore hold tremendous promise for regenerative medicine. Despite their widespread use in laboratories across the world, a detailed understanding of the molecular mechanisms that regulate the pluripotent state is currently lacking. Mouse embryonic (mESC) and epiblast (mEpiSC) stem cells are two closely related classes of pluripotent stem cells, derived from distinct embryonic tissues. Although both mESC and mEpiSC are pluripotent, these cell types show important differences in their properties suggesting distinct pluripotent ground states. To understand the molecular basis of pluripotency, we analyzed the nuclear proteomes of mESCs and mEpiSCs to identify protein networks that regulate their respective pluripotent states. Our study used label-free LC-MS/MS to identify and quantify 1597 proteins in embryonic and epiblast stem cell nuclei. Immunoblotting of a selected protein subset was used to confirm that key components of chromatin regulatory networks are differentially expressed in mESCs and mEpiSCs. Specifically, we identify differential expression of DNA methylation, ATP-dependent chromatin remodeling and nucleosome remodeling networks in mESC and mEpiSC nuclei. This study is the first comparative study of protein networks in cells representing the two distinct, pluripotent states, and points to the importance of DNA and chromatin modification processes in regulating pluripotency. In addition, by integrating our data with existing pluripotency networks, we provide detailed maps of protein networks that regulate pluripotency that will further both the fundamental understanding of pluripotency as well as efforts to reliably control the differentiation of these cells into functional cell fates.
| S-EPMC3494154 | biostudies-literature
Project description:Dopaminergic networks modulate neural processing across a spectrum of function from perception to learning to action. Multiple organizational schemes based on anatomy and function have been proposed for dopaminergic nuclei in the midbrain. One schema originating in rodent models delineated ventral tegmental area (VTA), implicated in complex behaviors like addiction, from more lateral substantia nigra (SN), preferentially implicated in movement. However, because anatomy and function in rodent midbrain differs from the primate midbrain in important ways, the utility of this distinction for human neuroscience has been questioned. We asked whether functional definition of networks within the human dopaminergic midbrain would recapitulate this traditional anatomical topology. We first developed a method for reliably defining SN and VTA in humans at conventional MRI resolution. Hand-drawn VTA and SN regions-of-interest (ROIs) were constructed for 50 participants, using individually-localized anatomical landmarks and signal intensity. Individual segmentation was used in seed-based functional connectivity analysis of resting-state functional MRI data; results of this analysis recapitulated traditional anatomical targets of the VTA versus SN. Next, we constructed a probabilistic atlas of the VTA, SN, and the dopaminergic midbrain region (comprised of SN plus VTA) from individual hand-drawn ROIs. The combined probabilistic (SN plus VTA) ROI was then used for connectivity-based dual-regression analysis in two independent resting-state datasets (n = 69 and n = 79). Results of the connectivity-based, dual-regression functional segmentation recapitulated results of the anatomical segmentation, validating the utility of this probabilistic atlas for future research.
| S-EPMC4370842 | biostudies-literature
Project description:Comparative expression analysis of HOG1 KOs during osmotic stress in the ascomycete yeasts
2017-07-01 | GSE94627 | GEO
Project description:A phylogenetic framework to study the evolution of transcriptional regulatory networks
2017-07-01 | GSE94625 | GEO