A Method for Extracting Common Conserved Regions from Amino Acid Sequences using Maximum-Density Subgraph Search Algorithm

5 References
  • TAKETANI Hideyasu
    Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University
  • TANI Hideki
    Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University
  • MATSUDA Hideo
    Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University
  • HASHIMOTO Akihiro
    Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University

Bibliographic Information

Other Title
  • 最大密度部分グラフ探索アルゴリズムを用いたアミノ酸配列集合からの共通保存領域の抽出手法

Search this article

Description

In this paper, we propose a method for extracting common conserved regions from a set of amino acid sequences that belongs to a protein family. This method extracts such regions: first, generate blocks of a fixed length from the sequences then construct a graph whose nodes are the blocks and whose edges are links between any two of the blocks with similarity scores of the two blocks; second, explore common conserved regions by searching for the maximum density subgraph from the graph. The effectiveness of our method is demonstrated by the results applying the method to two protein families that have complex structure of their conserved regions.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 20 49-54, 1998-07-24

    Information Processing Society of Japan (IPSJ)

References(5)*help

See more

Details 詳細情報について

  • CRID
    1571980077129535104
  • NII Article ID
    110002936315
  • NII Book ID
    AN10505667
  • ISSN
    09196072
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top