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

Arvind Gupta Ján Manuch Ladislav Stacho Xiaohong Zhao

Published in: COCOON (2008)

Keyphrases

gene trees
np complete
np hard
satisfiability problem
computational complexity
randomly generated
network structure
polynomial time complexity
binary tree
constraint satisfaction problems
conjunctive queries
network model
spanning tree
network design
np complete problems
social networks
neural network