田村 武幸

最終更新日時: 2019/10/25 16:28:32

印刷する

氏名(漢字／フリガナ／アルファベット表記)
田村 武幸／タムラ タケユキ／Tamura, Takeyuki
所属部署・職名(部局／所属／講座等／職名)
化学研究所／化学研究所附属バイオインフォマティクスセンター／　／准教授
協力講座
部局 所属 講座等 職名
情報学研究科 知能情報学専攻 生命システム情報学 准教授
所属学会(国内)
学会名(日本語) 学会名(英語)
日本バイオインフォマティクス学会
情報処理学会
電子情報通信学会
所属学会(海外)
学会名(英語) 国名
International Society for Computational Biology
取得学位
学位名(日本語) 学位名(英語) 大学(日本語) 大学(英語) 取得区分
修士(情報学) 京都大学
博士(情報学) 京都大学
出身大学院・研究科等
大学名(日本語) 大学名(英語) 研究科名(日本語) 研究科名(英語) 専攻名(日本語) 専攻名(英語) 修了区分
京都大学 大学院情報学研究科修士課程通信情報システム専攻 修了
京都大学 大学院情報学研究科博士後期課程通信情報システム専攻 修了
出身学校・専攻等
大学名(日本語) 大学名(英語) 学部名(日本語) 学部名(英語) 学科名(日本語) 学科名(英語) 卒業区分
京都大学 工学部情報学科 卒業
出身高等学校
高等学校名 ふりがな
東大寺学園高校
職歴
期間 組織名(日本語) 組織名(英語) 職名(日本語) 職名(英語)
2006/04/01〜2007/11/30 京都大学化学研究所バイオインフォマティクスセンター Bioinformatics Center, Institute for Chemical Research, Kyoto University 博士研究員 Postdoctoral Fellow
2007/12/01〜2017/09/30 京都大学化学研究所バイオインフォマティクスセンター Bioinformatics Center, Institute for Chemical Research, Kyoto University 助教 Assistant Professor
2017/10/01〜 京都大学化学研究所バイオインフォマティクスセンター Bioinformatics Center, Institute for Chemical Research, Kyoto University 准教授 Associate Professor
プロフィール
(日本語)
2006年京都大学大学院情報学研究科 博士課程修了。 京都大学博士(情報学)。2006年4月より京都大学 化学研究所附属バイオインフォマティクスセンター にて博士研究員。2007年12月より助教、2017年10月より准教授。 専門はバイオインフォマティクスのアルゴリズム。 主に代謝ネットワークや遺伝子制御ネットワークの制御や 設計に関するアルゴリズムの研究を行っている。
(英語)
Takeyuki Tamura received B.E., M.E. and Ph.D. degrees in informatics from Kyoto University, Japan, in 2001, 2003, and 2006, respectively. He joined Bioinformatics Center, Institute for Chemical Research, Kyoto University as a postdoctoral fellow in April, 2006. He worked as an assistant professor from December 2007 to September 2017. From October 2017, he works as an associate professor. His research interests are bioinformatics and the theory of combinatorial optimization for graphs and networks. The current research topics include control and design of metabolic networks and gene regulatory networks.
使用言語
言語名(japanese) 言語名(english) コード
英語
個人ホームページ
URL
http://sunflower.kuicr.kyoto-u.ac.jp/~tamura/
http://rdb.kuicr.kyoto-u.ac.jp/researchers/view/tamura+takeyuki
ORCID ID
https://orcid.org/0000-0003-1596-901X
researchmap URL
https://researchmap.jp/read0123955
研究テーマ
(日本語)
バイオインフォマティクスのアルゴリズム理論
(英語)
Algorithms for Bioinformatics
研究概要
(日本語)
代謝ネットワークや遺伝子制御ネットワークの設計と制御に関するアルゴリズム
(英語)
Algorithms for design and control of metabolic networks and gene regulatory networks
研究分野（キーワード）
キーワード(日本語) キーワード(英語)
バイオインフォマティクス bioinformatics
アルゴリズム algorithm
代謝ネットワーク metabolic network
遺伝子制御ネットワーク gene regulatory network
論文
著者 著者(日本語) 著者(英語) タイトル タイトル(日本語) タイトル(英語) 書誌情報等 書誌情報等(日本語) 書誌情報等(英語) 出版年月 査読の有無 記述言語 掲載種別 公開
Takeyuki Tamura, Wei Lu, Jiangning song, Tatsuya Akutsu Takeyuki Tamura, Wei Lu, Jiangning song, Tatsuya Akutsu Takeyuki Tamura, Wei Lu, Jiangning Song, Tatsuya Akutsu Computing Minimum Reaction Modifications in a Boolean Metabolic Network. Computing Minimum Reaction Modifications in a Boolean Metabolic Network. Computing Minimum Reaction Modifications in a Boolean Metabolic Network. IEEE/ACM Trans. Comput. Biology Bioinform., 15, 6, 1853-1862 IEEE/ACM Trans. Comput. Biology Bioinform., 15, 6, 1853-1862 IEEE/ACM Trans. Comput. Biology Bioinform., 15, 6, 1853-1862 2018/11 有 英語 研究論文(学術雑誌) 公開
Tamura T Tamura T Tamura T Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. BMC bioinformatics, 19, 1, 325 BMC bioinformatics, 19, 1, 325 BMC bioinformatics, 19, 1, 325 2018/09/14 有 英語 研究論文(学術雑誌) 公開
Bao Y, Marini S, Tamura T, Kamada M, Maegawa S, Hosokawa H, Song J, Akutsu T Bao Y, Marini S, Tamura T, Kamada M, Maegawa S, Hosokawa H, Song J, Akutsu T Bao Y, Marini S, Tamura T, Kamada M, Maegawa S, Hosokawa H, Song J, Akutsu T Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features. Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features. Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features. Briefings in bioinformatics Briefings in bioinformatics Briefings in bioinformatics 2018/05 有 英語 研究論文(学術雑誌) 公開
Tatsuya Akutsu,Colin de la Higuera,Takeyuki Tamura Tatsuya Akutsu,Colin de la Higuera,Takeyuki Tamura Tatsuya Akutsu,Colin de la Higuera,Takeyuki Tamura A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, 10:1-10:12 Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, 10:1-10:12 Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, 10:1-10:12 2018 有 英語 研究論文(国際会議プロシーディングス) 公開
Tatsuya Akutsu,Jesper Jansson,Ruiming Li,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Jesper Jansson,Ruiming Li,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Jesper Jansson,Ruiming Li,Atsuhiro Takasu,Takeyuki Tamura New and Improved Algorithms for Unordered Tree Inclusion. New and Improved Algorithms for Unordered Tree Inclusion. New and Improved Algorithms for Unordered Tree Inclusion. 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 27:1-27:12 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 27:1-27:12 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 27:1-27:12 2018 有 公開
Xiaoqing Cheng,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu Xiaoqing Cheng,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu Xiaoqing Cheng,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu Discrimination of singleton and periodic attractors in Boolean networks. Discrimination of singleton and periodic attractors in Boolean networks. Discrimination of singleton and periodic attractors in Boolean networks. Automatica, 84, 205-213 Automatica, 84, 205-213 Automatica, 84, 205-213 2017/10 有 英語 研究論文(学術雑誌) 公開
Tatsuya Akutsu,Array,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Array,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Array,Atsuhiro Takasu,Takeyuki Tamura On the parameterized complexity of associative and commutative unification. On the parameterized complexity of associative and commutative unification. On the parameterized complexity of associative and commutative unification. Theor. Comput. Sci., 660, 57-74 Theor. Comput. Sci., 660, 57-74 Theor. Comput. Sci., 660, 57-74 2017/01/17 有 英語 研究論文(学術雑誌) 公開
Wenpin Hou,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu Wenpin Hou,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu Wenpin Hou,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu Finding and Analyzing the Minimum Set of Driver Nodes in control of Boolean Networks. Finding and Analyzing the Minimum Set of Driver Nodes in control of Boolean Networks. Finding and Analyzing the Minimum Set of Driver Nodes in control of Boolean Networks. Advances in Complex Systems, 19, 3, 1-32 Advances in Complex Systems, 19, 3, 1-32 Advances in Complex Systems, 19, 3, 1-32 2016 有 英語 研究論文(学術雑誌) 公開
Takeyuki Tamura,Tatsuya Akutsu,Chun-Yu Lin,Jinn-Moon Yang Takeyuki Tamura,Tatsuya Akutsu,Chun-Yu Lin,Jinn-Moon Yang Takeyuki Tamura,Tatsuya Akutsu,Chun-Yu Lin,Jinn-Moon Yang Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks. Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks. Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks. 16th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2016, Taichung, Taiwan, October 31 - November 2, 2016, 2016, BIBE, 63-63 16th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2016, Taichung, Taiwan, October 31 - November 2, 2016, 2016, BIBE, 63-63 16th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2016, Taichung, Taiwan, October 31 - November 2, 2016, 2016, BIBE, 63-63 2016 有 英語 研究論文(学術雑誌) 公開
Tomoya Mori,Atsuhiro Takasu,Array,Jaewook Hwang,Takeyuki Tamura,Tatsuya Akutsu Tomoya Mori,Atsuhiro Takasu,Array,Jaewook Hwang,Takeyuki Tamura,Tatsuya Akutsu Tomoya Mori,Atsuhiro Takasu,Array,Jaewook Hwang,Takeyuki Tamura,Tatsuya Akutsu Similar subtree search using extended tree inclusion. Similar subtree search using extended tree inclusion. Similar subtree search using extended tree inclusion. 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016, 1558-1559 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016, 1558-1559 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016, 1558-1559 2016 有 英語 研究論文(国際会議プロシーディングス) 公開
Tomoya Mori,Atsuhiro Takasu,Array,Jaewook Hwang,Takeyuki Tamura,Tatsuya Akutsu Tomoya Mori,Atsuhiro Takasu,Array,Jaewook Hwang,Takeyuki Tamura,Tatsuya Akutsu Tomoya Mori,Atsuhiro Takasu,Array,Jaewook Hwang,Takeyuki Tamura,Tatsuya Akutsu Similar Subtree Search Using Extended Tree Inclusion. Similar Subtree Search Using Extended Tree Inclusion. Similar Subtree Search Using Extended Tree Inclusion. IEEE Trans. Knowl. Data Eng., 27, 12, 3360-3373 IEEE Trans. Knowl. Data Eng., 27, 12, 3360-3373 IEEE Trans. Knowl. Data Eng., 27, 12, 3360-3373 2015/12 有 英語 研究論文(学術雑誌) 公開
Wei Lu*, Takeyuki Tamura*, Jiangning Song, and Tatsuya Akutsu, (* joint first authors) Wei Lu*, Takeyuki Tamura*, Jiangning Song, and Tatsuya Akutsu, (* joint first authors) Wei Lu*, Takeyuki Tamura*, Jiangning Song, and Tatsuya Akutsu, (* joint first authors) Computing smallest intervention strategies for multiple metabolic networks in a Boolean model Computing smallest intervention strategies for multiple metabolic networks in a Boolean model Computing smallest intervention strategies for multiple metabolic networks in a Boolean model Journal of Computational Biology, 22, 2, 85-110 Journal of Computational Biology, 22, 2, 85-110 Journal of Computational Biology, 22, 2, 85-110 2015/02 有 英語 研究論文(学術雑誌) 公開
Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao and Tatsuya Akutsu Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao and Tatsuya Akutsu Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao and Tatsuya Akutsu A fixed-parameter algorithm for detecting a singleton attractor in an AND/OR Boolean network with bounded treewidth A fixed-parameter algorithm for detecting a singleton attractor in an AND/OR Boolean network with bounded treewidth A fixed-parameter algorithm for detecting a singleton attractor in an AND/OR Boolean network with bounded treewidth IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E98.A, 1, 384-390 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E98.A, 1, 384-390 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E98.A, 1, 384-390 2015/01 有 英語 研究論文(学術雑誌) 公開
Tatsuya Akutsu,Takeyuki Tamura,Avraham A. Melkman,Atsuhiro Takasu Tatsuya Akutsu,Takeyuki Tamura,Avraham A. Melkman,Atsuhiro Takasu Tatsuya Akutsu,Takeyuki Tamura,Avraham A. Melkman,Atsuhiro Takasu On the complexity of finding a largest common subtree of bounded degree. On the complexity of finding a largest common subtree of bounded degree. On the complexity of finding a largest common subtree of bounded degree. Theor. Comput. Sci., 590, 2-16 Theor. Comput. Sci., 590, 2-16 Theor. Comput. Sci., 590, 2-16 2015 有 英語 研究論文(学術雑誌) 公開
Tamura T, Lu W, Akutsu T Tamura T, Lu W, Akutsu T Tamura T, Lu W, Akutsu T Computational Methods for Modification of Metabolic Networks. Computational Methods for Modification of Metabolic Networks. Computational Methods for Modification of Metabolic Networks. Computational and structural biotechnology journal, 13, 376-381 Computational and structural biotechnology journal, 13, 376-381 Computational and structural biotechnology journal, 13, 376-381 2015 有 英語 研究論文(学術雑誌) 公開
Rikiya Takeuchi, Takeyuki Tamura, Toru Nakayashiki, Yuichirou Tanaka, Ai Muto, Barry L. Wanner, and Hirotada Mori Rikiya Takeuchi, Takeyuki Tamura, Toru Nakayashiki, Yuichirou Tanaka, Ai Muto, Barry L. Wanner, and Hirotada Mori Rikiya Takeuchi, Takeyuki Tamura, Toru Nakayashiki, Yuichirou Tanaka, Ai Muto, Barry L. Wanner, and Hirotada Mori Colony-live --a high-throughput method for measuring microbial colony growth kinetics-- reveals diverse growth effects of gene knockouts in Escherichia coli Colony-live --a high-throughput method for measuring microbial colony growth kinetics-- reveals diverse growth effects of gene knockouts in Escherichia coli Colony-live --a high-throughput method for measuring microbial colony growth kinetics-- reveals diverse growth effects of gene knockouts in Escherichia coli BMC Microbiology, 14, 1, 171 BMC Microbiology, 14, 1, 171 BMC Microbiology, 14, 1, 171 2014/06 有 英語 研究論文(学術雑誌) 公開
Wei Lu*, Takeyuki Tamura*, Jiangning Song, and Tatsuya Akutsu, (* joint first authors) Wei Lu*, Takeyuki Tamura*, Jiangning Song, and Tatsuya Akutsu, (* joint first authors) Wei Lu*, Takeyuki Tamura*, Jiangning Song, and Tatsuya Akutsu, (* joint first authors) Integer Programming-based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model Integer Programming-based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model Integer Programming-based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model PLoS ONE, 9, 3, e92637 PLoS ONE, 9, 3, e92637 PLoS ONE, 9, 3, e92637 2014/03 有 英語 研究論文(学術雑誌) 公開
Yushan Qiu, Takeyuki Tamura, Wai-Ki Ching, and Tatsuya Akutsu Yushan Qiu, Takeyuki Tamura, Wai-Ki Ching, and Tatsuya Akutsu Yushan Qiu, Takeyuki Tamura, Wai-Ki Ching, and Tatsuya Akutsu On control of singleton attractors in multiple Boolean networks: integer programming-based method On control of singleton attractors in multiple Boolean networks: integer programming-based method On control of singleton attractors in multiple Boolean networks: integer programming-based method BMC Systems Biology, 8, S1:S7, S7 BMC Systems Biology, 8, S1:S7, S7 BMC Systems Biology, 8, S1:S7, S7 2014/01 有 英語 研究論文(学術雑誌) 公開
Tatsuya Akutsu,Takeyuki Tamura,Daiji Fukagawa,Atsuhiro Takasu Tatsuya Akutsu,Takeyuki Tamura,Daiji Fukagawa,Atsuhiro Takasu T. Akutsu; T. Tamura; D. Fukagawa; A. Takasu Efficient exponential-time algorithms for edit distance between unordered trees. Efficient exponential-time algorithms for edit distance between unordered trees. Efficient exponential-time algorithms for edit distance between unordered trees J. Discrete Algorithms, 25, 79-93 J. Discrete Algorithms, 25, 79-93 Journal of Discrete Algorithms, 25, 79-93 2014 有 英語 公開
Tatsuya Akutsu,Jesper Jansson,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Jesper Jansson,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Jesper Jansson,Atsuhiro Takasu,Takeyuki Tamura On the Parameterized Complexity of Associative and Commutative Unification. On the Parameterized Complexity of Associative and Commutative Unification. On the Parameterized Complexity of Associative and Commutative Unification. Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers, 8894, 15-27 Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers, 8894, 15-27 Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers, 8894, 15-27 2014 有 英語 研究論文(国際会議プロシーディングス) 公開
Hao Jiang,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu Hao Jiang,Takeyuki Tamura,Wai-Ki Ching,Tatsuya Akutsu H. Jiang; T. Tamura; W.-K. Ching; T. Akutsu On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors. On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors. On the complexity of inference and completion of boolean networks from given singleton attractors IEICE Transactions, E96-A, 11, 2265-2274 IEICE Transactions, E96-A, 11, 2265-2274 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E96-A, 11, 2265-2274 2013/11 有 英語 公開
Yang Zhao,Takeyuki Tamura,Tatsuya Akutsu,Jean-Philippe Vert Yang Zhao,Takeyuki Tamura,Tatsuya Akutsu,Jean-Philippe Vert Y. Zhao; T. Tamura; T. Akutsu; J.-P. Vert Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks. Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks. Flux balance impact degree: A new definition of impact degree to properly treat reversible reactions in metabolic networks Bioinformatics, 29, 17, 2178-2185 Bioinformatics, 29, 17, 2178-2185 Bioinformatics, 29, 17, 2178-2185 2013/09 有 英語 公開
Tatsuya Akutsu,Takeyuki Tamura Tatsuya Akutsu,Takeyuki Tamura T. Akutsu; T. Tamura A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded Degree Algorithms, 6, 1, 119-135 Algorithms, 6, 1, 119-135 Algorithms, 6, 1, 119-135 2013 有 英語 公開
Tatsuya Akutsu,Takeyuki Tamura,Atsuhiro Takasu Tatsuya Akutsu,Takeyuki Tamura,Atsuhiro Takasu Tatsuya Akutsu,Takeyuki Tamura,Atsuhiro Takasu On the Parameterized Complexity of Associative and Commutative Unification. On the Parameterized Complexity of Associative and Commutative Unification. On the Parameterized Complexity of Associative and Commutative Unification. CoRR, abs/1310.0919 CoRR, abs/1310.0919 CoRR, abs/1310.0919 2013 公開
Xi Chen,Tatsuya Akutsu,Takeyuki Tamura,Wai-Ki Ching Xi Chen,Tatsuya Akutsu,Takeyuki Tamura,Wai-Ki Ching X. Chen; T. Akutsu; T. Tamura; W.-K. Ching Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming. Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming. Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming IJDMB, 7, 3, 322-343 IJDMB, 7, 3, 322-343 International Journal of Data Mining and Bioinformatics, 7, 3, 322-343 2013 有 英語 公開
Tatsuya Akutsu,Takeyuki Tamura,Avraham A. Melkman,Atsuhiro Takasu Tatsuya Akutsu,Takeyuki Tamura,Avraham A. Melkman,Atsuhiro Takasu T. Akutsu; T. Tamura; A.A. Melkman; A. Takasu On the Complexity of Finding a Largest Common Subtree of Bounded Degree. On the Complexity of Finding a Largest Common Subtree of Bounded Degree. On the complexity of finding a largest common subtree of bounded degree Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, 8070, 4-15 Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, 8070, 4-15 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8070, 4-15 2013 有 英語 公開
Tomoya Mori,Takeyuki Tamura,Daiji Fukagawa,Atsuhiro Takasu,Etsuji Tomita,Tatsuya Akutsu Tomoya Mori,Takeyuki Tamura,Daiji Fukagawa,Atsuhiro Takasu,Etsuji Tomita,Tatsuya Akutsu Tomoya Mori,Takeyuki Tamura,Daiji Fukagawa,Atsuhiro Takasu,Etsuji Tomita,Tatsuya Akutsu A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees. A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees. A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees. Journal of Computational Biology, 19, 10, 1089-1104 Journal of Computational Biology, 19, 10, 1089-1104 Journal of Computational Biology, 19, 10, 1089-1104 2012/10 有 英語 公開
Akutsu T, Kosub S, Melkman AA, Tamura T Akutsu T, Kosub S, Melkman AA, Tamura T T. Akutsu; S. Kosub; A.A. Melkman; T. Tamura Finding a periodic attractor of a Boolean network. Finding a periodic attractor of a Boolean network. Finding a periodic attractor of a Boolean network IEEE/ACM transactions on computational biology and bioinformatics, 9, 5, 1410-1421 IEEE/ACM transactions on computational biology and bioinformatics, 9, 5, 1410-1421 IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9, 5, 1410-1421 2012/09 有 英語 公開
Tatsuya Akutsu,Sven Kosub,Avraham A. Melkman,Takeyuki Tamura Tatsuya Akutsu,Sven Kosub,Avraham A. Melkman,Takeyuki Tamura Tatsuya Akutsu,Sven Kosub,Avraham A. Melkman,Takeyuki Tamura Finding a Periodic Attractor of a Boolean Network. Finding a Periodic Attractor of a Boolean Network. Finding a Periodic Attractor of a Boolean Network. IEEE/ACM Trans. Comput. Biology Bioinform., 9, 5, 1410-1421 IEEE/ACM Trans. Comput. Biology Bioinform., 9, 5, 1410-1421 IEEE/ACM Trans. Comput. Biology Bioinform., 9, 5, 1410-1421 2012 有 公開
Tatsuya Akutsu,Takeyuki Tamura,Daiji Fukagawa,Atsuhiro Takasu Tatsuya Akutsu,Takeyuki Tamura,Daiji Fukagawa,Atsuhiro Takasu T. Akutsu; T. Tamura; D. Fukagawa; A. Takasu Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees. Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees. Efficient exponential time algorithms for edit distance between unordered trees Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings, 7354, 360-372 Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings, 7354, 360-372 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7354, 360-372 2012 有 英語 公開
Tatsuya Akutsu,Takeyuki Tamura Tatsuya Akutsu,Takeyuki Tamura Tatsuya Akutsu,Takeyuki Tamura On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, 146-155 Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, 146-155 Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, 146-155 2012 有 公開
Tatsuya Akutsu,Takeyuki Tamura Tatsuya Akutsu,Takeyuki Tamura T. Akutsu; T. Tamura A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, 7464 LNCS, 76-87 Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, 7464 LNCS, 76-87 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7464 LNCS, 76-87 2012 有 英語 公開
Tatsuya Akutsu,Morihiro Hayashida,Takeyuki Tamura Tatsuya Akutsu,Morihiro Hayashida,Takeyuki Tamura T. Akutsu; M. Hayashida; T. Tamura Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment. Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment. Finding conserved regions in protein structures using support vector machines and structure alignment Pattern Recognition in Bioinformatics - 7th IAPR International Conference, PRIB 2012, Tokyo, Japan, November 8-10, 2012. Proceedings, 7632, 233-242 Pattern Recognition in Bioinformatics - 7th IAPR International Conference, PRIB 2012, Tokyo, Japan, November 8-10, 2012. Proceedings, 7632, 233-242 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7632, 233-242 2012 有 英語 公開
Tatsuya Akutsu,Yang Zhao,Morihiro Hayashida,Takeyuki Tamura Tatsuya Akutsu,Yang Zhao,Morihiro Hayashida,Takeyuki Tamura Tatsuya Akutsu,Yang Zhao,Morihiro Hayashida,Takeyuki Tamura Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks. Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks. Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks. IEICE Transactions, E95-D, 12, 2960-2970 IEICE Transactions, E95-D, 12, 2960-2970 IEICE Transactions, E95-D, 12, 2960-2970 2012 有 公開
Tatsuya Akutsu,Avraham A. Melkman,Takeyuki Tamura Tatsuya Akutsu,Avraham A. Melkman,Takeyuki Tamura Tatsuya Akutsu,Avraham A. Melkman,Takeyuki Tamura Singleton and 2-periodic attractors of sign-definite Boolean networks. Singleton and 2-periodic attractors of sign-definite Boolean networks. Singleton and 2-periodic attractors of sign-definite Boolean networks. Inf. Process. Lett., 112, 1-2, 35-38 Inf. Process. Lett., 112, 1-2, 35-38 Inf. Process. Lett., 112, 1-2, 35-38 2012 有 公開
Nakajima N, Tamura T, Yamanishi Y, Horimoto K, Akutsu T Nakajima N, Tamura T, Yamanishi Y, Horimoto K, Akutsu T N. Nakajima; T. Tamura; Y. Yamanishi; K. Horimoto; T. Akutsu Network completion using dynamic programming and least-squares fitting. Network completion using dynamic programming and least-squares fitting. Network completion using dynamic programming and least-squares fitting TheScientificWorldJournal, 2012, 957620 TheScientificWorldJournal, 2012, 957620 The Scientific World Journal, 2012, 957620 2012 有 英語 公開
Daiji Fukagawa,Takeyuki Tamura,Atsuhiro Takasu,Etsuji Tomita,Tatsuya Akutsu Daiji Fukagawa,Takeyuki Tamura,Atsuhiro Takasu,Etsuji Tomita,Tatsuya Akutsu Daiji Fukagawa,Takeyuki Tamura,Atsuhiro Takasu,Etsuji Tomita,Tatsuya Akutsu A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. BMC Bioinformatics, 12, S-1, S13 BMC Bioinformatics, 12, S-1, S13 BMC Bioinformatics, 12, S-1, S13 2011 有 公開
Takeyuki Tamura,Yang Cong,Tatsuya Akutsu,Wai-Ki Ching Takeyuki Tamura,Yang Cong,Tatsuya Akutsu,Wai-Ki Ching Takeyuki Tamura,Yang Cong,Tatsuya Akutsu,Wai-Ki Ching An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles. An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles. An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles. IEICE Transactions, 94-D, 12, 2393-2399 IEICE Transactions, 94-D, 12, 2393-2399 IEICE Transactions, 94-D, 12, 2393-2399 2011 有 公開
Tatsuya Akutsu,Avraham A. Melkman,Takeyuki Tamura,Masaki Yamamoto 0001 Tatsuya Akutsu,Avraham A. Melkman,Takeyuki Tamura,Masaki Yamamoto 0001 Tatsuya Akutsu,Avraham A. Melkman,Takeyuki Tamura,Masaki Yamamoto 0001 Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. Journal of Computational Biology, 18, 10, 1275-1290 Journal of Computational Biology, 18, 10, 1275-1290 Journal of Computational Biology, 18, 10, 1275-1290 2011 有 公開
Tatsuya Akutsu,Daiji Fukagawa,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Daiji Fukagawa,Atsuhiro Takasu,Takeyuki Tamura Tatsuya Akutsu,Daiji Fukagawa,Atsuhiro Takasu,Takeyuki Tamura Exact algorithms for computing the tree edit distance between unordered trees. Exact algorithms for computing the tree edit distance between unordered trees. Exact algorithms for computing the tree edit distance between unordered trees. Theor. Comput. Sci., 412, 4-5, 352-364 Theor. Comput. Sci., 412, 4-5, 352-364 Theor. Comput. Sci., 412, 4-5, 352-364 2011 有 公開
Takeyuki Tamura,Tatsuya Akutsu Takeyuki Tamura,Tatsuya Akutsu Takeyuki Tamura,Tatsuya Akutsu Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks. Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks. Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks. IEICE Transactions, 93-A, 8, 1497-1507 IEICE Transactions, 93-A, 8, 1497-1507 IEICE Transactions, 93-A, 8, 1497-1507 2010 有 公開
Takeyuki Tamura,Kazuhiro Takemoto,Tatsuya Akutsu Takeyuki Tamura,Kazuhiro Takemoto,Tatsuya Akutsu Takeyuki Tamura,Kazuhiro Takemoto,Tatsuya Akutsu Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets. Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets. Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets. IJKDB, 1, 1, 14-31 IJKDB, 1, 1, 14-31 IJKDB, 1, 1, 14-31 2010 有 公開
Avraham A. Melkman,Takeyuki Tamura,Tatsuya Akutsu Avraham A. Melkman,Takeyuki Tamura,Tatsuya Akutsu Avraham A. Melkman,Takeyuki Tamura,Tatsuya Akutsu Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time. Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time. Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time. Inf. Process. Lett., 110, 14-15, 565-569 Inf. Process. Lett., 110, 14-15, 565-569 Inf. Process. Lett., 110, 14-15, 565-569 2010 有 公開
Tatsuya Akutsu,Takeyuki Tamura Tatsuya Akutsu,Takeyuki Tamura Tatsuya Akutsu,Takeyuki Tamura On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2. On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2. On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2. IEICE Transactions, 92-A, 8, 1771-1778 IEICE Transactions, 92-A, 8, 1771-1778 IEICE Transactions, 92-A, 8, 1771-1778 2009/08 有 公開
Takeyuki Tamura,Tatsuya Akutsu Takeyuki Tamura,Tatsuya Akutsu Takeyuki Tamura,Tatsuya Akutsu Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms. Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms. Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms. IEICE Transactions, 92-A, 2, 493-501 IEICE Transactions, 92-A, 2, 493-501 IEICE Transactions, 92-A, 2, 493-501 2009 有 公開
Takeyuki Tamura,Tatsuya Akutsu Takeyuki Tamura,Tatsuya Akutsu T. Tamura; T. Akutsu Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks. Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks. Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks Mathematics in Computer Science, 2, 3, 401-420 Mathematics in Computer Science, 2, 3, 401-420 Mathematics in Computer Science, 2, 3, 401-420 2009 有 英語 公開
Tamura Takeyuki, Ito Hiro Tamura Takeyuki, Ito Hiro T. Tamura; H. Ito Inferring pedigree graphs from genetic distances Inferring pedigree graphs from genetic distances Inferring pedigree graphs from genetic distances IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E91D, 2, 162-169 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E91D, 2, 162-169 IEICE Transactions on Information and Systems, E91D, 2, 162-169 2008/02 有 公開
Akutsu Tatsuya, Hayashida Morihiro, Tamura Takeyuki Akutsu Tatsuya, Hayashida Morihiro, Tamura Takeyuki T. Akutsu; M. Hayashida; T. Tamura Algorithms for inference, analysis and control of Boolean networks Algorithms for inference, analysis and control of Boolean networks Algorithms for inference, analysis and control of Boolean networks ALGEBRAIC BIOLOGY, PROCEEDINGS, 5147, 1-15 ALGEBRAIC BIOLOGY, PROCEEDINGS, 5147, 1-15 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5147, 1-15 2008 有 公開
Tamura Takeyuki, Akutsu Tatsuya Tamura Takeyuki, Akutsu Tatsuya T. Tmura; T. Akutsu Approximation algorithms for optimal RNA secondary structures common to multiple sequences Approximation algorithms for optimal RNA secondary structures common to multiple sequences Approximation algorithms for optimal RNA secondary structures common to multiple sequences IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 917-923 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 917-923 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90A, 5, 917-923 2007/05 有 公開
Ito Hiro, Iwama Kazuo, Takeyuki Tamura Ito Hiro, Iwama Kazuo, Takeyuki Tamura H. Ito; K. Iwama; T. Tamura Efficient methods for determining DNA probe orders Efficient methods for determining DNA probe orders Efficient methods for determining DNA probe orders IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1292-1298 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1292-1298 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89A, 5, 1292-1298 2006/05 有 公開
田村　武幸 田村　武幸 TAMURA Takeyuki Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree International Journal of Foundations of Computer Science International Journal of Foundations of Computer Science International Journal of Foundations of Computer Science International Journal of Foundations of Computer Science 有 英語 研究論文(学術雑誌) 公開

  • <<
  • >>
  • 表示
