1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      CoCoNat: a novel method based on deep learning for coiled-coil prediction

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Motivation

          Coiled-coil domains (CCD) are widespread in all organisms and perform several crucial functions. Given their relevance, the computational detection of CCD is very important for protein functional annotation. State-of-the-art prediction methods include the precise identification of CCD boundaries, the annotation of the typical heptad repeat pattern along the coiled-coil helices as well as the prediction of the oligomerization state.

          Results

          In this article, we describe CoCoNat, a novel method for predicting coiled-coil helix boundaries, residue-level register annotation, and oligomerization state. Our method encodes sequences with the combination of two state-of-the-art protein language models and implements a three-step deep learning procedure concatenated with a Grammatical-Restrained Hidden Conditional Random Field for CCD identification and refinement. A final neural network predicts the oligomerization state. When tested on a blind test set routinely adopted, CoCoNat obtains a performance superior to the current state-of-the-art both for residue-level and segment-level CCD. CoCoNat significantly outperforms the most recent state-of-the-art methods on register annotation and prediction of oligomerization states.

          Availability and implementation

          CoCoNat web server is available at https://coconat.biocomp.unibo.it. Standalone version is available on GitHub at https://github.com/BolognaBiocomp/coconat.

          Related collections

          Most cited references33

          • Record: found
          • Abstract: found
          • Article: not found

          Long Short-Term Memory

          Learning to store information over extended time intervals by recurrent backpropagation takes a very long time, mostly because of insufficient, decaying error backflow. We briefly review Hochreiter's (1991) analysis of this problem, then address it by introducing a novel, efficient, gradient-based method called long short-term memory (LSTM). Truncating the gradient where this does not do harm, LSTM can learn to bridge minimal time lags in excess of 1000 discrete-time steps by enforcing constant error flow through constant error carousels within special units. Multiplicative gate units learn to open and close access to the constant error flow. LSTM is local in space and time; its computational complexity per time step and weight is O(1). Our experiments with artificial data involve local, distributed, real-valued, and noisy pattern representations. In comparisons with real-time recurrent learning, back propagation through time, recurrent cascade correlation, Elman nets, and neural sequence chunking, LSTM leads to many more successful runs, and learns much faster. LSTM also solves complex, artificial long-time-lag tasks that have never been solved by previous recurrent network algorithms.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Backpropagation Applied to Handwritten Zip Code Recognition

              Bookmark
              • Record: found
              • Abstract: not found
              • Book: not found

              Visualizing Data using t-SNE

                Bookmark

                Author and article information

                Contributors
                Role: Associate Editor
                Journal
                Bioinformatics
                Bioinformatics
                bioinformatics
                Bioinformatics
                Oxford University Press
                1367-4803
                1367-4811
                August 2023
                04 August 2023
                04 August 2023
                : 39
                : 8
                : btad495
                Affiliations
                Biocomputing Group, Department of Pharmacy and Biotechnology, University of Bologna , Italy
                Biocomputing Group, Department of Pharmacy and Biotechnology, University of Bologna , Italy
                Biocomputing Group, Department of Pharmacy and Biotechnology, University of Bologna , Italy
                Biocomputing Group, Department of Pharmacy and Biotechnology, University of Bologna , Italy
                Biocomputing Group, Department of Pharmacy and Biotechnology, University of Bologna , Italy
                Author notes
                Corresponding author. Biocomputing Group, Department of Pharmacy and Biotechnology, University of Bologna, via San Giacomo 9/2, 40126 Bologna, Italy. E-mail:  pierluigi.martelli@ 123456unibo.it

                Giovanni Madeo and Castrense Savojardo Equal contribution.

                Author information
                https://orcid.org/0000-0002-7359-0633
                https://orcid.org/0000-0001-5479-1723
                https://orcid.org/0000-0002-0274-5669
                https://orcid.org/0000-0002-7462-7039
                Article
                btad495
                10.1093/bioinformatics/btad495
                10425188
                37540220
                273b44eb-171c-49a7-a9fa-548aa36c9398
                © The Author(s) 2023. Published by Oxford University Press.

                This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.

                History
                : 11 May 2023
                : 31 July 2023
                : 01 August 2023
                : 03 August 2023
                : 14 August 2023
                Page count
                Pages: 8
                Funding
                Funded by: Ministry of University and Research;
                Categories
                Original Paper
                Structural Bioinformatics
                AcademicSubjects/SCI01060

                Bioinformatics & Computational biology
                Bioinformatics & Computational biology

                Comments

                Comment on this article