Gene tree reconciliation: new developments in Bayesian concordance analysis with BUCKy

When phylogenetic trees inferred from different genes are incongruent, several methods are available to reconcile gene trees and extract the shared phylogenetic information from the sequence data. Bayesian Concordance Analysis, implemented in BUCKy, aims to extract the vertical signal and to infer clusters of genes that share the same tree topology. The new version of BUCKy includes a quartet-based estimate of the species tree with branch lengths in coalescent units

Observability and nonlinear filtering

This paper develops a connection between the asymptotic stability of nonlinear filters and a notion of observability. We consider a general class of hidden Markov models in continuous time with compact signal state space, and call such a model observable if no two initial measures of the signal process give rise to the same law of the observation process. We demonstrate that observability implies stability of the filter, i.e., the filtered estimates become insensitive to the initial measure at large times. For the special case where the signal is a finite-state Markov process and the observations are of the white noise type, a complete (necessary and sufficient) characterization of filter stability is obtained in terms of a slightly weaker detectability condition. In addition to observability, the role of controllability in filter stability is explored. Finally, the results are partially extended to non-compact signal state spaces

Dependence of paracentric inversion rate on tract length

BACKGROUND: We develop a Bayesian method based on MCMC for estimating the relative rates of pericentric and paracentric inversions from marker data from two species. The method also allows estimation of the distribution of inversion tract lengths. RESULTS: We apply the method to data from Drosophila melanogaster and D. yakuba. We find that pericentric inversions occur at a much lower rate compared to paracentric inversions. The average paracentric inversion tract length is approx. 4.8 Mb with small inversions being more frequent than large inversions. If the two breakpoints defining a paracentric inversion tract are uniformly and independently distributed over chromosome arms there will be more short tract-length inversions than long; we find an even greater preponderance of short tract lengths than this would predict. Thus there appears to be a correlation between the positions of breakpoints which favors shorter tract lengths. CONCLUSION: The method developed in this paper provides the first statistical estimator for estimating the distribution of inversion tract lengths from marker data. Application of this method for a number of data sets may help elucidate the relationship between the length of an inversion and the chance that it will get accepted

Global distribution of two fungal pathogens threatening endangered sea turtles

This work was supported by grants of Ministerio de Ciencia e Innovación, Spain (CGL2009-10032, CGL2012-32934). J.M.S.R was supported by PhD fellowship of the CSIC (JAEPre 0901804). The Natural Environment Research Council and the Biotechnology and Biological Sciences Research Council supported P.V.W. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Thanks Machalilla National Park in Ecuador, Pacuare Nature Reserve in Costa Rica, Foundations Natura 2000 in Cape Verde and Equilibrio Azul in Ecuador, Dr. Jesus Muñoz, Dr. Ian Bell, Dr. Juan Patiño for help and technical support during samplingPeer reviewedPublisher PD

Sampling and counting genome rearrangement scenarios

Even for moderate size inputs, there are a tremendous number of optimal rearrangement scenarios, regardless what the model is and which specific question is to be answered. Therefore giving one optimal solution might be misleading and cannot be used for statistical inferring. Statistically well funded methods are necessary to sample uniformly from the solution space and then a small number of samples are sufficient for statistical inferring

Sampling solution traces for the problem of sorting permutations by signed reversals

International audienceBackgroundTraditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge. A so-called trace represents a group of solutions which share the same set of reversals that must be applied to sort the original permutation following a partial ordering. By using traces, we therefore can represent the set of optimal solutions in a more compact way. Algorithms for enumerating the complete set of traces of solutions were developed. However, due to their exponential complexity, their practical use is limited to small permutations. A partial enumeration of traces is a sampling of the complete set of traces and can be an alternative for the study of distinct evolutionary scenarios of big permutations. Ideally, the sampling should be done uniformly from the space of all optimal solutions. This is however conjectured to be ♯P-complete.ResultsWe propose and evaluate three algorithms for producing a sampling of the complete set of traces that instead can be shown in practice to preserve some of the characteristics of the space of all solutions. The first algorithm (RA) performs the construction of traces through a random selection of reversals on the list of optimal 1-sequences. The second algorithm (DFALT) consists in a slight modification of an algorithm that performs the complete enumeration of traces. Finally, the third algorithm (SWA) is based on a sliding window strategy to improve the enumeration of traces. All proposed algorithms were able to enumerate traces for permutations with up to 200 elements.ConclusionsWe analysed the distribution of the enumerated traces with respect to their height and average reversal length. Various works indicate that the reversal length can be an important aspect in genome rearrangements. The algorithms RA and SWA show a tendency to lose traces with high average reversal length. Such traces are however rare, and qualitatively our results show that, for testable-sized permutations, the algorithms DFALT and SWA produce distributions which approximate the reversal length distributions observed with a complete enumeration of the set of traces

