Heavy Caterpillar Distances for Rooted Labeled Unordered Trees

Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods ◽

10.5220/0009095801980204 ◽

2020 ◽

Author(s):

Nozomi Abe ◽

Takuya Yoshino ◽

Kouich Hirata

Keyword(s):

Unordered Trees

Download Full-text

Algorithmic height compression of unordered trees

Journal of Theoretical Biology ◽

10.1016/j.jtbi.2015.10.030 ◽

2016 ◽

Vol 389 ◽

pp. 237-252

Author(s):

Farah Ben-Naoum ◽

Christophe Godin

Keyword(s):

Unordered Trees

Download Full-text

Complexity results on the minimum width drawing problem for rooted unordered trees

Electronics and Communications in Japan (Part III Fundamental Electronic Science) ◽

10.1002/(sici)1520-6440(199801)81:1<32::aid-ecjc4>3.0.co;2-8 ◽

1998 ◽

Vol 81 (1) ◽

pp. 32-41 ◽

Author(s):

Kunihiko Hayashi ◽

Sumio Masuda

Keyword(s):

Minimum Width ◽

Complexity Results ◽

Unordered Trees

Download Full-text

A metric between unrooted and unordered trees and its bottom-up computing method

IEEE Transactions on Pattern Analysis and Machine Intelligence ◽

10.1109/34.387483 ◽

1994 ◽

Vol 16 (12) ◽

pp. 1233-1238 ◽

Author(s):

E. Tanaka

Keyword(s):

Bottom Up ◽

Unordered Trees ◽

Computing Method

Download Full-text

Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees

The Annals of Probability ◽

10.1214/11-aop686 ◽

2012 ◽

Vol 40 (6) ◽

pp. 2589-2666 ◽

Author(s):

Bénédicte Haas ◽

Grégory Miermont

Keyword(s):

Scaling Limits ◽

Branching Trees ◽

Unordered Trees

Download Full-text

Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-31265-6_29 ◽

2012 ◽

pp. 360-372 ◽

Author(s):

Tatsuya Akutsu ◽

Takeyuki Tamura ◽

Daiji Fukagawa ◽

Atsuhiro Takasu

Keyword(s):

Edit Distance ◽

Exponential Time ◽

Exponential Time Algorithms ◽

Unordered Trees

Download Full-text

Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees

Combinatorial Pattern Matching - Lecture Notes in Computer Science ◽

10.1007/978-3-642-21458-5_34 ◽

2011 ◽

pp. 402-415 ◽

Author(s):

Kouichi Hirata ◽

Yoshiyuki Yamamoto ◽

Tetsuji Kuboyama

Keyword(s):

Edit Distance ◽

Unordered Trees

Download Full-text

Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03784-9_2 ◽

2009 ◽

pp. 7-17 ◽

Author(s):

Daiji Fukagawa ◽

Tatsuya Akutsu ◽

Atsuhiro Takasu

Keyword(s):

Edit Distance ◽

Constant Factor ◽

Unordered Trees

Download Full-text

Drawing Unordered Trees on k-Grids

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28076-4_20 ◽

2012 ◽

pp. 198-210 ◽

Author(s):

Christian Bachmaier ◽

Marco Matzeder

Keyword(s):

Unordered Trees

Download Full-text

RECUT: RE-Compressing partially Unordered Trees

2018 IEEE International Conference on Big Data (Big Data) ◽

10.1109/bigdata.2018.8622261 ◽

2018 ◽

Author(s):

Stefan Bottcher ◽

Rita Hartel

Keyword(s):

Unordered Trees

Download Full-text

Logics for unordered trees with data constraints

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2018.11.004 ◽

2019 ◽

Vol 104 ◽

pp. 149-164 ◽

Author(s):

Adrien Boiret ◽

Vincent Hugot ◽

Joachim Niehren ◽

Ralf Treinen

Keyword(s):

Unordered Trees ◽

Data Constraints

Download Full-text