700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ ReadersThis Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)
Original Articles Open Access
Protein classification is a well established research field concerned with the discovery of molecule’s properties through informational techniques. Graph-based kernels provide a nice framework combining machine learning techniques with graph theory. In this paper we introduce a novel graph kernel method for annotating functional residues in protein structures. A structure¬ is first modeled as a protein contact graph, where nodes correspond to residues and edges connect spatially neighboring residues. In experiments on classification of graph models of proteins, the method based on Weisfeiler Lehman shortest path kernel with complement graphs outperformed other state-of-art methods.
To read the full article Peer-reviewed Article PDF
Author(s): Jiang Qiangrong Xiong Zhikang and Zhai Can
Protein classification, Machine learning, Graph kernels, Shortest path, Weisfeiler-Lehman, protein