Detailed analysis of X chromosome inactivation in a 49,XXXXX pentasomy

<p>Abstract</p> <p>Background</p> <p>Pentasomy X (49,XXXXX) has been associated with a severe clinical condition, presumably resulting from failure or disruption of X chromosome inactivation. Here we report that some human X chromosomes from a patient with 49,XXXXX pentasomy were functionally active following isolation in inter-specific (human-rodent) cell hybrids. A comparison with cytogenetic and molecular findings provided evidence that more than one active X chromosome was likely to be present in the cells of this patient, accounting for her abnormal phenotype.</p> <p>Results</p> <p>5-bromodeoxyuridine (BrdU)-pulsed cultures showed different patterns among late replicating X chromosomes suggesting that their replication was asynchronic and likely to result in irregular inactivation. Genotyping of the proband and her mother identified four maternal and one paternal X chromosomes in the proband. It also identified the paternal X chromosome haplotype (P), indicating that origin of this X pentasomy resulted from two maternal, meiotic non-disjunctions. Analysis of the <it>HUMANDREC </it>region of the androgen receptor (<it>AR</it>) gene in the patient's mother showed a skewed inactivation pattern, while a similar analysis in the proband showed an active paternal X chromosome and preferentially inactivated X chromosomes carrying the 173 <it>AR </it>allele. Analyses of 33 cell hybrid cell lines selected in medium containing hypoxanthine, aminopterin and thymidine (HAT) allowed for the identification of three maternal X haplotypes (M1, M2 and MR) and showed that X chromosomes with the M1, M2 and P haplotypes were functionally active. In 27 cell hybrids in which more than one X haplotype were detected, analysis of X inactivation patterns provided evidence of preferential inactivation.</p> <p>Conclusion</p> <p>Our findings indicated that 12% of X chromosomes with the M1 haplotype, 43.5% of X chromosomes with the M2 haplotype, and 100% of the paternal X chromosome (with the P haplotype) were likely to be functionally active in the proband's cells, a finding indicating that disruption of X inactivation was associated to her severe phenotype.</p

Digits Lost or Gained? Evidence for Pedal Evolution in the Dwarf Salamander Complex (Eurycea, Plethodontidae)

Change in digit number, particularly digit loss, has occurred repeatedly over the evolutionary history of tetrapods. Although digit loss has been documented among distantly related species of salamanders, it is relatively uncommon in this amphibian order. For example, reduction from five to four toes appears to have evolved just three times in the morphologically and ecologically diverse family Plethodontidae. Here we report a molecular phylogenetic analysis for one of these four-toed lineages – the Eurycea quadridigitata complex (dwarf salamanders) – emphasizing relationships to other species in the genus. A multilocus phylogeny reveals that dwarf salamanders are paraphyletic with respect to a complex of five-toed, paedomorphic Eurycea from the Edwards Plateau in Texas. We use this phylogeny to examine evolution of digit number within the dwarf−Edwards Plateau clade, testing contrasting hypotheses of digit loss (parallelism among dwarf salamanders) versus digit gain (re-evolution in the Edwards Plateau complex). Bayes factors analysis provides statistical support for a five-toed common ancestor at the dwarf-Edwards node, favoring, slightly, the parallelism hypothesis for digit loss. More importantly, our phylogenetic results pinpoint a rare event in the pedal evolution of plethodontid salamanders

Probabilistic Phylogenetic Inference with Insertions and Deletions

A fundamental task in sequence analysis is to calculate the probability of a multiple alignment given a phylogenetic tree relating the sequences and an evolutionary model describing how sequences change over time. However, the most widely used phylogenetic models only account for residue substitution events. We describe a probabilistic model of a multiple sequence alignment that accounts for insertion and deletion events in addition to substitutions, given a phylogenetic tree, using a rate matrix augmented by the gap character. Starting from a continuous Markov process, we construct a non-reversible generative (birth–death) evolutionary model for insertions and deletions. The model assumes that insertion and deletion events occur one residue at a time. We apply this model to phylogenetic tree inference by extending the program dnaml in phylip. Using standard benchmarking methods on simulated data and a new “concordance test” benchmark on real ribosomal RNA alignments, we show that the extended program dnamlε improves accuracy relative to the usual approach of ignoring gaps, while retaining the computational efficiency of the Felsenstein peeling algorithm