✦ LIBER ✦

Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

✍ Scribed by Akutsu, Tatsuya; Fukagawa, Daiji; Halldórsson, Magnús M.; Takasu, Atsuhiro; Tanaka, Keisuke

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient exponential-time algorithms fo

✍ Akutsu, Tatsuya; Tamura, Takeyuki; Fukagawa, Daiji; Takasu, Atsuhiro 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 447 KB

[Lecture Notes in Computer Science] Comb

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

Approximation and Exact Algorithms for C

✍ Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 78 KB

Algorithms for the constrained editing d

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