On the design of a similarity function for sparse binary data with application on protein function annotation

2021 ◽  
pp. 107863
Author(s):  
Marcelo B.A. Veras ◽  
Bishnu Sarker ◽  
Sabeur Aridhi ◽  
João P.P. Gomes ◽  
José A.F. Macêdo ◽  
...  
2013 ◽  
Vol 11 (Suppl 1) ◽  
pp. S1 ◽  
Author(s):  
Alfredo Benso ◽  
Stefano Di Carlo ◽  
Hafeez ur Rehman ◽  
Gianfranco Politano ◽  
Alessandro Savino ◽  
...  

2008 ◽  
Vol 9 (1) ◽  
pp. 52 ◽  
Author(s):  
Chenggang Yu ◽  
Nela Zavaljevski ◽  
Valmik Desai ◽  
Seth Johnson ◽  
Fred J Stevens ◽  
...  

2019 ◽  
Vol 21 (4) ◽  
pp. 1437-1447 ◽  
Author(s):  
Jiajun Hong ◽  
Yongchao Luo ◽  
Yang Zhang ◽  
Junbiao Ying ◽  
Weiwei Xue ◽  
...  

Abstract Functional annotation of protein sequence with high accuracy has become one of the most important issues in modern biomedical studies, and computational approaches of significantly accelerated analysis process and enhanced accuracy are greatly desired. Although a variety of methods have been developed to elevate protein annotation accuracy, their ability in controlling false annotation rates remains either limited or not systematically evaluated. In this study, a protein encoding strategy, together with a deep learning algorithm, was proposed to control the false discovery rate in protein function annotation, and its performances were systematically compared with that of the traditional similarity-based and de novo approaches. Based on a comprehensive assessment from multiple perspectives, the proposed strategy and algorithm were found to perform better in both prediction stability and annotation accuracy compared with other de novo methods. Moreover, an in-depth assessment revealed that it possessed an improved capacity of controlling the false discovery rate compared with traditional methods. All in all, this study not only provided a comprehensive analysis on the performances of the newly proposed strategy but also provided a tool for the researcher in the fields of protein function annotation.


2015 ◽  
Vol 31 (21) ◽  
pp. 3460-3467 ◽  
Author(s):  
Sayoni Das ◽  
David Lee ◽  
Ian Sillitoe ◽  
Natalie L. Dawson ◽  
Jonathan G. Lees ◽  
...  

2019 ◽  
Author(s):  
Xiao Hu ◽  
Iddo Friedberg

AbstractIntroductionGene homology type classification is a requisite for many types of genome analyses, including comparative genomics, phylogenetics, and protein function annotation. A large variety of tools have been developed to perform homology classification across genomes of different species. However, when applied to large genomic datasets, these tools require high memory and CPU usage, typically available only in costly computational clusters. To address this problem, we developed a new graph-based orthology analysis tool, SwiftOrtho, which is optimized for speed and memory usage when applied to large-scale data.ResultsIn our tests, SwiftOrtho is the only tool that completed orthology analysis of 1,760 bacterial genomes on a computer with only 4GB RAM. Using various standard orthology datasets, we also show that SwiftOrtho has a high accuracy. SwiftOrtho enables the accurate comparative genomic analyses of thousands of genomes using low memory computers.Availabilityhttps://github.com/Rinoahu/SwiftOrtho


Sign in / Sign up

Export Citation Format

Share Document