Question

In a heuristic tree search, only a small subset of all possible trees is examined.

(a) True

(b) False

The question was asked in examination.

My question is based upon Character Based Methods in chapter Phylogenetic Tree Construction Methods and Programs of Bioinformatics

Answer 1

Right answer is (a) True

Explanation: This method starts by carrying out a quick initial approximation, which is to build an NJ tree and subsequently modifying it slightly into a different topology to see whether that leads to a shorter tree.