✦ LIBER ✦

The Complexity of the Single Individual SNP Haplotyping Problem

✍ Scribed by Rudi Cilibrasi; Leo van Iersel; Steven Kelk; John Tromp

Publisher: Springer
Year: 2007
Tongue: English
Weight: 234 KB
Volume: 49
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-0029-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Practical Exact Algorithm for the Indi

A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI

✍ Jianxin Wang; Minzhu Xie; Jianer Chen 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 576 KB

A polynomial case of the parsimony haplo

A polynomial case of the parsimony haplotyping problem

✍ Giuseppe Lancia; Romeo Rizzi 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 189 KB

An Improved (and Practical) Parameterize

An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs

✍ Minzhu Xie; Jianxin Wang 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 427 KB

Complexity of the Frobenius problem

✍ J. L. Ramírez-Alfonsín 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 189 KB

The complexity of individuation

✍ Inna Semetsky 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

On the complexity of the pancake problem

✍ Fuxiang Yu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract We study the computational complexity of finding a line that bisects simultaneously two sets in the two‐dimensional plane, called __the pancake problem__, using the oracle Turing machine model of Ko. We also study the basic problem of bisecting a set at a given direction. Our main resul