Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Akutsu, Tatsuya"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of finding a largest common subtree of bounded degree
Tatsuya Akutsu
,
Takeyuki Tamura
,
Avraham A. Melkman
,
Atsuhiro Takasu
Theoretical Computer Science
590
, 2015, pp. 2-16
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Tatsuya Akutsu
,
Daiji Fukagawa
,
Magnús M. Halldórsson
,
Atsuhiro Takasu
,
Keisuke Tanaka
Theoretical Computer Science
470
, 2013, pp. 10-22
Singleton and 2-periodic attractors of sign-definite Boolean networks
Tatsuya Akutsu
,
Avraham A. Melkman
,
Takeyuki Tamura
Information Processing Letters
112
(1-2), 2012, pp. 35-38
Efficient exponential time algorithms for edit distance between unordered trees
Tatsuya Akutsu
,
Takeyuki Tamura
,
Daiji Fukagawa
,
Atsuhiro Takasu
Lecture Notes in Computer Science
7354
, 2012, pp. 360-372
A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree
Tatsuya Akutsu
,
Takeyuki Tamura
Lecture Notes in Computer Science
7464
, 2012, pp. 76-87
On the complexity of the maximum common subgraph problem for partial
k
-trees of bounded degree
Tatsuya Akutsu
,
Takeyuki Tamura
Lecture Notes in Computer Science
7676
, 2012, pp. 146-155
DAFS: Simultaneous aligning and folding of RNA sequences via dual decomposition
Kengo Sato
,
Yuki Kato
,
Tatsuya Akutsu
,
Kiyoshi Asai
,
Yasubumi Sakakibara
Bioinformatics
28
(24), 2012, pp. 3218-3224
Exact algorithms for computing the tree edit distance between unordered trees
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
,
Takeyuki Tamura
Theoretical Computer Science
412
(4-5), 2011, pp. 352-364
IPknot: Fast and accurate prediction of RNA secondary structures with pseudoknots using integer programming
Kengo Sato
,
Yuki Kato
,
Michiaki Hamada
,
Tatsuya Akutsu
,
Kiyoshi Asai
Bioinformatics
27
(13), 2011, pp. 85-93
Approximating tree edit distance through string edit distance
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
Algorithmica
57
(2), 2010, pp. 325-348
A bisection algorithm for grammar-based compression of ordered trees
Tatsuya Akutsu
Information Processing Letters
110
(18-19), 2010, pp. 815-820
RactIP: Fast and accurate prediction of RNA-RNA interaction using integer programming
Yuki Kato
,
Kengo Sato
,
Michiaki Hamada
,
Yoshihide Watanabe
,
Kiyoshi Asai
,
Tatsuya Akutsu
Bioinformatics
26
(18), 2010, pp. 460-466
Determining a singleton attractor of an AND/OR Boolean network in
O(1.587^n)
time
Avraham A. Melkman
,
Takeyuki Tamura
,
Tatsuya Akutsu
Information Processing Letters
110
(14-15), 2010, pp. 565-569
Cascleave: Towards more accurate prediction of caspase substrate cleavage sites
Jiangning Song
,
Hao Tan
,
Hongbin Shen
,
Khalid Mahmood
,
Sarah E. Boyd
,
Geoffrey I. Webb
,
Tatsuya Akutsu
,
James C. Whisstock
Bioinformatics
26
(6), 2010, pp. 752-760
Enumerating stereoisomers of tree structured molecules using dynamic programming
Tomoki Imada
,
Shunsuke Ota
,
Hiroshi Nagamochi
,
Tatsuya Akutsu
Lecture Notes in Computer Science
5878
, 2009, pp. 14-23
Improved approximation of the largest common subtree of two unordered trees of bounded height
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
Information Processing Letters
109
(2), 2008, pp. 165-170
HSEpred: Predict half-sphere exposure from protein sequences
Jiangning Song
,
Hao Tan
,
Kazuhiro Takemoto
,
Tatsuya Akutsu
Bioinformatics
24
(13), 2008, pp. 1489-1497
An approximation method for solving the steady-state probability distribution of probabilistic Boolean networks
Wai-Ki Ching
,
Shuqin Zhang
,
Michael K. Ng
,
Tatsuya Akutsu
Bioinformatics
23
(12), 2007, pp. 1511-1518
Approximating tree edit distance through string edit distance
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
Lecture Notes in Computer Science
4288
, 2006, pp. 90-99
A relation between edit distance for ordered trees and edit distance for Euler strings
Tatsuya Akutsu
Information Processing Letters
100
(3), 2006, pp. 105-109
Algorithms for point set matching with
k
-differences
Tatsuya Akutsu
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 903-917
Fast algorithms for comparison of similar unordered trees
Daiji Fukagawa
,
Tatsuya Akutsu
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 703-729
Identification of metabolic units induced by environmental signals
Jose C. Nacher
,
Jean-Marc Schwartz
,
Minoru Kanehisa
,
Tatsuya Akutsu
Bioinformatics
22
(14), 2006, pp. 375-383
Inferring a graph from path frequency
Tatsuya Akutsu
,
Daiji Fukagawa
Lecture Notes in Computer Science
3537
, 2005, pp. 371-382
A score matrix to reveal the hidden links in glycans
Kiyoko F. Aoki
,
Hiroshi Mamitsuka
,
Tatsuya Akutsu
,
Minoru Kanehisa
Bioinformatics
21
(8), 2005, pp. 1457-1463
Seiten 1
2
3
>