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 条
  • [21] Computing graph edit distance on quantum devices
    Incudini, Massimiliano
    Tarocco, Fabio
    Mengoni, Riccardo
    Di Pierro, Alessandra
    Mandarino, Antonio
    QUANTUM MACHINE INTELLIGENCE, 2022, 4 (02)
  • [22] Efficient Parallel Computing of Graph Edit Distance
    Wang, Ran
    Fang, Yixiang
    Feng, Xing
    2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW 2019), 2019, : 233 - 240
  • [23] Computing graph edit distance on quantum devices
    Massimiliano Incudini
    Fabio Tarocco
    Riccardo Mengoni
    Alessandra Di Pierro
    Antonio Mandarino
    Quantum Machine Intelligence, 2022, 4
  • [24] Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
    Gawrychowski, Pawel
    STRING PROCESSING AND INFORMATION RETRIEVAL: 19TH INTERNATIONAL SYMPOSIUM, SPIRE 2012, 2012, 7608 : 229 - 236
  • [25] A relation between edit distance for ordered trees and edit distance for Euler strings
    Akutsu, Tatsuya
    INFORMATION PROCESSING LETTERS, 2006, 100 (03) : 105 - 109
  • [26] Segmental Mapping and Distance for Rooted Labeled Ordered Trees
    Kan, Tomohiro
    Higuchi, Shoichi
    Hirata, Kouichi
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 485 - 494
  • [27] Segmental Mapping and Distance for Rooted Labeled Ordered Trees
    Kan, Tomohiro
    Higuchi, Shoichi
    FUNDAMENTA INFORMATICAE, 2014, 132 (04) : 461 - 483
  • [28] Streaming Algorithms for Embedding and Computing Edit Distance in the Low Distance Regime
    Chakraborty, Diptarka
    Goldenberg, Elazar
    Koucky, Michal
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 712 - 725
  • [29] Computing the Edit-Distance between a Regular Language and a Context-Free Language
    Han, Yo-Sub
    Ko, Sang-Ki
    Salomaa, Kai
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 85 - 96
  • [30] Computing the Graph Edit Distance Using Dominant Sets
    Rebagliati, Nicola
    Sole-Ribalta, Albert
    Pelillo, Marcello
    Serratosa, Francesc
    2012 21ST INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR 2012), 2012, : 1080 - 1083
12345