書誌事項
- タイトル別名
-
- Alignment of Cyclically Ordered Trees
- ジュンカイテキ ジュンジョ ボク ノ アライメント
この論文をさがす
抄録
<p>In this paper, we investigate an alignment distance between the following three cyclically ordered trees. A biordered tree is an unordered tree that allows both a left-to-right and a right-to-left order among siblings. A cyclic-ordered tree is an unordered tree that allows cyclic order among siblings in a left-to-right direction. A cyclic-biordered tree is an unordered tree that allows cyclic order among siblings in both left-to-right and right-to-left directions. Then, we design the algorithms to compute the distance between biordered trees in O(n2D2) time and ones between cyclic-ordered trees and cyclic-biordered trees in O(n2D4) time, where n is the maximum number of nodes and D is the maximum degree in two given trees.</p>
収録刊行物
-
- 人工知能学会研究会資料 人工知能基本問題研究会
-
人工知能学会研究会資料 人工知能基本問題研究会 94 (0), 08-, 2014-07-24
一般社団法人 人工知能学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390851497214388864
-
- NII論文ID
- 40020237073
- 130008061523
-
- NII書誌ID
- AA11977943
-
- ISSN
- 24364584
-
- NDL書誌ID
- 025861063
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用可