九州大学 研究者情報
研究者情報 (研究者の方へ)入力に際してお困りですか?
基本情報 研究活動 教育活動 社会活動
丸山 修(まるやま おさむ) データ更新日:2018.06.02

准教授 /  芸術工学研究院 デザイン人間科学部門 モデリング・最適化


主な研究テーマ
システム・バイオロジー,Computational Biology
キーワード:タンパク質間相互作用,遺伝子制御ネットワーク,アルゴリズム,パターン認識,機械学習
1996.04.
研究業績
主要著書
1. 丸山 修,阿久津 達也, バイオインフォマティクス—配列データ解析と構造予測 (シリーズ予測と発見の科学 4) , 朝倉書店, 2007.05.
主要原著論文
1. Osamu Maruyama, Yuki Kuwahara, RocSampler: Regularizing Overlapping Protein Complexes in Protein-Protein Interaction Networks, BMC Bioinformatics, 10.1186/s12859-017-1920-5, 18, 51-62, 491, 2017.12, [URL], BackgroundIn recent years, protein-protein interaction (PPI) networks have been well recognized as important resources to elucidate various biological processes and cellular mechanisms. In this paper, we address the problem of predicting protein complexes from a PPI network. This problem has two difficulties. One is related to small complexes, which contains two or three components. It is relatively difficult to identify them due to their simpler internal structure, but unfortunately complexes of such sizes are dominant in major protein complex databases, such as CYC2008. Another difficulty is how to model overlaps between predicted complexes, that is, how to evaluate different predicted complexes sharing common proteins because CYC2008 and other databases include such protein complexes. Thus, it is critical how to model overlaps between predicted complexes to identify them simultaneously.ResultsIn this paper, we propose a sampling-based protein complex prediction method, RocSampler (Regularizing Overlapping Complexes), which exploits, as part of the whole scoring function, a regularization term for the overlaps of predicted complexes and that for the distribution of sizes of predicted complexes. We have implemented RocSampler in MATLAB and its executable file for Windows is available at the site, http://imi.kyushu-u.ac.jp/~om/software/RocSampler/.ConclusionsWe have applied RocSampler to five yeast PPI networks and shown that it is superior to other existing methods. This implies that the design of scoring functions including regularization terms is an effective approach for protein complex prediction..
2. Osamu Maruyama, Limsoon Wong, Regularizing predicted complexes by mutually exclusive protein-protein interactions, Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, 1068-1075, 2015.08, Protein complexes are key entities in the cell respon-
sible for various cellular mechanisms and biological processes. We
propose here a method for predicting protein complexes from
a protein-protein interaction (PPI) network, using information
on mutually exclusive PPIs. If two interactions are mutually
exclusive, they are not allowed to exist simultaneously in the
same predicted complex. We introduce a new regularization term
which checks whether predicted complexes are connected by mu-
tually exclusive PPIs. This regularization term is added into the
scoring function of our earlier protein complex prediction tool,
PPSampler2. We show that PPSampler2 with mutually exclusive
PPIs outperforms the original one. Furthermore, the performance
is superior to well-known representative conventional protein
complex prediction methods. Thus, it is is effective to use mutual
exclusiveness of PPIs in protein complex prediction..
3. So Kobiki, Osamu Maruyama, ReSAPP: Predicting overlapping protein complexes by merging multiple-sampled partitions of proteins, Journal of bioinformatics and computational biology, 12, 6, 1442004, 2014.12.
4. Chern Han Yong, Osamu Maruyama, Limsoon Wong, Discovery of small protein complexes from PPI networks with size-specific supervised weighting, BMC systems biology 8, S3-S3, 2014., 2014.12.
5. Osamu Maruyama, Shota Shikita, A scale-free structure prior for Bayesian inference of Gaussian graphical models, IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 2014. , 2014.11.
6. Chasanah Kusumastuti Widita, Osamu Maruyama, PPSampler2: Predicting Protein Complexes More Accurately and Efficiently by Sampling, BMC Systems Biology, 7, Suppl 6, S14, 2013.12, The problem of predicting sets of components of heteromeric protein complexes is a challenging problem in
Systems Biology. There have been many tools proposed to predict those complexes. Among them, PPSampler, a
protein complex prediction algorithm based on the Metropolis-Hastings algorithm, is reported to outperform other
tools. In this work, we improve PPSampler by refining scoring functions and a proposal distribution used inside the
algorithm so that predicted clusters are more accurate as well as the resulting algorithm runs faster. The new
version is called PPSampler2. In computational experiments, PPSampler2 is shown to outperform other tools
including PPSampler. The F-measure score of PPSampler2 is 0.67, which is at least 26% higher than those of the
other tools. In addition, about 82% of the predicted clusters that are unmatched with any known complexes are
statistically significant on the biological process aspect of Gene Ontology. Furthermore, the running time is
reduced to twenty minutes, which is 1/24 of that of PPSampler..
7. Daisuke Tatsuke, Osamu Maruyama, Sampling Strategy for Protein Complex Prediction Using Cluster Size Frequency, Gene, Special issue of the 23rd International Conference on Genome Informatics (GIW), 2012.12, In this paper we propose a Markov chain Monte Carlo sampling method for
predicting protein complexes from protein-protein interactions (PPIs). Many
of the existing tools for this problem are designed more or less based on a
density measure of a subgraph of the PPI network. This kind of measures
is less effective for smaller complexes. On the other hand, it can be found
that the number of complexes of a size in a database of protein complexes
follows a power-law. Thus, most of the complexes are small-sized. For example,
in CYC2008, a database of curated protein complexes of yeast, 42% of
the complexes are heterodimeric, i.e., a complex consisting of two different
proteins. In this work, we propose a protein complex prediction algorithm,
called PPSampler (Proteins’ Partition Sampler), which is designed based on
the Metropolis-Hastings algorithm using a parameter representing a target
value of the relative frequency of the number of predicted protein complexes
of a particular size. In a performance comparison, PPSampler outperforms
other existing algorithms. Furthermore, about half of the predicted clusters
that are not matched with any known complexes in CYC2008 are statistically
significant by Gene Ontology terms. Some of them can be expected to
be true complexes..
8. Osamu Maruyama, Heterodimeric Protein Complex Identification, ACM Conference on Bioinformatics, Computational Biology and Biomedicine 2011, 2011.08.
9. Osamu Maruyama and Ayaka Chihara, NWE: Node-Weighted Expansion for Protein Complex Prediction Using Random Walk Distances, Proc. IEEE International Conference on Bioinformatics & Biomedicine (IEEE BIBM 2010), 590-594, 2010.12.
10. Yukio Yasukochi, Osamu Maruyama, Milind C. Mahajan, Carolyn Pad- den, Ghia M. Euskirchen, Vincent Schulz, Hideki Hirakawa, Satoru Kuhara, Xing-Hua Pan, Peter E. Newburger, Michael Snyder, and Sherman M. Weiss- man, X chromosome-wide analyses of genomic DNA methylation states and
gene expression in male and female neutrophils
, Proceedings of the National Academy of Sciences of the United States of America (PNAS), 107, 3704-3709, 2010.02.
11. Osamu Maruyama, Hideki Hirakawa, Takao Iwayanagi, Yoshiko Ishida, Shizu Takeda, Jun Otomo, Satoru Kuhara, Evaluating Protein Sequence Signatures Inferred
from Protein-Protein Interaction Data by Gene Ontology Annotations, 2008 IEEE International Conference on Bioinformatics and Biomedicine, 417-420, 2008.11.
12. Osamu Maruyama, Akiko Matsuda, and Satoru Kuhara, Reconstructing phylogenetic trees of prokaryote genomes by randomly sampling oligopeptides, International Journal of Bioinformatics Research and Applicaions (IJBRA) 1(4), 429-446, 2005.
(preliminary version has appeared in the Proceedings of the 5th International Conference on Computational Science (ICCS 2005), Lecture Notes in Computer Science 3514-6, Springer-Verlag, II-911-918, 2005).
, 2005.11.
13. Daichi Shigemizu and Osamu Maruyama., Searching for Regulatory Elements of Alternative Splicing Events Using Phylogenetic Footprinting,, Proceedings of the 4th Workshop on Algorithms in Bioinformatics, Lecture
Notes in Bioinformatics 3240, Springer-Verlag
, 3240, 147-158, 147-158, 2004.09.
14. Osamu Maruyama, Extensive Search for Discriminative Features of Alternative Splicing, Pacific Symposium on Biocomputing 2004, 54-65, 54-65, 2004.01.
15. Osamu Maruyama, Finding optimal degenerate patterns in DNA sequences, Bioinformatics, 10.1093/bioinformatics/btg1079, 19, II206-II214, 19(supplement 2), 206-214, 2003.09.
主要学会発表等
1. Osamu Maruyama, Limsoon Wong, Regularizing predicted complexes by mutually exclusive protein-protein interactions, International Symposium on Network Enabled Health Informatics, Biomedicine and Bioinformatics, HI-BI-BI 2015, 2015.08, [URL], Protein complexes are key entities in the cell responsible for various cellular mechanisms and biological processes. We
propose here a method for predicting protein complexes from
a protein-protein interaction (PPI) network, using information
on mutually exclusive PPIs. If two interactions are mutually
exclusive, they are not allowed to exist simultaneously in the
same predicted complex. We introduce a new regularization term
which checks whether predicted complexes are connected by mu-
tually exclusive PPIs. This regularization term is added into the
scoring function of our earlier protein complex prediction tool,
PPSampler2. We show that PPSampler2 with mutually exclusive
PPIs outperforms the original one. Furthermore, the performance
is superior to well-known representative conventional protein
complex prediction methods. Thus, it is is effective to use mutual
exclusiveness of PPIs in protein complex prediction..
2. Tatsuke Daisuke, Osamu Maruyama, Sampling Strategy for Protein Complex Prediction Using Cluster Size Frequency, The 23rd International Conference on Genome Informatics, 2012.12, [URL], In this paper we propose a Markov chain Monte Carlo sampling method for
predicting protein complexes from protein-protein interactions (PPIs). Many
of the existing tools for this problem are designed more or less based on a
density measure of a subgraph of the PPI network. This kind of measures
is less effective for smaller complexes. On the other hand, it can be found
that the number of complexes of a size in a database of protein complexes
follows a power-law. Thus, most of the complexes are small-sized. For example,
in CYC2008, a database of curated protein complexes of yeast, 42% of
the complexes are heterodimeric, i.e., a complex consisting of two different
proteins. In this work, we propose a protein complex prediction algorithm,
called PPSampler (Proteins’ Partition Sampler), which is designed based on
the Metropolis-Hastings algorithm using a parameter representing a target
value of the relative frequency of the number of predicted protein complexes
of a particular size. In a performance comparison, PPSampler outperforms
other existing algorithms. Furthermore, about half of the predicted clusters
that are not matched with any known complexes in CYC2008 are statistically
significant by Gene Ontology terms. Some of them can be expected to
be true complexes..
3. Osamu Maruyama, Evaluating Protein Sequence Signatures Inferred
from Protein-Protein Interaction Data by Gene Ontology Annotations, 2008 IEEE International Conference on Bioinformatics and Biomedicine, 2008.11, [URL].
作品・ソフトウェア・データベース等
1. Osamu Maruyama and Daisuke Tatsuke, PPSampler, 2013.06, PPSampler is a sampling algorithm for predicting protein complexes from a protein-protein interaction network..
学会活動
所属学会名
電子情報通信学会
International Society for Computational Biology
日本バイオインフォマティクス学会
学会大会・会議・シンポジウム等における役割
2012.12.12~2012.12.14, GIW, 座長(Chairmanship).
2010.12.13~2010.12.15, 2010年日本バイオインフォマティクス学会年会, 座長(Chairmanship).
2012.08.09~2012.08.09, 第30回情報処理学会バイオ情報学研究会, 座長(Chairmanship).
2012.01.01~2012.12.31, International Conference on Genome Informatics (GIW), プログラム委員.
2007.01.01~2012.12.31, International Symposium on Bioinformatics Research and Applications, プログラム委員.
2007.01.01~2012.12.31, IEEE International Conference on Bioinformaticsand Biomedicine, プログラム委員.
2006.05.28~2011.05.31, International Workshop on Bioinformatics Research and Applications, プログラム委員.
2010.12.13~2010.12.15, 2010年日本バイオインフォマティクス学会年会, 組織委員会委員.
学会誌・雑誌・著書の編集への参加状況
2006.03, Journal of Computational Intelligence in Bioinformatics (JCIB), 国際, 編集委員.
学術論文等の審査
年度 外国語雑誌査読論文数 日本語雑誌査読論文数 国際会議録査読論文数 国内会議録査読論文数 合計
2010年度
2009年度
その他の研究活動
海外渡航状況, 海外での教育研究歴
Queensland Univ., Australia, 2006.07~2007.09.
受賞
(財)電気通信普及財団 第9回 テレコムシステム技術学生賞佳作, (財)電気通信普及財団, 1994.03.
研究資金
科学研究費補助金の採択状況(文部科学省、日本学術振興会)
2017年度~2019年度, 基盤研究(C), 代表, 混合正則化モデリングを軸としたヘテロ生物データ群からの機械学習の研究.
2014年度~2016年度, 基盤研究(C), 代表, 大規模バイオデータに対する混合正則化モデリングと最適化サンプリング技法の研究.
2004年度~2006年度, 若手研究(B), 代表, ヘテロな検索空間に対する最適パターン探索アルゴリズムの構築とゲノムデータへの適用.
2001年度~2002年度, 奨励研究(A), 代表, 属性の創造と探索によるDNAシグナル配列発見方式の研究.
1997年度~1998年度, 奨励研究(A), 代表, グラフの局所情報からのグラフを復元するためのグラフ形成規則の定式化と学習方式の研究.
日本学術振興会への採択状況(科学研究費補助金以外)
2007年度~2007年度, 特定国派遣, 代表, モチーフ発見の理論的限界.

九大関連コンテンツ

pure2017年10月2日から、「九州大学研究者情報」を補完するデータベースとして、Elsevier社の「Pure」による研究業績の公開を開始しました。
 
 
九州大学知的財産本部「九州大学Seeds集」