タイトル言語:
講演・口頭発表等
タイトル タイトル(日本語) タイトル(英語) 会議名 会議名(日本語) 会議名(英語) 主催者 主催者(日本語) 主催者(英語) 開催年月日 記述言語 会議種別 公開
Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic condition Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic condition Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic condition 生命医薬情報学連合大会2019 生命医薬情報学連合大会2019 生命医薬情報学連合大会2019 2019/09/10 日本語 口頭発表(一般) 公開
有用化合物を生産・増産する代謝ネットワークの設計 有用化合物を生産・増産する代謝ネットワークの設計 有用化合物を生産・増産する代謝ネットワークの設計 生命医薬情報学連合大会2019 生命医薬情報学連合大会2019 生命医薬情報学連合大会2019 2019/09/09 日本語 口頭発表(一般) 公開
Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Metabolic Pathway Analysis 2019 Metabolic Pathway Analysis 2019 Metabolic Pathway Analysis 2019 2019/08/14 英語 ポスター発表 公開
Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Intelligent Systems for Molecular Biology 2019 Intelligent Systems for Molecular Biology 2019 Intelligent Systems for Molecular Biology 2019 2019/07/21 英語 ポスター発表 公開
Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions 19th Annual International Workshop on Bioinformatics and Systems Biology 19th Annual International Workshop on Bioinformatics and Systems Biology 19th Annual International Workshop on Bioinformatics and Systems Biology 2019/07/18 英語 公開講演、セミナー、チュートリアル、講習、講義 公開
嫌気条件での出芽酵母を用いた生育結合増産の可能性 嫌気条件での出芽酵母を用いた生育結合増産の可能性 Growth-coupled overproduction is theoretically possible for most metabolites in Saccharomyces cerevisiae under anaerobic conditions 情報処理学会バイオ情報学研究会 情報処理学会バイオ情報学研究会 2019/06/19 英語 口頭発表(一般) 公開
Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. 5th Conference on Constraint-Based Reconstruction and Analysis (COBRA2018) 5th Conference on Constraint-Based Reconstruction and Analysis (COBRA2018) 2018/10/14 英語 ポスター発表 公開
Computational methods for design of metabolic networks for production of valuable compounds Computational methods for design of metabolic networks for production of valuable compounds Computational methods for design of metabolic networks for production of valuable compounds 生命医薬情報学連合大会 生命医薬情報学連合大会 2018/09/20 英語 ポスター発表 公開
有用化合物を生産・増産する代謝ネットワークを設計するアルゴリズム 有用化合物を生産・増産する代謝ネットワークを設計するアルゴリズム 有用化合物を生産・増産する代謝ネットワークを設計するアルゴリズム 情報処理学会バイオ情報学研究会 情報処理学会バイオ情報学研究会 情報処理学会バイオ情報学研究会 2018/09/18 日本語 口頭発表(一般) 公開
有用物質を生産・増産する準最適な代謝流束均衡モデルのデザイン 有用物質を生産・増産する準最適な代謝流束均衡モデルのデザイン 有用物質を生産・増産する準最適な代謝流束均衡モデルのデザイン 第70回日本生物工学会大会 第70回日本生物工学会大会 第70回日本生物工学会大会 2018/09/06 日本語 口頭発表(一般) 公開
Computing minimum reaction modification in a Boolean metabolic network[招待あり] Computing minimum reaction modification in a Boolean metabolic network [招待あり] Computing minimum reaction modification in a Boolean metabolic network [招待あり] 2016 Biotech and Pharmaceutical Service Platform - Biological Network Analysis Conference 2016 Biotech and Pharmaceutical Service Platform - Biological Network Analysis Conference 2016 Biotech and Pharmaceutical Service Platform - Biological Network Analysis Conference 2016/11/04 英語 口頭発表(招待・特別) 公開
Computing Minimum Reaction Modifications in a Boolean Metabolic Network Computing Minimum Reaction Modifications in a Boolean Metabolic Network Computing Minimum Reaction Modifications in a Boolean Metabolic Network GIW/InCoB2015 GIW/InCoB2015 GIW/InCoB2015 2015/09 英語 口頭発表(一般) 公開
遺伝子の破壊と導入による代謝への影響予測の数理モデル[招待あり] 遺伝子の破壊と導入による代謝への影響予測の数理モデル [招待あり] 遺伝子の破壊と導入による代謝への影響予測の数理モデル [招待あり] JSBi生命システム理論研究会 〜細胞状態の理論的解明に向けて〜 JSBi生命システム理論研究会 〜細胞状態の理論的解明に向けて〜 JSBi生命システム理論研究会 〜細胞状態の理論的解明に向けて〜 2014/11/18 日本語 口頭発表(招待・特別) 公開
On the parameterized complexity of associative and commutative unification On the parameterized complexity of associative and commutative unification On the parameterized complexity of associative and commutative unification 9th International Symposium on Parameterized and Exact Computation (IPEC 2014) 9th International Symposium on Parameterized and Exact Computation (IPEC 2014) 9th International Symposium on Parameterized and Exact Computation (IPEC 2014) 2014/09 英語 口頭発表(一般) 公開
On the complexity of finding a largest common subtree of bounded degree On the complexity of finding a largest common subtree of bounded degree On the complexity of finding a largest common subtree of bounded degree 19th Int. Symp. Fundamentals of Computation Theory (FCT 2013) 19th Int. Symp. Fundamentals of Computation Theory (FCT 2013) 19th Int. Symp. Fundamentals of Computation Theory (FCT 2013) 2013 英語 口頭発表(一般) 公開
On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree 23rd International Symposium on Algorithms and Computation (ISAAC 2012) 23rd International Symposium on Algorithms and Computation (ISAAC 2012) 23rd International Symposium on Algorithms and Computation (ISAAC 2012) 2012/12 英語 口頭発表(一般) 公開
Integer programming method for completing ortholog-based gene-protein-reaction network by gene essentiality Integer programming method for completing ortholog-based gene-protein-reaction network by gene essentiality Integer programming method for completing ortholog-based gene-protein-reaction network by gene essentiality The 23rd International Conference on Genome Informatics (GIW2012) The 23rd International Conference on Genome Informatics (GIW2012) The 23rd International Conference on Genome Informatics (GIW2012) 2012/12 英語 口頭発表(一般) 公開
Efficient exponential time algorithms for edit distance between unordered trees Efficient exponential time algorithms for edit distance between unordered trees Efficient exponential time algorithms for edit distance between unordered trees 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012) 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012) 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012) 2012/07 英語 口頭発表(一般) 公開
A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) 2012 英語 口頭発表(一般) 公開
Completing networks using observed data Completing networks using observed data Completing networks using observed data 20th International Conference on Algorithmic Learning Theory (ALT 2009) 20th International Conference on Algorithmic Learning Theory (ALT 2009) 20th International Conference on Algorithmic Learning Theory (ALT 2009) 2009 英語 口頭発表(一般) 公開
Measuring structural robustness of metabolic networks under a Boolean model using integer programming and feedback vertex sets Measuring structural robustness of metabolic networks under a Boolean model using integer programming and feedback vertex sets Measuring structural robustness of metabolic networks under a Boolean model using integer programming and feedback vertex sets 2nd International Workshop on Intelligent Informatics in Biology and Medicine (IIBM2009) 2nd International Workshop on Intelligent Informatics in Biology and Medicine (IIBM2009) 2nd International Workshop on Intelligent Informatics in Biology and Medicine (IIBM2009) 2009 英語 口頭発表(一般) 公開
An improved algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes An improved algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes An improved algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes 3rd International Conference on Algebraic Biology (AB2008) 3rd International Conference on Algebraic Biology (AB2008) 3rd International Conference on Algebraic Biology (AB2008) 2008 英語 口頭発表(一般) 公開
An O(1.787^n)-time algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes An O(1.787^n)-time algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes An O(1.787^n)-time algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes 16th International Symposium on Fundamentals of Computation Theory (FCT2007) 16th International Symposium on Fundamentals of Computation Theory (FCT2007) 16th International Symposium on Fundamentals of Computation Theory (FCT2007) 2007 英語 口頭発表(一般) 公開
Imperfectness of data for STS-based physical mapping Imperfectness of data for STS-based physical mapping Imperfectness of data for STS-based physical mapping IFIP World Computer Congress, 2004 IFIP World Computer Congress, 2004 IFIP World Computer Congress, 2004 2004 英語 口頭発表(一般) 公開

  • <<
  • >>
  • 表示
