検索
検索条件の追加:
検索条件を追加することで検索結果を絞り込むことができます。
検索結果表示: 1-5 / 5.
- 前
- 1
- 次
検索結果:
| 書誌情報 | ファイル |
|---|---|
| On the complexity of finding a largest common subtree of bounded degree Akutsu, Tatsuya; Tamura, Takeyuki; Melkman, Avraham A.; Takasu, Atsuhiro (2015-07-26) Theoretical Computer Science, 590: 2-16 |  |
| On the parameterized complexity of associative and commutative unification Akutsu, Tatsuya; Jansson, Jesper; Takasu, Atsuhiro; Tamura, Takeyuki (2017-01-17) Theoretical Computer Science, 660: 57-74 | |
| Exact algorithms for computing the tree edit distance between unordered trees Akutsu, Tatsuya; Fukagawa, Daiji; Takasu, Atsuhiro; Tamura, Takeyuki (2011-02-04) Theoretical Computer Science, 412(4-5): 352-364 | |
| A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. Fukagawa, Daiji; Tamura, Takeyuki; Takasu, Atsuhiro; Tomita, Etsuji; Akutsu, Tatsuya (2011-02) BMC bioinformatics, 12 Suppl 1 | |
| A clique-based method using dynamic programming for computing edit distance between unordered trees. Mori, Tomoya; Tamura, Takeyuki; Fukagawa, Daiji; Takasu, Atsuhiro; Tomita, Etsuji; Akutsu, Tatsuya (2012-10) Journal of computational biology, 19(10): 1089-1104 | |