IEICE Trans

Tatsuya AKUTSU

A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth Chia-Jung CHANG Takeyuki TAMURA Kun-Mao CHAO Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2015/01/01 Vol. E98-A No. 1 pp. 384-390 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: Boolean network, attractor, partial k-tree, fixed-parameter algorithm,
	Summary \| Full Text:PDF

On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors Hao JIANG Takeyuki TAMURA Wai-Ki CHING Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2013/11/01 Vol. E96-A No. 11 pp. 2265-2274 Type of Manuscript: PAPER Category: General Fundamentals and Boundaries Keyword: Boolean network, singleton attractor, network completion, another solution problem,
	Summary \| Full Text:PDF

Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks Tatsuya AKUTSU Yang ZHAO Morihiro HAYASHIDA Takeyuki TAMURA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2012/12/01 Vol. E95-D No. 12 pp. 2960-2970 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: Boolean networks, genetic networks, attractors, integer programming, nonlinear discrete systems,
	Summary \| Full Text:PDF

An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles Takeyuki TAMURA Yang CONG Tatsuya AKUTSU Wai-Ki CHING
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2011/12/01 Vol. E94-D No. 12 pp. 2393-2399 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: metabolic networks, Boolean networks, impact degree, robustness,
	Summary \| Full Text:PDF

Measuring the Similarity of Protein Structures Using Image Compression Algorithms Morihiro HAYASHIDA Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2011/12/01 Vol. E94-D No. 12 pp. 2468-2478 Type of Manuscript: PAPER Category: Artificial Intelligence, Data Mining Keyword: image compression, universal similarity metric, protein structure comparison,
	Summary \| Full Text:PDF

Kernel Methods for Chemical Compounds: From Classification to Design Tatsuya AKUTSU Hiroshi NAGAMOCHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2011/10/01 Vol. E94-D No. 10 pp. 1846-1853 Type of Manuscript: INVITED PAPER (Special Section on Information-Based Induction Sciences and Machine Learning) Category: Keyword: chemoinformatics, kernel method, pre-image, dynamic programming, enumeration, graph detachment,
	Summary \| Full Text:PDF

Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks Takeyuki TAMURA Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2010/08/01 Vol. E93-A No. 8 pp. 1497-1507 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: metabolic network, reaction cut, algorithm, boolean model, robustness,
	Summary \| Full Text:PDF

Tree Edit Distance Problems: Algorithms and Applications to Bioinformatics Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/02/01 Vol. E93-D No. 2 pp. 208-218 Type of Manuscript: INVITED PAPER (Special Section on Foundations of Computer Science) Category: Keyword: tree edit distance, dynamic programming, largest common subtree, tree alignment,
	Summary \| Full Text:PDF

On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2 Tatsuya AKUTSU Takeyuki TAMURA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2009/08/01 Vol. E92-A No. 8 pp. 1771-1778 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Theory Keyword: Boolean network, genetic network, attractor, fixed point, boolean satisfiability problem,
	Summary \| Full Text:PDF

Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms Takeyuki TAMURA Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2009/02/01 Vol. E92-A No. 2 pp. 493-501 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: Boolean network, singleton attractor, fixed point, SAT, NP-hard,
	Summary \| Full Text:PDF

Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences Takeyuki TAMURA Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2007/05/01 Vol. E90-A No. 5 pp. 917-923 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computational biology, RNA secondary structure prediction, approximation algorithms,
	Summary \| Full Text:PDF

Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints Tatsuya AKUTSU Morihiro HAYASHIDA Dukka Bahadur K.C. Etsuji TOMITA Jun'ichi SUZUKI Katsuhisa HORIMOTO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 pp. 1215-1222 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: maximum edge weight clique, dynamic programming, protein threading, profiles, distance constraints,
	Summary \| Full Text:PDF

Protein Structure Alignment Using Dynamic Programing and Iterative Improvement Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/12/25 Vol. E79-D No. 12 pp. 1629-1636 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: protein structure, alignment, bio-informatics, computational geometry, geometric pattern matching,
	Summary \| Full Text:PDF

Approximate String Matching with Variable Length Don't Care Characters Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/09/25 Vol. E79-D No. 9 pp. 1353-1354 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: pattern matching, approximate string matching, algorithms, DNA sequence analysis,
	Summary \| Full Text:PDF

A Parallel Algorithm for Determining the Congruence of Point Sets in Three-Dimensions Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/04/25 Vol. E78-D No. 4 pp. 321-325 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: parallel algorithm, NC algorithm, congruence, pattern matching, computational geometry,
	Summary \| Full Text:PDF

A Linear Time Pattern Matching Algorithm between a String and a Tree Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/03/25 Vol. E77-D No. 3 pp. 281-287 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: subtree, subgraph isomorphism, string matching, suffix tree, graph algorithms,
	Summary \| Full Text:PDF

A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/09/25 Vol. E76-A No. 9 pp. 1488-1493 Type of Manuscript: PAPER Category: Algorithms, Data Structures and Computational Complexity Keyword: largest common subgraph, subgraph isomorphism, almost trees, NP-complete,
	Summary \| Full Text:PDF

Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves Tatsuya AKUTSU Satoshi KOBAYASHI Koichi HORI Setsuo OHSUGA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/06/25 Vol. E76-D No. 6 pp. 707-710 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: algorithms, macro operator, learning, graph algorithms, subtree,
	Summary \| Full Text:PDF

A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies Atsuhiro TAKASU Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/02/25 Vol. E76-D No. 2 pp. 299-301 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: graph algorithms, database query, partial match retrieval, disjoint paths,
	Summary \| Full Text:PDF

An NC Algorithm for Computing Canonical Forms of Graphs of Bounded Separator Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/04/25 Vol. E75-A No. 4 pp. 512-514 Type of Manuscript: Special Section LETTER (Special Issue on Discrete Mathematics and Its Application) Category: Keyword: canonical forms, praph isomorphism, parallel algorithms, NC algorithms, bounded separator,
	Summary \| Full Text:PDF

An RNC Algorithm for Finding a Largest Common Subtree of Two Trees Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/01/25 Vol. E75-D No. 1 pp. 95-101 Type of Manuscript: Special Section PAPER (Special Section on Theoretical Foundations of Computing) Category: Keyword: largest common subtree, subgraph isomorphism, parallel algorithms, random NC algorithms, dynamic tree contraction,
	Summary \| Full Text:PDF