✦ LIBER ✦

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

✍ Scribed by Magnus Bordewich; Charles Semple

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Computational Complexity of Best

✍ Paulo Oliva 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 3 views

On the computational complexity of the m

✍ Z. -Q. Luo; D. L. Parnas 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 617 KB

On the Complexity of Isolating Real Root

✍ B. Mourrain; M.N. Vrahatis; J.C. Yakoubsohn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 217 KB

On the Computational Complexity of the B

✍ Joakim Sundnes; Bjørn Fredrik Nielsen; Kent Andre Mardal; Xing Cai; Glenn Terje 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 1005 KB

An effective algorithm for string correc

✍ R.L. Kashyap; B.J. Oommen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 981 KB

Pruning effect on nitrogen nutrient rele

✍ B. D. Kadiata; K. Mulongoy; B. Mambani 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 192 KB