Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem

<p>Abstract</p> <p>Background</p> <p>Evolutionary methods are increasingly challenged by the wealth of fast growing resources of genomic sequence information. Evolutionary events, like gene duplication, loss, and deep coalescence, account more then ever for incongruence between gene trees and the actual species tree. Gene tree reconciliation is addressing this fundamental problem by invoking the minimum number of gene duplication and losses that reconcile a rooted gene tree with a rooted species tree. However, the reconciliation process is highly sensitive to topological error or wrong rooting of the gene tree, a condition that is not met by most gene trees in practice. Thus, despite the promises of gene tree reconciliation, its applicability in practice is severely limited.</p> <p>Results</p> <p>We introduce the problem of reconciling unrooted and erroneous gene trees by simultaneously rooting and error-correcting them, and describe an efficient algorithm for this problem. Moreover, we introduce an error-corrected version of the gene duplication problem, a standard application of gene tree reconciliation. We introduce an effective heuristic for our error-corrected version of the gene duplication problem, given that the original version of this problem is NP-hard. Our experimental results suggest that our error-correcting approaches for unrooted input trees can significantly improve on the accuracy of gene tree reconciliation, and the species tree inference under the gene duplication problem. Furthermore, the efficiency of our algorithm for error-correcting reconciliation is capable of handling truly large-scale phylogenetic studies.</p> <p>Conclusions</p> <p>Our presented error-correction approach is a crucial step towards making gene tree reconciliation more robust, and thus to improve on the accuracy of applications that fundamentally rely on gene tree reconciliation, like the inference of gene-duplication supertrees.</p

Novel Potent Muscarinic Receptor Antagonists: Investigation on the Nature of Lipophilic Substituents in the 5- and/or 6-Positions of the 1,4-Dioxane Nucleus

A series of novel 1,4-dioxane analogues of the muscarinic acetylcholine receptor (mAChR) antagonist 2 was synthesized and studied for their affinity at M1-M5 mAChRs. The 6-cyclohexyl-6-phenyl derivative 3b, with a cis configuration between the CH2N+(CH3)3 chain in the 2-position and the cyclohexyl moiety in the 6-position, showed pKi values for mAChRs higher than those of 2 and a selectivity profile analogous to that of the clinically approved drug oxybutynin. The study of the enantiomers of 3b and the corresponding tertiary amine 33b revealed that the eutomers are (2S,6S)-(-)-3b and (2S,6S)-(-)-33b, respectively. Docking simulations on the M3 mAChR-resolved structure rationalized the experimental observations. The quaternary ammonium function, which should prevent the crossing of the blood-brain barrier, and the high M3/M2 selectivity, which might limit cardiovascular side effects, make 3b a valuable starting point for the design of novel antagonists potentially useful in peripheral diseases in which M3 receptors are involved

The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances

In the last five years there have been a large number of new time series classification algorithms proposed in the literature. These algorithms have been evaluated on subsets of the 47 data sets in the University of California, Riverside time series classification archive. The archive has recently been expanded to 85 data sets, over half of which have been donated by researchers at the University of East Anglia. Aspects of previous evaluations have made comparisons between algorithms difficult. For example, several different programming languages have been used, experiments involved a single train/test split and some used normalised data whilst others did not. The relaunch of the archive provides a timely opportunity to thoroughly evaluate algorithms on a larger number of datasets. We have implemented 18 recently proposed algorithms in a common Java framework and compared them against two standard benchmark classifiers (and each other) by performing 100 resampling experiments on each of the 85 datasets. We use these results to test several hypotheses relating to whether the algorithms are significantly more accurate than the benchmarks and each other. Our results indicate that only 9 of these algorithms are significantly more accurate than both benchmarks and that one classifier, the Collective of Transformation Ensembles, is significantly more accurate than all of the others. All of our experiments and results are reproducible: we release all of our code, results and experimental details and we hope these experiments form the basis for more rigorous testing of new algorithms in the future

Beyond representing orthology relations by trees

Reconstructing the evolutionary past of a family of genes is an important aspect of many genomic studies. To help with this, simple relations on a set of sequences called orthology relations may be employed. In addition to being interesting from a practical point of view they are also attractive from a theoretical perspective in that e.\,g.\,a characterization is known for when such a relation is representable by a certain type of phylogenetic tree. For an orthology relation inferred from real biological data it is however generally too much to hope for that it satisfies that characterization. Rather than trying to correct the data in some way or another which has its own drawbacks, as an alternative, we propose to represent an orthology relation $\delta$ in terms of a structure more general than a phylogenetic tree called a phylogenetic network. To compute such a network in the form of a level-1 representation for $\delta$, we formalize an orthology relation in terms of the novel concept of a symbolic 3- dissimilarity which is motivated by the biological concept of a ``cluster of orthologous groups'', or COG for short. For such maps which assign symbols rather that real values to elements, we introduce the novel {\sc Network-Popping} algorithm which has several attractive properties. In addition, we characterize an orthology relation $\delta$ on some set $X$ that has a level-1 representation in terms of eight natural properties for $\delta$ as well as in terms of level-1 representations of orthology relations on certain subsets of $X$

