✦ LIBER ✦

Improved approximation of the largest common subtree of two unordered trees of bounded height

✍ Scribed by Tatsuya Akutsu; Daiji Fukagawa; Atsuhiro Takasu

Book ID: 108154594
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 291 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.09.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the approximation of largest common s

On the approximation of largest common subtrees and largest common point sets

✍ Tatsuya Akutsu; Magnús M. Halldórsson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 136 KB

This paper considers the approximability of the largest common subtree and the largest common point-set problems, which have applications in molecular biology. It is shown that the problems cannot be approximated within a factor of n 1-in polynomial time for any ¿0 unless NP ⊆ ZPP, while a general s

An algorithm for finding the largest app

An algorithm for finding the largest approximately common substructures of two trees

✍ Wang, J.T.L.; Shapiro, B.A.; Shasha, D.; Zhang, K.; Currey, K.M. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 133 KB

Improved bounds for the largest eigenval

Improved bounds for the largest eigenvalue of trees

✍ Oscar Rojo 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 200 KB