✦ LIBER ✦

A Polynomial-Time Algorithm for Near-Perfect Phylogeny

✍ Scribed by Fernández-Baca, David; Lagergren, Jens

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear-Time Algorithm for the Perfect

✍ Paola Bonizzoni 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 238 KB

A polynomial time algorithm for subpatte

✍ Nyo, H.L.; Minsoo Suk 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 269 KB

A polynomial time algorithm for GapCVPP

✍ ChengLiang Tian, LiDong Han, GuangWu Xu 📂 Article 📅 2013 🏛 Science in China Press (SCP) 🌐 English ⚖ 205 KB

A polynomial-time perfect sampler for th

✍ Masaki Yamamoto; Shuji Kijima; Yasuko Matsui 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 571 KB

A polynomial time generator for minimal

✍ Sager, Thomas J. 📂 Article 📅 1985 🏛 Association for Computing Machinery 🌐 English ⚖ 971 KB

A Fast Algorithm for the Computation and

✍ Kannan, Sampath; Warnow, Tandy 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 274 KB