Structural classification of proteins based on the computationally efficient recurrence quantification analysis and horizontal visibility graphs
Rattachement africain : gr. Niveau de preuve : code pays fourni par la source.
Le résumé fourni par la source
Abstract Motivation Protein structure prediction is one of the most significant problems in bioinformatics, as it has a prominent role in understanding the function and evolution of proteins. Designing a computationally efficient but at the same time accurate prediction method remains a pressing issue, especially for sequences that we cannot obtain a sufficient amount of homologous information from existing protein sequence databases. Several studies demonstrate the potential of utilizing chaos game representation (CGR) along with time series analysis tools such as recurrence quantification analysis (RQA), complex networks, horizontal visibility graphs (HVG) and others. However, the majority of existing works involve a large amount of features and they require an exhaustive, time consuming search of the optimal parameters. To address the aforementioned problems, this work adopts the generalized multidimensional recurrence quantification analysis (GmdRQA) as an efficient tool that enables to process concurrently a multidimensional time series and reduce the number of features. In addition, two data-driven algorithms, namely average mutual information (AMI) and false nearest neighbors (FNN), are utilized to define in a fast yet precise manner the optimal GmdRQA parameters. Results The classification accuracy is improved by the combination of GmdRQA with the HVG. Experimental evaluation on a real benchmark dataset demonstrates that our methods achieve similar performance with the state-of-the-art but with a smaller computational cost. Availability The code to reproduce all the results is available at https://github.com/aretiz/protein_structure_classification/tree/main . Contact edoutsi@ics.forth.gr Supplementary information Supplementary data are available at Bioinformatics online.
Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.
Le contrôle bibliographique ouvert
DOI retrouvé dans Crossref DOI retrouvé ; titre concordant.
- Titre Crossref
- Structural classification of proteins based on the computationally efficient recurrence quantification analysis and horizontal visibility graphs
- Date Crossref
- 23/10/2020
- Éditeur
- openRxiv
- Type
- posted-content
Ce recoupement confirme des métadonnées liées au DOI. Il ne confirme ni la méthode ni les conclusions de l’étude, et il ne compte pas comme une seconde source scientifique indépendante.
Où se fait cette recherche
-
University of Crete Department of Computer Science pays non établi dans la noticeUniversité ou école supérieure
-
Foundation for Research and Technology Hellas pays non établi dans la noticeStructure de recherche
-
Institute of Computer Science pays non établi dans la noticeStructure de recherche
Department of Computer Science — University of Crete, Foundation for Research and Technology Hellas et Institute of Computer Science.
Une affiliation ne permet pas de déduire la nationalité d’un auteur.