検索
検索条件の追加:
検索条件を追加することで検索結果を絞り込むことができます。
検索結果表示: 1-7 / 7.
- 前
- 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 |  |
| Approximating Tree Edit Distance through String Edit Distance Akutsu, Tatsuya; Fukagawa, Daiji; Takasu, Atsuhiro (2010-06) Algorithmica, 57(2): 325-348 | |
| 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 | |
| Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees Akutsu, Tatsuya; Fukagawa, Daiji; Halldórsson, Magnús M.; Takasu, Atsuhiro; Tanaka, Keisuke (2013-01) Theoretical Computer Science, 470: 10-22 | |
| Metrics for RNA Secondary Structure Comparison Wang, Feiqi; Akutsu, Tatsuya; Mori, Tomoya (2023) RNA Structure Prediction (2023): 79-88 | |
| On the complexity of tree edit distance with variables Akutsu, Tatsuya; Mori, Tomoya; Nakamura, Naotoshi; Kozawa, Satoshi; Ueno, Yuhei; Sato, Thomas N (2022) 33rd International Symposium on Algorithms and Computation (ISAAC 2022), 248: 44:1-44:14 | |