Detection of Conserved Domains in Protein Sequences Using a Maximum-Density Subgraph Algorithm(Special Section on Discrete Mathematics and Its Applications)

概要

論文の詳細を見る
In this paper, we propose a method for detecting conserved domains from a set of amino acid sequences that belong to a protein family. This method detects the domains as follows: first, generate fixed-length subsequences from the sequences; second, construct a weighted graph that connects any two of the subsequences (vertices) having higher similarity than a pre-defined threshold; third, search for the maximum-density subgraph for each connected component of the graph; finally, explore conserved domains in the sequences by combining the results of the previous step. From the performance results obtained by applying the method to several protein families that have complex conserved domains, we found that our method was able to detect those domains even though some domains were weakly conserved.
一般社団法人電子情報通信学会の論文
2000-04-25