Haplotype Inferring Via Galled-Tree Networks Is NP-Complete - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Arvind Gupta' in GoogleThis author has not been identified. Look up 'Ján Manuch' in GoogleThis author has not been identified. Look up 'Ladislav Stacho' in GoogleThis author has not been identified. Look up 'Xiaohong Zhao' in Google

runs on WebDSL