|Title:||Visualizing the GPCR Network: Classification and Evolution||Authors:||Geng-Ming Hu
|Keywords:||PROTEIN-COUPLED RECEPTORS; PREDICTION; TOPOLOGY; FAMILIES; DATABASE; SYSTEM; MODEL||Issue Date:||2017||Publisher:||Springer Nature||Journal Volume:||7||Journal Issue:||1||Start page/Pages:||1-15||Source:||Scientific Reports||Abstract:||
In this study, we delineate an unsupervised clustering algorithm, minimum span clustering (MSC), and apply it to detect G-protein coupled receptor (GPCR) sequences and to study the GPCR network using a base dataset of 2770 GPCR and 652 non-GPCR sequences. High detection accuracy can be achieved with a proper dataset. The clustering results of GPCRs derived from MSC show a strong correlation between their sequences and functions. By comparing our level 1 MSC results with the GPCRdb classification, the consistency is 87.9% for the fourth level of GPCRdb, 89.2% for the third level, 98.4% for the second level, and 100% for the top level (the lowest resolution level of GPCRdb). The MSC results of GPCRs can be well explained by estimating the selective pressure of GPCRs, as exemplified by investigating the largest two subfamilies, peptide receptors (PRs) and olfactory receptors (ORs), in class A GPCRs. PRs are decomposed into three groups due to a positive selective pressure, whilst ORs remain as a single group due to a negative selective pressure. Finally, we construct and compare phylogenetic trees using distance-based and character-based methods, a combination of which could convey more comprehensive information about the evolution of GPCRs.
|Appears in Collections:||生命科學系|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.