Network completion using dynamic programming and least-squares fitting

Natsu Nakajima, Takeyuki Tamura, Yoshihiro Yamanishi, Katsuhisa Horimoto, Tatsuya Akutsu

研究成果: Contribution to journalArticle査読

12 被引用数 (Scopus)

抄録

We consider the problem of network completion, which is to make the minimum amount of modifications to a given network so that the resulting network is most consistent with the observed data. We employ here a certain type of differential equations as gene regulation rules in a genetic network, gene expression time series data as observed data, and deletions and additions of edges as basic modification operations. In addition, we assume that the numbers of deleted and added edges are specified. For this problem, we present a novel method using dynamic programming and least-squares fitting and show that it outputs a network with the minimum sum squared error in polynomial time if the maximum indegree of the network is bounded by a constant. We also perform computational experiments using both artificially generated and real gene expression time series data.

本文言語英語
論文番号957620
ジャーナルThe Scientific World Journal
2012
DOI
出版ステータス出版済み - 2012

All Science Journal Classification (ASJC) codes

  • Biochemistry, Genetics and Molecular Biology(all)
  • Environmental Science(all)

フィンガープリント 「Network completion using dynamic programming and least-squares fitting」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル