• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2013 Fiscal Year Final Research Report

Analysis of gene regulatory networks in Boolean models

Research Project

  • PDF
Project/Area Number 23700017
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeMulti-year Fund
Research Field Fundamental theory of informatics
Research InstitutionKyoto University

Principal Investigator

TAMURA Takeyuki  京都大学, 化学研究所, 助教 (00437261)

Project Period (FY) 2011 – 2012
Keywords遺伝子制御ネットワーク / ブーリアンモデル / 定常状態 / アルゴリズム / 数理モデル
Research Abstract

The Boolean network (BN) is a discrete mathematical model for describing regulatory relationship of genes in cells. Although problems for finding stable states of BNs and control strategies are known to be NP-hard, they are often solvable for middle size networks due to recent high performance computing vie exact algorithms and/or integer programming-based methods.
In this research, exact algorithms for finding attractors of period 2 were developed. Furthermore, integer programming-based methods were developed for problems for finding singleton attractors, control of BNs, and control of attractors.

  • Research Products

    (12 results)

All 2014 2013 2012 Other

All Journal Article (7 results) Presentation (3 results) Book (1 results) Remarks (1 results)

  • [Journal Article] A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Preliminary version has appeared in MFCS 2012)2013

    • Author(s)
      Tatsuya Akutsu and Takeyuki Tamura
    • Journal Title

      Algorithms

      Volume: Vol.6 Pages: 119-135

    • DOI

      10.3390/a6010119

  • [Journal Article] Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming (Preliminary version has appeared in BIBM 2010)2013

    • Author(s)
      Xi Chen, Tatsuya Akutsu, Takeyuki Tamura and Wai-Ki Ching
    • Journal Title

      International Journal of Data Mining and Bioinformatics

      Volume: Vol.7, No.3 Pages: 321-343

    • DOI

      10.1504/IJDMB.2013.053306

  • [Journal Article] Network completion using dynamic programming and least-squares fitting2012

    • Author(s)
      Natsu Nakajima, Takeyuki Tamura, Yoshihiro Yamanishi, Katsuhisa Horimoto and Tatsuya Akutsu
    • Journal Title

      The Scientific World Journal

      Volume: Volume 2012, Article ID 957620 Pages: 8

    • DOI

      10.1100/2012/957620

  • [Journal Article] Integer programming-based approach to attractor detection and control of Boolean networks (Preliminary version has appeared in CDC/CCC 2009)2012

    • Author(s)
      Tatsuya Akutsu, Yang Zhao, Morihiro Hayashida and Takeyuki Tamura
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: Vol.E95-D, No.12 Pages: 2960-2970

    • DOI

      10.1587/transinf.E95.D.2960

  • [Journal Article] A clique-based method using dynamic programming for computing edit distance between unordered trees2012

    • Author(s)
      Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita and Tatsuya Akutsu
    • Journal Title

      Journal of Computational Biology

      Volume: 19(10) Pages: 1089-1104

    • DOI

      10.1089/cmb.2012.0133

  • [Journal Article] Finding a periodic attractor of a Boolean network2012

    • Author(s)
      Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman and Takeyuki Tamura
    • Journal Title

      IEEE/ACM Transactions on Computational Biology and Bioinformatics

      Volume: Vol.9 Pages: 1410-1421

    • DOI

      10.1109/TCBB.2012.87

  • [Journal Article] Singleton and 2-periodic attractors of sign-definite Boolean networks2012

    • Author(s)
      Tatsuya Akutsu, Avraham A. Melkman and Takeyuki Tamura
    • Journal Title

      Information Processing Letters

      Volume: Vol.112, Issues 1-2 Pages: 35-38

    • DOI

      10.1016/j.ipl.2011.10.002

  • [Presentation] On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree, Proc2012

    • Author(s)
      Tatsuya Akutsu and Takeyuki Tamura
    • Organizer
      23rd International Symposium on Algorithms and Computation (ISAAC 2012)
    • Place of Presentation
      台湾台北市(pp.146--155)
    • Year and Date
      2012-12-19
  • [Presentation] A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree, Proc2012

    • Author(s)
      Tatsuya Akutsu and Takeyuki Tamura
    • Organizer
      37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012)
    • Place of Presentation
      スロバキア・ブラティスラバ市(pp.76--87)
    • Year and Date
      2012-08-30
  • [Presentation] Efficient exponential time algorithms for edit distance between unordered trees, Proc2012

    • Author(s)
      Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa and Atsuhiro Takasu
    • Organizer
      23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012)
    • Place of Presentation
      フィンランド・ヘルシンキ市(pp.360--372)
    • Year and Date
      2012-07-05
  • [Book] Theory and method of completion for a Boolean regulatory network using observed data, Biological Data Mining and Its Applications in Healthcare2014

    • Author(s)
      Takeyuki Tamura and Tatsuya Akutsu
    • Total Pages
      123-146
    • Publisher
      World Scientific
  • [Remarks]

    • URL

      http://sunflower.kuicr.kyoto-u.ac.jp/~tamura/

URL: 

Published: 2015-06-25  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi