✦ LIBER ✦

Efficient exponential-time algorithms for edit distance between unordered trees

✍ Scribed by Akutsu, Tatsuya; Tamura, Takeyuki; Fukagawa, Daiji; Takasu, Atsuhiro

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comb

✍ Kärkkäinen, Juha; Stoye, Jens 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 278 KB

Approximation and parameterized algorith

✍ Akutsu, Tatsuya; Fukagawa, Daiji; Halldórsson, Magnús M.; Takasu, Atsuhiro; Tana 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 622 KB

Algorithms for the constrained editing d

✍ Kaizhong Zhang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 KB