Title of article :
On the Complexity of Inferring Rooted Evolutionary Trees
Author/Authors :
Jansson، نويسنده , , Jesper، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
We prove that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from [3].
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
