default search action
Takeyuki Tamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j42]Takeyuki Tamura
, Ai Muto-fujita, Yukako Tohsato, Tomoyuki Kosaka
Gene Deletion Algorithms for Minimum Reaction Network Design by Mixed-Integer Linear Programming for Metabolite Production in Constraint-Based Models: gDel_minRN. J. Comput. Biol. 30(5): 553-568 (2023) - [j41]Takeyuki Tamura
Trimming Gene Deletion Strategies for Growth-Coupled Production in Constraint-Based Metabolic Networks: TrimGdel. IEEE ACM Trans. Comput. Biol. Bioinform. 20(2): 1540-1549 (2023) - [j40]Takeyuki Tamura
MetNetComp: Database for Minimal and Maximal Gene-Deletion Strategies for Growth-Coupled Production of Genome-Scale Metabolic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 20(6): 3748-3758 (2023) - 2021
- [j39]Yier Ma, Takeyuki Tamura:
Dynamic Solution Space Division-Based Methods for Calculating Reaction Deletion Strategies for Constraint-Based Metabolic Networks for Substance Production: DynCubeProd. Frontiers Bioinform. 1 (2021) - [j38]Takeyuki Tamura:
L1 Norm Minimal Mode-Based Methods for Listing Reaction Network Designs for Metabolite Production. IEICE Trans. Inf. Syst. 104-D(5): 679-687 (2021) - [j37]Tatsuya Akutsu, Jesper Jansson
New and improved algorithms for unordered tree inclusion. Theor. Comput. Sci. 883: 83-98 (2021) - 2020
- [j36]Tatsuya Akutsu
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. Int. J. Found. Comput. Sci. 31(2): 253-273 (2020)
2010 – 2019
- 2019
- [j35]Yu Bao, Simone Marini
Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features. Briefings Bioinform. 20(5): 1669-1684 (2019) - 2018
- [j34]Takeyuki Tamura:
Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. BMC Bioinform. 19(1): 325:1-325:9 (2018) - [j33]Takeyuki Tamura
Computing Minimum Reaction Modifications in a Boolean Metabolic Network. IEEE ACM Trans. Comput. Biol. Bioinform. 15(6): 1853-1862 (2018) - [c20]Tatsuya Akutsu
A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. CPM 2018: 10:1-10:12 - [c19]Tatsuya Akutsu
New and Improved Algorithms for Unordered Tree Inclusion. ISAAC 2018: 27:1-27:12 - 2017
- [j32]Xiaoqing Cheng, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu
Discrimination of singleton and periodic attractors in Boolean networks. Autom. 84: 205-213 (2017) - [j31]Tatsuya Akutsu
On the parameterized complexity of associative and commutative unification. Theor. Comput. Sci. 660: 57-74 (2017) - [i2]Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura:
New Algorithms for Unordered Tree Inclusion. CoRR abs/1712.05517 (2017) - 2016
- [j30]Wenpin Hou
Finding and Analyzing the Minimum Set of Driver Nodes in control of Boolean Networks. Adv. Complex Syst. 19(3): 1650006:1-1650006:32 (2016) - [c18]Takeyuki Tamura, Tatsuya Akutsu
Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks. BIBE 2016: 57-63 - [c17]Tomoya Mori, Atsuhiro Takasu, Jesper Jansson
Similar subtree search using extended tree inclusion. ICDE 2016: 1558-1559 - 2015
- [j29]Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 384-390 (2015) - [j28]Wei Lu, Takeyuki Tamura, Jiangning Song
Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model. J. Comput. Biol. 22(2): 85-110 (2015) - [j27]Tatsuya Akutsu
On the complexity of finding a largest common subtree of bounded degree. Theor. Comput. Sci. 590: 2-16 (2015) - [j26]Tomoya Mori, Atsuhiro Takasu, Jesper Jansson
Similar Subtree Search Using Extended Tree Inclusion. IEEE Trans. Knowl. Data Eng. 27(12): 3360-3373 (2015) - 2014
- [j25]Yushan Qiu, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu
On control of singleton attractors in multiple Boolean networks: integer programming-based method. BMC Syst. Biol. 8(S-1): S7 (2014) - [j24]Tatsuya Akutsu
Efficient exponential-time algorithms for edit distance between unordered trees. J. Discrete Algorithms 25: 79-93 (2014) - [c16]Tatsuya Akutsu
On the Parameterized Complexity of Associative and Commutative Unification. IPEC 2014: 15-27 - 2013
- [j23]Tatsuya Akutsu
A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. Algorithms 6(1): 119-135 (2013) - [j22]Yang Zhao, Takeyuki Tamura, Tatsuya Akutsu
Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks. Bioinform. 29(17): 2178-2185 (2013) - [j21]Hao Jiang, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu
On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(11): 2265-2274 (2013) - [j20]Xi Chen, Tatsuya Akutsu
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming. Int. J. Data Min. Bioinform. 7(3): 321-343 (2013) - [c15]Tatsuya Akutsu
On the Complexity of Finding a Largest Common Subtree of Bounded Degree. FCT 2013: 4-15 - [i1]Tatsuya Akutsu, Takeyuki Tamura, Atsuhiro Takasu:
On the Parameterized Complexity of Associative and Commutative Unification. CoRR abs/1310.0919 (2013) - 2012
- [j19]Tatsuya Akutsu
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks. IEICE Trans. Inf. Syst. 95-D(12): 2960-2970 (2012) - [j18]Tatsuya Akutsu
Singleton and 2-periodic attractors of sign-definite Boolean networks. Inf. Process. Lett. 112(1-2): 35-38 (2012) - [j17]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. J. Comput. Biol. 19(10): 1089-1104 (2012) - [j16]Tatsuya Akutsu
Finding a Periodic Attractor of a Boolean Network. IEEE ACM Trans. Comput. Biol. Bioinform. 9(5): 1410-1421 (2012) - [c14]Tatsuya Akutsu
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees. CPM 2012: 360-372 - [c13]Tatsuya Akutsu
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. ISAAC 2012: 146-155 - [c12]Tatsuya Akutsu
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. MFCS 2012: 76-87 - [c11]Tatsuya Akutsu
Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment. PRIB 2012: 233-242 - 2011
- [j15]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. BMC Bioinform. 12(S-1): S13 (2011) - [j14]Takeyuki Tamura, Yang Cong, Tatsuya Akutsu
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles. IEICE Trans. Inf. Syst. 94-D(12): 2393-2399 (2011) - [j13]Tatsuya Akutsu
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. J. Comput. Biol. 18(10): 1275-1290 (2011) - [j12]Tatsuya Akutsu
Exact algorithms for computing the tree edit distance between unordered trees. Theor. Comput. Sci. 412(4-5): 352-364 (2011) - [c10]Tatsuya Akutsu
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures. CISIS 2011: 536-540 - 2010
- [j11]Takeyuki Tamura, Tatsuya Akutsu
Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(8): 1497-1507 (2010) - [j10]Takeyuki Tamura, Kazuhiro Takemoto, Tatsuya Akutsu:
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets. Int. J. Knowl. Discov. Bioinform. 1(1): 14-31 (2010) - [j9]Avraham A. Melkman
Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time. Inf. Process. Lett. 110(14-15): 565-569 (2010) - [c9]Xi Chen, Tatsuya Akutsu
Finding optimal control policy in Probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming. BIBM 2010: 240-246
2000 – 2009
- 2009
- [j8]Takeyuki Tamura, Tatsuya Akutsu
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(2): 493-501 (2009) - [j7]Tatsuya Akutsu
On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 1771-1778 (2009) - [j6]Takeyuki Tamura, Tatsuya Akutsu
Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks. Math. Comput. Sci. 2(3): 401-420 (2009) - [c8]Tatsuya Akutsu
Completing Networks Using Observed Data. ALT 2009: 126-140 - [c7]Tatsuya Akutsu
Integer programming-based methods for attractor detection and control of boolean networks. CDC 2009: 5610-5617 - [c6]Yang Cong, Takeyuki Tamura, Tatsuya Akutsu
Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles. DTMBIO 2009: 67-70 - [c5]Takeyuki Tamura, Kazuhiro Takemoto
Measuring Structural Robustness of Metabolic Networks under a Boolean Model Using Integer Programming and Feedback Vertex Sets. CISIS 2009: 819-824 - 2008
- [j5]Morihiro Hayashida, Takeyuki Tamura, Tatsuya Akutsu
Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks. EURASIP J. Bioinform. Syst. Biol. 2008 (2008) - [j4]Takeyuki Tamura, Hiro Ito:
Inferring Pedigree Graphs from Genetic Distances. IEICE Trans. Inf. Syst. 91-D(2): 162-169 (2008) - [c4]Tatsuya Akutsu
Algorithms for Inference, Analysis and Control of Boolean Networks. AB 2008: 1-15 - [c3]Takeyuki Tamura, Tatsuya Akutsu
An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes. AB 2008: 216-229 - 2007
- [j3]Takeyuki Tamura, Tatsuya Akutsu
Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition. BMC Bioinform. 8 (2007) - [j2]Takeyuki Tamura, Tatsuya Akutsu
Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 917-923 (2007) - [c2]Takeyuki Tamura, Tatsuya Akutsu
An O(1.787n)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes. FCT 2007: 494-505 - 2006
- [j1]Hiro Ito, Kazuo Iwama, Takeyuki Tamura:
Efficient Methods for Determining DNA Probe Orders. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1292-1298 (2006) - 2004
- [c1]Hiro Ito, Kazuo Iwama, Takeyuki Tamura:
Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS 2004: 279-292
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: