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 条
  • [31] Bipartite graph matching for computing the edit distance of graphs
    Riesen, Kaspar
    Neuhaus, Michel
    Bunke, Horst
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2007, 4538 : 1 - +
  • [32] Computing Text Similarity using Tree Edit Distance
    Sidorov, Grigori
    Gomez-Adorno, Helena
    Markov, Ilia
    Pinto, David
    Loya, Nahun
    2015 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY DIGIPEN NAFIPS 2015, 2015,
  • [33] Computing the Expected Edit Distance from a String to a PFA
    Calvo-Zaragoza, Jorge
    de la Higuera, Colin
    Oncina, Jose
    Implementation and Application of Automata, 2016, 9705 : 39 - 50
  • [34] Edit Distance between Merge Trees
    Sridharamurthy, Raghavendra
    Bin Masood, Talha
    Kamakshidasan, Adhitya
    Natarajan, Vijay
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2020, 26 (03) : 1518 - 1531
  • [35] An edit distance between quotiented trees
    Ferraro, P
    Godin, C
    ALGORITHMICA, 2003, 36 (01) : 1 - 39
  • [36] An Edit Distance Between Graph Correspondences
    Moreno-Garcia, Carlos Francisco
    Serratosa, Francesc
    Jiang, Xiaoyi
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION (GBRPR 2017), 2017, 10310 : 232 - 241
  • [37] An Edit Distance between Quotiented Trees
    Algorithmica, 2003, 36 : 1 - 39
  • [38] A Dynamic Programming A* Algorithm for Computing Unordered Tree Edit Distance
    Yoshino, Takuya
    Higuchi, Shoichi
    Hirata, Kouichi
    2013 SECOND IIAI INTERNATIONAL CONFERENCE ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2013), 2013, : 135 - 140
  • [39] Computing approximate tree edit distance using relaxation labeling
    Torsello, A
    Hancock, ER
    PATTERN RECOGNITION LETTERS, 2003, 24 (08) : 1089 - 1097
  • [40] Computing Graph Edit Distance via Neural Graph Matching
    Piao, Chengzhi
    Xu, Tingyang
    Sun, Xiangguo
    Rong, Yu
    Zhao, Kangfei
    Cheng, Hong
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 16 (08): : 1817 - 1829
12345