✦ LIBER ✦

Fast algorithms for computing the tripartition-based distance between phylogenetic networks

✍ Scribed by Nguyen Bao Nguyen; C. Thach Nguyen; Wing-Kin Sung

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new fast algorithm for computing the d

✍ Cheng-lei Yang; Meng Qi; Xiang-xu Meng; Xue-qing Li; Jia-ye Wang 📂 Article 📅 2006 🏛 SP Zhejiang University Press 🌐 English ⚖ 376 KB

Efficient algorithms for computing the m

✍ Binay K Bhattacharya; Godfried T Toussaint 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 822 KB

Optimal algorithms for computing the min

✍ Godfried T Toussaint; Binay K Bhattacharya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 293 KB

A memory-effective fast algorithm for co

✍ W.J. Rueger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 352 KB

An optimal algorithm for computing the m

✍ G. T. Toussaint 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 374 KB

Distributed localization algorithm for w

✍ Yingqiang Ding; Liufeng Du; Ting Yang; Yugeng Sun 📂 Article 📅 2009 🏛 Tianjin University 🌐 Chinese ⚖ 425 KB