Study on Phylogenetic Relationships, Variability, and Correlated Mutations in M2 Proteins of Influenza Virus A

M2 channel, an influenza virus transmembrane protein, serves as an important target for antiviral drug design. There are still discordances concerning the role of some residues involved in proton transfer as well as the mechanism of inhibition by commercial drugs. The viral M2 proteins show high conservativity; about 3/4 of the positions are occupied by one residue in over 95%. Nine M2 proteins from the H3N2 strain and possibly two proteins from H2N2 strains make a phylogenic cluster closely related to 2RLF. The variability range is limited to 4 residues/position with one exception. The 2RLF protein stands out by the presence of 2 serines at the positions 19 and 50, which are in most other M2 proteins occupied by cysteines. The study of correlated mutations shows that there are several positions with significant mutational correlation that have not been described so far as functionally important. That there are 5 more residues potentially involved in the M2 mechanism of action. The original software used in this work (Consensus Constructor, SSSSg, Corm, Talana) is freely accessible as stand-alone offline applications upon request to the authors. The other software used in this work is freely available online for noncommercial purposes at public services on bioinformatics such as ExPASy or NCBI. The study on mutational variability, evolutionary relationship, and correlated mutation presented in this paper is a potential way to explain more completely the role of significant factors in proton channel action and to clarify the inhibition mechanism by specific drugs

Thermodynamic principles and implementations of quantum machines

The efficiency of cyclic heat engines is limited by the Carnot bound. This bound follows from the second law of thermodynamics and is attained by engines that operate between two thermal baths under the reversibility condition whereby the total entropy does not increase. By contrast, the efficiency of engines powered by quantum non-thermal baths has been claimed to surpass the thermodynamic Carnot bound. The key to understanding the performance of such engines is a proper division of the energy supplied by the bath to the system into heat and work, depending on the associated change in the system entropy and ergotropy. Due to their hybrid character, the efficiency bound for quantum engines powered by a non-thermal bath does not solely follow from the laws of thermodynamics. Hence, the thermodynamic Carnot bound is inapplicable to such hybrid engines. Yet, they do not violate the principles of thermodynamics. An alternative means of boosting machine performance is the concept of heat-to-work conversion catalysis by quantum non-linear (squeezed) pumping of the piston mode. This enhancement is due to the increased ability of the squeezed piston to store ergotropy. Since the catalyzed machine is fueled by thermal baths, it adheres to the Carnot bound. We conclude by arguing that it is not quantumness per se that improves the machine performance, but rather the properties of the baths, the working fluid and the piston that boost the ergotropy and minimize the wasted heat in both the input and the output.Comment: As a chapter of: F. Binder, L. A. Correa, C. Gogolin, J. Anders, and G. Adesso (eds.), "Thermodynamics in the quantum regime - Recent Progress and Outlook", (Springer International Publishing

Adaptative Potential of the Lactococcus Lactis IL594 Strain Encoded in Its 7 Plasmids

The extrachromosomal gene pool plays a significant role both in evolution and in the environmental adaptation of bacteria. The L. lactis subsp. lactis IL594 strain contains seven plasmids, named pIL1 to pIL7, and is the parental strain of the plasmid-free L. lactis IL1403, which is one of the best characterized lactococcal strains of LAB. Complete nucleotide sequences of pIL1 (6,382 bp), pIL2 (8,277 bp), pIL3 (19,244 bp), pIL4 (48,979), pIL5 (23,395), pIL6 (28,435 bp) and pIL7 (28,546) were established and deposited in the generally accessible database (GeneBank). Nine highly homologous repB-containing replicons, belonging to the lactococcal theta-type replicons, have been identified on the seven plasmids. Moreover, a putative region involved in conjugative plasmid mobilization was found on four plasmids, through identification of the presence of mob genes and/or oriT sequences. Detailed bioinformatic analysis of the plasmid nucleotide sequences provided new insight into the repertoire of plasmid-encoded functions in L. lactis, and indicated that plasmid genes from IL594 strain can be important for L. lactis adaptation to specific environmental conditions (e.g. genes coding for proteins involved in DNA repair or cold shock response) as well as for technological processes (e.g. genes encoding citrate and lactose utilization, oligopeptide transport, restriction-modification system). Moreover, global gene analysis indicated cooperation between plasmid- and chromosome-encoded metabolic pathways