hamburger menu
All Coursesall course arrow
adda247
reward-icon
adda247
    arrow
    arrow
    arrow
    ​The table below lists phylogenetic reconstruction methods and their descriptions, including both algorithmic and optimality-based methods or criteria
    Question

    The table below lists phylogenetic reconstruction methods and their descriptions, including both algorithmic and optimality-based methods or criteria.

    Method (Column X)

    Description (Column Y)

    A.

    Maximum parsimony

    i.

    Three length, that is sum of branch lengths, often estimated by least squares.

    B

    Minimum evolution

    ii.

    Minimum number of changes, minimized over ancestral states

    C.

    Bayesian

    iii.

    Cluster algorithms to arrive at a single tree.

    D.

    Neighbour Joining

    iv.

    Posterior probability, calculated by integrating it over branch lengths and substation parameters

    Select the option that best matches the tree reconstruction method (Column X) with its correct description in Column Y:

    A.

    A - ii, B - i, C - iv, D - iii

    B.

    A - iv, B - iii, C - i, D - ii

    C.

    A - i, B - ii, C - iv, D - iii

    D.

    A - i, B - iii, C - ii, D – iv

    Correct option is A


    Explanation:

    Each phylogenetic method uses a distinct approach to reconstruct evolutionary relationships. The correct pairings are:

    • A. Maximum Parsimony → (ii) Minimum number of changes, minimized over ancestral states
      • This method seeks the tree with the least evolutionary changes, assuming the simplest explanation is the best.
    • B. Minimum Evolution → (i) Tree length, sum of branch lengths, often estimated by least squares
      • This method minimizes the total branch length to find the most plausible tree.
    • C. Bayesian → (iv) Posterior probability, calculated by integrating it over branch lengths and substitution parameters
      • Bayesian inference estimates tree probability using statistical models that integrate branch length and substitution rates.
    • D. Neighbour Joining → (iii) Cluster algorithms to arrive at a single tree
      • A distance-based method that uses clustering to construct a single phylogenetic tree efficiently.

    Similar Questions

    test-prime-package

    Access ‘CSIR NET Life Sciences’ Mock Tests with

    • 60000+ Mocks and Previous Year Papers
    • Unlimited Re-Attempts
    • Personalised Report Card
    • 500% Refund on Final Selection
    • Largest Community
    students-icon
    354k+ students have already unlocked exclusive benefits with Test Prime!
    test-prime-package

    Access ‘CSIR NET Life Sciences’ Mock Tests with

    • 60000+ Mocks and Previous Year Papers
    • Unlimited Re-Attempts
    • Personalised Report Card
    • 500% Refund on Final Selection
    • Largest Community
    students-icon
    354k+ students have already unlocked exclusive benefits with Test Prime!
    Our Plans
    Monthsup-arrow