タイトル言語:
書籍等出版物
著者 著者(日本語) 著者(英語) タイトル タイトル(日本語) タイトル(英語) 出版社 出版社(日本語) 出版社(英語) 出版年月 記述言語 担当区分 公開
Takeyuki Tamura and Tatsuya Akutsu Takeyuki Tamura and Tatsuya Akutsu Takeyuki Tamura and Tatsuya Akutsu Biological Data Mining and Its Applications in Healthcare Biological Data Mining and Its Applications in Healthcare Biological Data Mining and Its Applications in Healthcare World Scientific World Scientific World Scientific 2014/01 共著 公開
タイトル言語:
外部資金：競争的資金 (科学研究費補助金)
種別 代表/分担 テーマ(日本語) テーマ(英語) 期間
若手研究(Ｂ) 代表 ブーリアンモデルによる生体ネットワークの統合的な数理モデル化と解析 2013〜2016
若手研究(Ｂ) 代表 ブーリアンモデルによる遺伝子制御ネットワークの解析 Analysis of gene regulatory networks in Boolean models 2011/04/28〜2014/03/31
基盤研究(A) 分担 長期定常期から分裂再開までの細胞の生存戦略 2013/04/01〜2016/03/31
若手研究（Ｂ） 代表 ブーリアンモデルによる生体ネットワークの統合的な数理モデル化と解析 （平成27年度分） 2015/04/01〜2016/03/31
基盤研究(C) 代表 数理モデルによる生体ネットワーク制御手法の開発 （平成28年度分） 2016/04/01〜2017/03/31
基盤研究(C) 代表 数理モデルによる生体ネットワーク制御手法の開発 （平成29年度分） 2017/04/01〜2018/03/31
基盤研究(A) 分担 細胞の生存 - 自然界における大腸菌の場合 2016/04/01〜2019/03/31
基盤研究(C) 代表 数理モデルによる生体ネットワーク制御手法の開発 （平成30年度分） 2018/04/01〜2019/03/31
外部資金：競争的資金 (科学研究費補助金以外)
制度名 代表者名 研究課題(日本語) 研究課題(英語) 期間
京都大学教育研究振興財団・研究活動推進助成 田村武幸 生産困難化合物を生成するFBAモデルの代謝ネットワークの設計 2019/04/01〜2020/03/31
担当科目
講義名(日本語) 講義名(英語) 開講期 学部/研究科 年度
生命情報学基礎論 Introduction to Bioinformatics 前期 情報学研究科 2014/04〜2015/03
生命情報学基礎論 Introduction to Bioinformatics 前期 情報学研究科 2015/04〜2016/03
生命情報学基礎論 Introduction to Bioinformatics 前期 情報学研究科 2016/04〜2017/03
生命情報学特論 Bioinformatics, Adv. 後期 情報学研究科 2016/04〜2017/03
生命情報学基礎論 Introduction to Bioinformatics 前期 情報学研究科 2017/04〜2018/03
生命情報学特論 Bioinformatics, Adv. 後期 情報学研究科 2017/04〜2018/03
生命情報学基礎論 Introduction to Bioinformatics 前期 情報学研究科 2018/04〜2019/03
生命情報学特論 Bioinformatics, Adv. 後期 情報学研究科 2018/04〜2019/03
生命情報学基礎論 Introduction to Bioinformatics 前期 情報学研究科 2019/04〜2020/03
生命情報学特論 Bioinformatics, Adv. 後期 情報学研究科 2019/04〜2020/03
部局運営（役職等）
役職名 期間
化学研究所講演委員会委員 2013/04/01〜2014/03/31
化学研究所広報委員会委員 2017/04/01〜2018/03/31
化学研究所情報システム技術委員会委員 2017/04/01〜2018/03/31
化学研究所広報委員会委員 2018/04/01〜2019/03/31
化学研究所情報システム技術委員会委員 2018/04/01〜2019/03/31
化学研究所講演委員会委員 2019/04/01〜2020/03/31
学会活動：学会役員歴
学会名(日本語) 学会名(英語) 役職名(日本語) 役職名(英語) 期間
日本バイオインフォマティクス学会 理事 2019/04/01〜2021/03/31
学会活動：編集委員歴
学会名(日本語) 学会名(英語) ジャーナル名(日本語) ジャーナル名(英語) 役職名 期間
Algorithms, special issue "Biological networks," 2016 guest editor 〜
学会活動：その他
学会名(日本語) 学会名(英語) 貢献活動名(日本語) 貢献活動名(英語) 期間
第77回情報処理学会全国大会 実行委員 2015/03/〜2015/03/
生命医薬情報学連合大会2015年大会 プログラム委員 2015/10/〜2015/10/
生命医薬情報学連合大会2015年大会 実行委員 2015/10/〜2015/10/
APBC2008 The 6th Asia Pacific Bioinformatics Conference (APBC2008) 組織委員 Organizing Committee 2008/01/14〜2008/01/17
IBSB2010 The 10th Annual International Workshop on Bioinformatics and Systems Biology (IBSB2010) 組織委員 Organizing Committee 2010/07/26〜2010/07/28
International Conference on Towards Mathematical Foundations of Complex Network Theory International Conference on Towards Mathematical Foundations of Complex Network Theory 組織委員 Organizing Committee 2012/09/14〜2012/09/16
PRIB2014 Pattern Recognition in Bioinformatics 2014 プログラム委員 Program Committee 2014〜2014

前のページへ戻る

このページのTOPへ