7 research outputs found

    Device-detected subclinical atrial tachyarrhythmias: Definition, implications and management - An European Heart Rhythm Association (EHRA) consensus document, endorsed by Heart Rhythm Society (HRS), Asia Pacific Heart Rhythm Society (APHRS) and Sociedad Latinoamericana de Estimulaci\uf3n Card\uedaca y Electrofisiolog\ueda (SOLEACE)

    Get PDF
    Among atrial tachyarrhythmias (AT), atrial fibrillation (AF) is the most common sustained arrhythmia. Many patients with AT have no symptoms during brief or even extended periods of the arrhythmia, making detection in patients at risk for stroke challenging. Subclinical atrial tachyarrhythmia and asymptomatic or silent atrial tachyarrhythmia often precede the development of clinical AF. Clinical AF and subclinical atrial fibrillation (SCAF) are associated with an increased risk of thromboembolism. Indeed, in many cases, SCAF is discovered only after complications such as ischaemic stroke or congestive heart failure have occurred

    Deciphering the Preference and Predicting the Viability of Circular Permutations in Proteins

    Get PDF
    Circular permutation (CP) refers to situations in which the termini of a protein are relocated to other positions in the structure. CP occurs naturally and has been artificially created to study protein function, stability and folding. Recently CP is increasingly applied to engineer enzyme structure and function, and to create bifunctional fusion proteins unachievable by tandem fusion. CP is a complicated and expensive technique. An intrinsic difficulty in its application lies in the fact that not every position in a protein is amenable for creating a viable permutant. To examine the preferences of CP and develop CP viability prediction methods, we carried out comprehensive analyses of the sequence, structural, and dynamical properties of known CP sites using a variety of statistics and simulation methods, such as the bootstrap aggregating, permutation test and molecular dynamics simulations. CP particularly favors Gly, Pro, Asp and Asn. Positions preferred by CP lie within coils, loops, turns, and at residues that are exposed to solvent, weakly hydrogen-bonded, environmentally unpacked, or flexible. Disfavored positions include Cys, bulky hydrophobic residues, and residues located within helices or near the protein's core. These results fostered the development of an effective viable CP site prediction system, which combined four machine learning methods, e.g., artificial neural networks, the support vector machine, a random forest, and a hierarchical feature integration procedure developed in this work. As assessed by using the hydrofolate reductase dataset as the independent evaluation dataset, this prediction system achieved an AUC of 0.9. Large-scale predictions have been performed for nine thousand representative protein structures; several new potential applications of CP were thus identified. Many unreported preferences of CP are revealed in this study. The developed system is the best CP viability prediction method currently available. This work will facilitate the application of CP in research and biotechnology

    Predicted binding site information improves model ranking in protein docking using experimental and computer-generated target structures

    Get PDF
    BACKGROUND: Protein-protein interactions (PPIs) mediate the vast majority of biological processes, therefore, significant efforts have been directed to investigate PPIs to fully comprehend cellular functions. Predicting complex structures is critical to reveal molecular mechanisms by which proteins operate. Despite recent advances in the development of new methods to model macromolecular assemblies, most current methodologies are designed to work with experimentally determined protein structures. However, because only computer-generated models are available for a large number of proteins in a given genome, computational tools should tolerate structural inaccuracies in order to perform the genome-wide modeling of PPIs. RESULTS: To address this problem, we developed eRank(PPI), an algorithm for the identification of near-native conformations generated by protein docking using experimental structures as well as protein models. The scoring function implemented in eRank(PPI) employs multiple features including interface probability estimates calculated by eFindSite(PPI) and a novel contact-based symmetry score. In comparative benchmarks using representative datasets of homo- and hetero-complexes, we show that eRank(PPI) consistently outperforms state-of-the-art algorithms improving the success rate by ~10 %. CONCLUSIONS: eRank(PPI) was designed to bridge the gap between the volume of sequence data, the evidence of binary interactions, and the atomic details of pharmacologically relevant protein complexes. Tolerating structure imperfections in computer-generated models opens up a possibility to conduct the exhaustive structure-based reconstruction of PPI networks across proteomes. The methods and datasets used in this study are available at www.brylinski.org/erankppi
    corecore