Haplotype Inferring via Galled-Tree Networks Is NP-Complete.

Arvind Gupta Mohammad M. Karimi Ján Manuch Ladislav Stacho Xiaohong Zhao

Published in: J. Comput. Biol. (2010)

Keyphrases

gene trees
np complete
satisfiability problem
randomly generated
np hard
computational complexity
constraint satisfaction problems
tree structure
network structure
tree structures
network design
spanning tree
conjunctive queries
computer networks
social networks
index structure
optimal solution
decision trees