title: Sequence-based enzyme catalytic domain prediction using clustering and aggregated mutual information content.
abstract: Characterizing enzyme sequences and identifying their active sites is a very important task. The current experimental methods are too expensive and labor intensive to handle the rapidly accumulating protein sequences and structure data. Thus accurate, high-throughput in silico methods for identifying catalytic residues and enzyme function prediction are much needed. In this paper, we propose a novel sequence-based catalytic domain prediction method using a sequence clustering and an information-theoretic approaches. The first step is to perform the sequence clustering analysis of enzyme sequences from the same functional category (those with the same EC label). The clustering analysis is used to handle the problem of widely varying sequence similarity levels in enzyme sequences. The clustering analysis constructs a sequence graph where nodes are enzyme sequences and edges are a pair of sequences with a certain degree of sequence similarity, and uses graph properties, such as biconnected components and articulation points, to generate sequence segments common to the enzyme sequences. Then amino acid subsequences in the common shared regions are aligned and then an information theoretic approach called aggregated column related scoring scheme is performed to highlight potential active sites in enzyme sequences. The aggregated information content scoring scheme is shown to be effective to highlight residues of active sites effectively. The proposed method of combining the clustering and the aggregated information content scoring methods was successful in highlighting known catalytic sites in enzymes of Escherichia coli K12 in terms of the Catalytic Site Atlas database. Our method is shown to be not only accurate in predicting potential active sites in the enzyme sequences but also computationally efficient since the clustering approach utilizes two graph properties that can be computed in linear to the number of edges in the sequence graph and computation of mutual information does not require much time. We believe that the proposed method can be useful for identifying active sites of enzyme sequences from many genome projects.
authors: Division of Experimental Hematology and Cancer Biology, Cincinnati Children's Hospital Medical Center, 3333 Burnet Avenue, Cincinnati, Ohio 45229, USA. kwangmin.choi.phd@gmail.com
authors: Kwangmin
authors: K
authors: Choi
authors: Sun
authors: S
authors: Kim
mesh_terms: D000465:Algorithms; D020134:Catalytic Domain / Q000235:genetics; D016000:Cluster Analysis; D019295:Computational Biology; D017124:Conserved Sequence; D030562:Databases, Protein; D004798:Enzymes / Q000737:chemistry* / Q000145:classification / Q000235:genetics / Q000378:metabolism; D048168:Escherichia coli K12 / Q000201:enzymology / Q000235:genetics; D029968:Escherichia coli Proteins / Q000737:chemistry / Q000235:genetics / Q000378:metabolism; D023281:Genomics / Q000706:statistics & numerical data; D008958:Models, Molecular; D016415:Sequence Alignment / Q000706:statistics & numerical data
chemical_list: D004798:Enzymes; D029968:Escherichia coli Proteins