Access count of this item: 234

Files in This Item:
File Description SizeFormat 
djohk00551.pdfDissertation_全文2.58 MBAdobe PDFView/Open
yjohk00551.pdfAbstract_要旨129.73 kBAdobe PDFView/Open
Title: Genetic Network Completion Using Dynamic Programming and Least-Squares Fitting
Other Titles: 動的計画法と最小二乗法を用いた遺伝子ネットワーク補完
Authors: Nakajima, Natsu
Author's alias: 仲嶋, なつ
Keywords: Gene regulatory networks
Differential equations
Dynamic programming
Least-squares fitting
Time-varying genetic networks
Polynomial-time algorithms
Issue Date: 23-Jan-2015
Publisher: 京都大学 (Kyoto University)
Conferring University: Kyoto University (京都大学)
Degree Level: 新制・課程博士
Degree Discipline: 博士(情報学)
Degree Report no.: 甲第18701号
Degree no.: 情博第551号
Degree Call no.: 新制||情||97(附属図書館)
Degree Serial no.: 31634
Degree Affiliation: 京都大学大学院情報学研究科知能情報学専攻
Examination Committee members: (主査)教授 阿久津 達也, 教授 山本 章博, 教授 岡部 寿男
Provisions of the Ruling of Degree: 学位規則第4条第1項該当
DOI: 10.14989/doctor.k18701
URI: http://hdl.handle.net/2433/195987
Appears in Collections:Doctoral Dissertation (Informatics)

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.