Computing Edit Distance between Rooted Labeled Caterpillars

被引：0
|
作者：
Muraka, Kohei [1 ]
Yoshino, Takuya [2 ]
Hirata, Kouichi [2 ]
机构：
[1] Kyushu Inst Technol, Grad Sch Comp Sci & Syst Engn, Kawazu 680-4, Iizuka, Fukuoka 8208502, Japan
[2] Kyushu Inst Technol, Dept Artificial Intelligence, Kawazu 680-4, Iizuka, Fukuoka 8208502, Japan
来源：
PROCEEDINGS OF THE 2018 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS) | 2018年
关键词：
TREES;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A rooted labeled caterpillar is a rooted labeled tree transformed to a path after removing all the leaves in it. In this paper, we design the algorithm to compute the edit distance between rooted labeled caterpillars in O(lambda(2)h(2)) time, where lambda and h are the maximum number of leaves and the maximum height in two caterpillars, respectively.
引用
收藏
页码：249 / 255
页数：7
相关论文
共 50 条
  • [1] Computing the Variations of Edit Distance for Rooted Labaled Caterpillars
    Hagihara, Manami
    Yoshino, Takuya
    Hirata, Kouich
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION APPLICATIONS AND METHODS (ICPRAM), 2021, : 272 - 279
  • [2] Vertical and Horizontal Distances to Approximate Edit Distance for Rooted Labeled Caterpillars
    Muraka, Kohei
    Yoshino, Takuya
    Hirata, Kouichi
    ICPRAM: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION APPLICATIONS AND METHODS, 2019, : 590 - 597
  • [3] Path Histogram Distance for Rooted Labeled Caterpillars
    Kawaguchi, Taiga
    Yoshino, Takuya
    Hirata, Kouichi
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2018, PT I, 2018, 10751 : 276 - 286
  • [4] Fast Algorithms for the Rooted Triplet Distance Between Caterpillars
    Jansson, Jesper
    Lee, Wing Lik
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 327 - 340
  • [5] A new measure of edit distance between labeled trees
    Lu, CL
    Su, ZY
    Tang, CY
    COMPUTING AND COMBINATORICS, 2001, 2108 : 338 - 348
  • [6] A constrained edit distance between unordered labeled trees
    Zhang, KZ
    ALGORITHMICA, 1996, 15 (03) : 205 - 222
  • [7] Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars
    Miyazaki, Tomoya
    Hagihara, Manami
    Hirata, Kouich
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION APPLICATIONS AND METHODS (ICPRAM), 2021, : 280 - 287
  • [8] Designing an A* algorithm for calculating edit distance between rooted-unordered trees
    Horesh, Yair
    Mehr, Ramit
    Unger, Ron
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (06) : 1165 - 1176
  • [9] Computing the Rooted Triplet Distance Between Phylogenetic Networks
    Jansson, Jesper
    Mampentzidis, Konstantinos
    Rajaby, Ramesh
    Sung, Wing-Kin
    COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 290 - 303
  • [10] Computing the Rooted Triplet Distance Between Phylogenetic Networks
    Jansson, Jesper
    Mampentzidis, Konstantinos
    Rajaby, Ramesh
    Sung, Wing-Kin
    ALGORITHMICA, 2021, 83 (06) : 1786 - 1828
12345