Haplotype Inferring Via Galled-Tree Networks Is NP-Complete

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao. Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. In Xiaodong Hu, Jie Wang, editors, Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings. Volume 5092 of Lecture Notes in Computer Science, pages 287-298, Springer, 2008. [doi]

Abstract

Abstract is missing.