CHARACTERS                        1          2          3          4          5 SPECIES             A         0          0          1          0          0             B         1          0          1          0          1             C         1          0          1          1          0             D         1          1          1          0          1 Use the phenetic approach (similarity matrix, UPGMA) to draw the tree that derives from the above data matrix with species A-D and character traits 1-5, and 0 represents lacking the trait and 1 represents possession of the trait. Show your data matrices and final tree.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

                                   CHARACTERS

                       1          2          3          4          5

SPECIES

            A         0          0          1          0          0

            B         1          0          1          0          1

            C         1          0          1          1          0

            D         1          1          1          0          1

Use the phenetic approach (similarity matrix, UPGMA) to draw the tree that derives from the above data matrix with species A-D and character traits 1-5, and 0 represents lacking the trait and 1 represents possession of the trait. Show your data matrices and final tree.

Expert Solution
Step 1

To construct a phenetic tree using the UPGMA (Unweighted Pair Group Method with Arithmetic Mean) approach, we need to first construct a similarity matrix based on the presence or absence of character traits in each species. Then, we will use this matrix to calculate the distances between each species and group them together based on their similarities.

Here is the similarity matrix for the given data:

          A      B      C      D
    A   -      2      3      3
    B   -      -      1      2
    C   -      -      -      2
    D   -      -      -      -

In this matrix, the diagonal values are zero because the similarity between a species and itself is 100%. We can also see that the matrix is symmetrical since the similarity between species A and B is the same as the similarity between species B and A.

To calculate the distances between each species, we will use the following formula:

distance(A,B) = (similarity(A,B)) / (2 * n)

where n is the total number of character traits. This formula gives us the distance between species A and B based on their similarity score. We will use this distance to group these two species together in the tree.

Using this formula, we can calculate the distances between each pair of species and update our similarity matrix accordingly:

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Decision Making Process
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education