Phylogeny: Phenetics, Cladistics, Character-Based Methods, Parsimony, Similarity Coefficient, Distance Methods and UPGMA
Phylogeny deals with the evolutionary relationships and history of organisms, genes, proteins or other biological entities. In modern biology, phylogenetic analysis is widely used to understand how different organisms are related to one another and how they may have evolved from common ancestors.
There are different ways to construct classifications and evolutionary trees. Two important approaches are phenetics and cladistics. Phenetics mainly focuses on overall similarity, whereas cladistics emphasizes shared derived characters and common ancestry.
Phylogenetic methods can broadly be divided into character-based methods and distance-based methods. The Law of Parsimony is an important principle associated with maximum parsimony, while similarity coefficients are commonly used when comparing organisms based on their characters. UPGMA is one of the important distance-based clustering methods.
These notes are written in simple language for CSIR-NET, GATE Biotechnology, DBT-BET, ICAR, MSc Biotechnology, Microbiology, Botany and Zoology examinations.
Index / Table of Contents
- What is Phylogeny?
- What is Phylogenetic Analysis?
- Phenetics
- Principle of Phenetics
- Phenetic Classification Workflow
- Cladistics
- Principle of Cladistics
- Phenetics vs Cladistics
- Character-Based Method
- Character Data in Phylogenetics
- Binary and Multistate Characters
- Law of Parsimony
- Maximum Parsimony
- Simple Parsimony Example
- Similarity Coefficient
- Similarity Coefficient Formula
- Similarity Example
- Distance-Based Method
- Distance Matrix
- Similarity vs Distance
- UPGMA
- Principle of UPGMA
- Step-by-Step UPGMA
- Simple UPGMA Example
- UPGMA and Ultrametric Assumption
- Advantages of UPGMA
- Limitations of UPGMA
- Comparison of Phylogenetic Methods
- Complete Phylogenetic Workflow
- Applications
- Important Exam Facts
- MCQs
- FAQs
- Last-Minute Revision
1. What is Phylogeny?
Phylogeny refers to the evolutionary history and relationships of organisms, genes, proteins or other biological entities.
The word can be understood in a simple way:
For example, if scientists want to know whether two bacterial species share a recent common ancestor, they can compare their DNA or protein sequences and perform phylogenetic analysis.
The result may be represented using a phylogenetic tree.
Simple example
Suppose we have four organisms: A, B, C and D.
If A and B share a more recent common ancestor than either shares with C or D, the tree will place A and B together as a closely related pair.
Phylogenetic analysis is therefore not simply about asking which organisms look similar. It attempts to understand relationships in an evolutionary framework.
Important: A phylogenetic tree is an inferred hypothesis about relationships. It is not a literal photograph of evolutionary history.
2. What is Phylogenetic Analysis?
Phylogenetic analysis is the process of using biological data to infer evolutionary relationships.
The data may come from:
- Morphological characters
- Anatomical characters
- Fossil characters
- Biochemical characters
- DNA sequences
- RNA sequences
- Protein sequences
- Genome data
Depending on the data and method, researchers can construct different types of trees.
3. Phenetics
Phenetics is an approach to classification that groups organisms according to their overall observable or measurable similarity.
The important point is that phenetics does not necessarily attempt to determine the actual evolutionary history of the organisms.
Instead, many characters are measured and organisms are grouped according to their overall similarity.
Simple example
Suppose organisms A and B share 90% of the characters being studied, while A and C share only 60%.
A phenetic analysis would generally consider A and B more similar than A and C.
4. Principle of Phenetics
The basic idea of phenetics is:
Many characters can be converted into numerical data. Similarity coefficients or distance measures can then be calculated, followed by clustering.
Important features of phenetics
- Uses many characters.
- Attempts to measure overall similarity.
- Uses numerical methods.
- Can use similarity or distance matrices.
- Often uses clustering techniques.
- Does not necessarily distinguish ancestral from derived characters.
5. Phenetic Classification Workflow
6. Cladistics
Cladistics is an approach to biological classification that focuses on evolutionary relationships using shared derived characters.
The groups recognized by cladistic analysis are called clades.
In cladistics, simply sharing a character is not enough. The character should be evaluated in an evolutionary context, particularly whether it is a derived state shared by members of a group.
Synapomorphy
A synapomorphy is a shared derived character that supports a clade.
For example, if a derived character appears in an ancestor and is inherited by two descendant lineages, that shared derived character can provide evidence for grouping those lineages.
7. Principle of Cladistics
The main goal of cladistics is to identify groups based on common ancestry and shared derived characters.
Important terms include:
- Clade – an ancestor and all of its descendants.
- Synapomorphy – shared derived character.
- Apomorphy – derived character state.
- Plesiomorphy – ancestral character state.
- Autapomorphy – derived character state unique to a lineage in the analysis.
Exam point: Cladistics gives special importance to shared derived characters, not simply overall similarity.
8. Phenetics vs Cladistics
| Feature | Phenetics | Cladistics |
|---|---|---|
| Main focus | Overall similarity | Evolutionary relationships |
| Important data | Many measurable characters | Character states, especially shared derived states |
| Ancestral/derived distinction | Not central to basic phenetic grouping | Very important |
| Common output | Phenogram / dendrogram | Cladogram / phylogenetic hypothesis |
| Primary goal | Group similar organisms | Identify evolutionary relationships |
9. Character-Based Method
A character-based method constructs phylogenetic relationships by examining individual characters and their states.
Instead of converting all information into only a single overall distance, the method evaluates the character patterns directly.
Important character-based approaches include:
- Maximum Parsimony
- Maximum Likelihood
- Bayesian inference
For the topic in this article, Maximum Parsimony is particularly important because it is directly connected with the principle of parsimony.
10. Character Data in Phylogenetics
Character data can be morphological or molecular.
Morphological character
Example:
State 0 = Absent
State 1 = Present
Molecular character
For DNA sequences, an alignment position can be treated as a character.
States = A, T, G or C
Example character matrix
| Taxon | Character 1 | Character 2 | Character 3 | Character 4 |
|---|---|---|---|---|
| A | 0 | 1 | 1 | 0 |
| B | 0 | 1 | 1 | 1 |
| C | 1 | 0 | 1 | 1 |
| D | 1 | 0 | 0 | 1 |
A character matrix provides the raw information that can be analyzed to infer relationships.
11. Binary and Multistate Characters
Binary character
A binary character has two possible states.
Example:
1 = present
Multistate character
A multistate character has more than two possible states.
For example:
1 = yellow
2 = white
In molecular data, DNA characters can have four standard nucleotide states: A, T, G and C, although gaps and ambiguity codes may also occur depending on the dataset and analysis.
12. Law of Parsimony
The Law of Parsimony is a general reasoning principle that favors the simplest explanation when competing explanations account for the observations.
In phylogenetics, this idea is used in Maximum Parsimony.
In simple terms, if several possible trees can explain the observed characters, maximum parsimony prefers the tree that requires the smallest number of evolutionary changes under the specified assumptions.
Easy example
Suppose Tree 1 requires 8 character changes while Tree 2 requires 12 character changes.
Under maximum parsimony, Tree 1 would be preferred because it explains the observed character data with fewer changes.
Memory trick: Parsimony = fewest changes.
13. Maximum Parsimony
Maximum Parsimony (MP) is a character-based method of phylogenetic inference.
The method examines the observed character states and searches for a tree that minimizes the total number of evolutionary changes required to explain those states.
Basic steps
- Collect character data.
- Code the character states.
- Generate possible tree topologies.
- Calculate the number of changes required for each tree.
- Compare tree scores.
- Prefer the tree or trees with the minimum score.
14. Simple Parsimony Example
Imagine that three possible trees are generated from the same dataset.
| Tree | Number of inferred changes | Parsimony interpretation |
|---|---|---|
| Tree A | 7 | Preferred |
| Tree B | 10 | Less preferred |
| Tree C | 13 | Less preferred |
Under maximum parsimony, Tree A would be selected because it requires the fewest character-state changes.
If two or more trees have the same minimum score, the analysis may produce multiple equally parsimonious trees rather than forcing one arbitrary answer.
15. Similarity Coefficient
A similarity coefficient is a numerical measure used to describe how similar two objects, organisms or samples are based on selected characteristics.
In numerical taxonomy, organisms may be compared using many characters, and a similarity coefficient can summarize the degree of similarity between two taxa.
The exact formula depends on the coefficient being used and the type of data.
Why is similarity important?
If two organisms have many characters in common, their calculated similarity may be high. If they differ in many characters, their similarity may be lower.
Similarity values can then be used to construct a similarity matrix and perform clustering.
16. Similarity Coefficient Formula
For simple binary character data, one common approach is to calculate the proportion of matching characters.
For example, suppose two organisms are compared for 10 binary characters and they match at 8 positions.
This is a simple conceptual example. Different formal coefficients may treat shared presences, shared absences and mismatches differently.
Exam caution: Do not assume that every similarity coefficient uses exactly the same formula. The formula depends on the coefficient and data type.
17. Similarity Example
Consider two organisms X and Y compared for five characters:
| Character | Organism X | Organism Y | Match? |
|---|---|---|---|
| 1 | 1 | 1 | Yes |
| 2 | 0 | 0 | Yes |
| 3 | 1 | 0 | No |
| 4 | 1 | 1 | Yes |
| 5 | 0 | 1 | No |
They match at 3 out of 5 positions.
Again, this is a basic illustration. In actual numerical taxonomy, a specific coefficient appropriate to the data may be selected.
18. Distance-Based Method
A distance-based method first summarizes the difference between pairs of organisms or sequences as numerical distances.
The resulting distances are commonly organized into a distance matrix.
Important distance-based approaches include:
- UPGMA
- Neighbor-Joining
Basic concept
If two organisms have a small evolutionary distance, they are considered more similar under the chosen distance measure. If their distance is large, they are considered more different.
19. Distance Matrix
A distance matrix contains the pairwise distances between taxa.
For example:
| A | B | C | D | |
|---|---|---|---|---|
| A | 0 | 2 | 6 | 8 |
| B | 2 | 0 | 5 | 7 |
| C | 6 | 5 | 0 | 4 |
| D | 8 | 7 | 4 | 0 |
The diagonal contains zeros because the distance of a taxon from itself is zero.
Notice that:
C–D = 4
Therefore, A and B have the smallest distance in this simple example.
20. Similarity vs Distance
Similarity and distance are related concepts, but they are not identical.
| Similarity | Distance |
|---|---|
| Measures how alike two objects are | Measures how different or separated they are |
| Higher value usually means greater similarity | Higher value usually means greater difference |
| Often used in numerical taxonomy | Common input for distance-based tree methods |
| May be converted into a distance measure | May be derived from sequence differences or other data |
Low similarity ≈ Large distance
21. What is UPGMA?
UPGMA stands for:
UPGMA is a hierarchical clustering method that constructs a tree from a distance matrix.
It is one of the most important methods in numerical taxonomy and phylogenetic-methods syllabi.
The basic idea is simple:
22. Principle of UPGMA
UPGMA begins with each taxon as a separate cluster.
The two clusters with the smallest distance are joined first.
After joining them, the distance between the new cluster and every remaining cluster is recalculated using the arithmetic mean of the pairwise distances between the members of the two clusters.
This process continues until all taxa are combined into one tree.
Why is it called "Unweighted"?
In the classical UPGMA procedure, cluster distances are based on arithmetic means of the pairwise distances, rather than assigning special weights to particular taxa beyond their contribution as members of the clusters.
Why "Arithmetic Mean"?
Because the distance between two clusters is calculated using the average of the distances between their members.
23. Step-by-Step UPGMA
Step 1: Start with the distance matrix
Each organism is initially considered as an independent cluster.
Step 2: Find the smallest distance
Locate the two taxa or clusters having the smallest distance.
Step 3: Join them
Combine those two taxa into a new cluster.
Step 4: Calculate the new cluster distances
Calculate the arithmetic mean of the distances between the members of the new cluster and the other cluster.
Step 5: Repeat
Again find the smallest distance and join the corresponding clusters.
Step 6: Continue until one cluster remains
The sequence of clustering operations produces the UPGMA tree.
24. Simple UPGMA Example
Consider four taxa: A, B, C and D.
| A | B | C | D | |
|---|---|---|---|---|
| A | 0 | 2 | 6 | 8 |
| B | 2 | 0 | 5 | 7 |
| C | 6 | 5 | 0 | 4 |
| D | 8 | 7 | 4 | 0 |
Step 1: Find the smallest distance
The smallest distance is:
Therefore, A and B are joined first.
Step 2: Create cluster AB
Now we need the distance between cluster AB and C.
= (6 + 5) / 2
= 5.5
Similarly:
= (8 + 7) / 2
= 7.5
The updated matrix becomes conceptually:
| AB | C | D | |
|---|---|---|---|
| AB | 0 | 5.5 | 7.5 |
| C | 5.5 | 0 | 4 |
| D | 7.5 | 4 | 0 |
Step 3: Find the next smallest distance
The smallest remaining distance is:
Therefore, C and D are joined.
Step 4: Join the two remaining clusters
Now we have two clusters:
- AB
- CD
The distance between them is calculated as the average of all pairwise distances:
= (6 + 8 + 5 + 7) / 4
= 26 / 4
= 6.5
Thus the final UPGMA clustering gives the basic topology:
UPGMA exam method: Always identify the smallest distance first, merge those taxa, calculate average distances for the new cluster, update the matrix, and repeat.
25. UPGMA and the Ultrametric Assumption
One of the most important points about UPGMA is its classical assumption of a constant evolutionary rate across the lineages being analyzed.
This is commonly described as a molecular clock assumption.
Under this assumption, the distance between taxa is compatible with an ultrametric tree.
If evolutionary rates differ substantially among lineages, UPGMA can produce an incorrect topology.
Very important for exams: UPGMA assumes a constant rate of evolution. Neighbor-Joining does not require this strict molecular-clock assumption.
26. Advantages of UPGMA
- Conceptually simple.
- Easy to calculate manually for small datasets.
- Works directly from a distance matrix.
- Fast and computationally straightforward.
- Useful for hierarchical clustering.
- Historically important in numerical taxonomy.
- Easy to understand for introductory phylogenetics.
27. Limitations of UPGMA
- It assumes a constant evolutionary rate across lineages in its classical phylogenetic use.
- Violations of the molecular-clock assumption can lead to incorrect tree topology.
- It reduces the original data to pairwise distances, so some information may be lost.
- Results depend strongly on the distance measure used.
- It is not always suitable for datasets with substantially different evolutionary rates among lineages.
28. Comparison of Major Methods
| Method / Approach | Main basis | Important concept |
|---|---|---|
| Phenetics | Overall similarity | Group similar organisms |
| Cladistics | Shared derived characters | Common ancestry |
| Maximum Parsimony | Character states | Minimum number of changes |
| Distance-based method | Pairwise distances | Distance matrix |
| UPGMA | Distance matrix | Average-distance clustering + constant-rate assumption |
| Neighbor-Joining | Distance matrix | Distance-based tree without UPGMA's strict molecular-clock assumption |
| Maximum Likelihood | Character/site data + evolutionary model | Maximize likelihood of observed data |
| Bayesian inference | Character/site data + probabilistic model | Posterior probabilities |
29. Complete Phylogenetic Workflow
30. Applications of These Methods
1. Microbial classification
Numerical and phylogenetic methods can help classify bacteria, archaea and other microorganisms.
2. Molecular evolution
DNA and protein sequences can be compared to investigate evolutionary relationships.
3. Species identification
Phylogenetic methods can help distinguish closely related organisms.
4. Comparative genomics
Evolutionary relationships can help researchers compare genes and genomes across organisms.
5. Epidemiology
Phylogenetic analysis can help study relationships among pathogen sequences when combined with appropriate epidemiological information.
6. Biodiversity studies
Phylogenetic information can support studies of biodiversity and evolutionary history.
7. Numerical taxonomy
Phenetic and distance-based methods can be used to organize organisms according to measurable similarities or distances.
31. Important Exam Facts
- Phylogeny = evolutionary history and relationships.
- Phenetics = classification based mainly on overall similarity.
- Cladistics = emphasizes shared derived characters and common ancestry.
- Synapomorphy = shared derived character.
- Character-based method = analyzes individual characters and their states.
- Maximum Parsimony = prefers the tree requiring the fewest character-state changes under its assumptions.
- Parsimony = simplest explanation / minimum changes.
- Similarity coefficient = numerical measure of similarity.
- Distance-based method = uses pairwise distance information.
- Distance matrix = table containing pairwise distances.
- UPGMA = Unweighted Pair Group Method with Arithmetic Mean.
- UPGMA is a hierarchical clustering method.
- UPGMA uses arithmetic mean distances when joining clusters.
- Classical phylogenetic use of UPGMA assumes a constant evolutionary rate.
- UPGMA can be problematic when evolutionary rates differ substantially among lineages.
- Neighbor-Joining is distance-based and does not require UPGMA's strict molecular-clock assumption.
- Phenetics and cladistics are conceptually different approaches.
- A similarity-based dendrogram should not automatically be interpreted as an evolutionary tree.
32. Multiple Choice Questions
Q1. Phylogeny refers to:
A. Cell division
B. Evolutionary history and relationships
C. Protein synthesis
D. Enzyme kinetics
Answer: B
Q2. Phenetics primarily considers:
A. Overall similarity
B. Only fossil age
C. Only ancestral characters
D. Gene expression
Answer: A
Q3. Cladistics mainly emphasizes:
A. Overall body size
B. Shared derived characters
C. Geographic distance
D. Total protein concentration
Answer: B
Q4. A shared derived character is called:
A. Plesiomorphy
B. Synapomorphy
C. Symplesiomorphy
D. Homoplasy
Answer: B
Q5. Which is a character-based phylogenetic method?
A. Maximum Parsimony
B. UPGMA
C. Basic clustering
D. Distance matrix alone
Answer: A
Q6. Maximum Parsimony prefers the tree with:
A. Maximum number of changes
B. Minimum number of inferred changes
C. Maximum number of taxa
D. Maximum branch length
Answer: B
Q7. A similarity coefficient measures:
A. Similarity between objects or taxa
B. DNA replication rate
C. Protein molecular weight only
D. Cell size
Answer: A
Q8. A distance matrix contains:
A. Pairwise distances
B. Only DNA sequences
C. Protein structures
D. Gene expression values only
Answer: A
Q9. UPGMA stands for:
A. Universal Phylogenetic Grouping Method Analysis
B. Unweighted Pair Group Method with Arithmetic Mean
C. Unified Protein Grouping Method Analysis
D. Unrooted Phylogenetic Group Method Algorithm
Answer: B
Q10. UPGMA is primarily a:
A. Distance-based clustering method
B. Protein sequencing method
C. DNA amplification method
D. Genome annotation method
Answer: A
Q11. In UPGMA, which pair is joined first?
A. Pair with maximum distance
B. Pair with minimum distance
C. Random pair
D. Pair with maximum sequence length
Answer: B
Q12. The distance between clusters in UPGMA is calculated using:
A. Arithmetic mean
B. Geometric mean only
C. Maximum distance only
D. Random sampling
Answer: A
Q13. Classical UPGMA assumes:
A. Constant evolutionary rate
B. No evolution
C. Random evolution only
D. No sequence variation
Answer: A
Q14. Which method does not require the strict molecular-clock assumption of UPGMA?
A. Neighbor-Joining
B. UPGMA
C. Simple average clustering
D. None
Answer: A
Q15. High similarity generally corresponds to:
A. Large distance
B. Small distance
C. No relationship
D. Infinite distance
Answer: B
Q16. In a binary character matrix, 0 and 1 commonly represent:
A. Character states
B. Species names
C. Branch lengths
D. Protein sizes
Answer: A
Q17. Which statement is correct?
A. Every phenetic dendrogram is an evolutionary tree
B. Phenetics emphasizes overall similarity
C. UPGMA is a character-based method
D. Parsimony maximizes evolutionary changes
Answer: B
Q18. If Tree A requires 8 changes and Tree B requires 12 changes, maximum parsimony generally prefers:
A. Tree A
B. Tree B
C. Both automatically
D. Neither
Answer: A
33. Frequently Asked Questions
What is phylogeny?
Phylogeny refers to the evolutionary history and relationships among organisms, genes, proteins or other biological entities.
What is phenetics?
Phenetics is an approach that groups organisms according to their overall similarity using many measurable characters.
What is cladistics?
Cladistics is an approach that focuses on common ancestry and shared derived characters.
What is a character-based method?
It is a phylogenetic approach that analyzes individual characters and their states directly. Maximum Parsimony is a major example.
What is the Law of Parsimony?
It is the principle of preferring the simplest explanation among competing explanations. In maximum parsimony, this corresponds to preferring the tree requiring the fewest character-state changes.
What is a similarity coefficient?
It is a numerical measure that describes the degree of similarity between two objects or taxa based on selected characteristics.
What is a distance-based method?
A distance-based method uses pairwise distances among taxa, often summarized in a distance matrix, to construct a tree.
What is UPGMA?
UPGMA stands for Unweighted Pair Group Method with Arithmetic Mean. It is a hierarchical clustering method that constructs a tree from a distance matrix.
Which pair is joined first in UPGMA?
The pair or clusters with the smallest distance are joined first.
Why does UPGMA use arithmetic mean?
After clusters are joined, the distance between the new cluster and another cluster is calculated as the arithmetic average of the relevant pairwise distances.
What is the main limitation of UPGMA?
Its classical phylogenetic interpretation assumes approximately equal evolutionary rates among lineages. If rates differ substantially, the inferred tree can be misleading.
Is UPGMA a character-based method?
No. UPGMA is a distance-based clustering method.
Is Maximum Parsimony a distance-based method?
No. Maximum Parsimony is a character-based method.
34. Last-Minute Revision
| Topic | One-Line Revision |
|---|---|
| Phylogeny | Evolutionary history and relationships |
| Phenetics | Overall similarity |
| Cladistics | Shared derived characters + common ancestry |
| Character | Feature used for comparison |
| Character state | Particular condition of a character |
| Synapomorphy | Shared derived character |
| Character-based method | Uses individual character states |
| Maximum Parsimony | Fewest inferred evolutionary changes |
| Similarity coefficient | Numerical measure of similarity |
| Distance-based method | Uses pairwise distances |
| Distance matrix | Table of pairwise distances |
| UPGMA | Unweighted Pair Group Method with Arithmetic Mean |
| UPGMA basis | Distance matrix and average-distance clustering |
| UPGMA first step | Join the smallest-distance pair |
| UPGMA assumption | Approximately constant evolutionary rate in classical use |
| Neighbor-Joining | Distance-based method without UPGMA's strict molecular-clock assumption |
35. Easy Memory Tricks
Cladistics = Clade / Common ancestry
Parsimony = Fewest changes
Distance method = Distance matrix
UPGMA = Smallest distance → Join → Average → Repeat
36. Final Summary
Phylogenetic analysis provides a systematic way to study relationships among organisms and biological sequences. Two classical approaches that are important in taxonomy are phenetics and cladistics.
Phenetics emphasizes overall similarity. Organisms are compared using many characters, similarity or distance values can be calculated, and clustering can be used to produce a dendrogram or phenogram.
Cladistics, in contrast, focuses on evolutionary relationships and gives particular importance to shared derived characters, or synapomorphies.
In character-based methods, individual character states are examined. Maximum Parsimony follows the principle of preferring the tree that requires the fewest inferred evolutionary changes under the chosen assumptions.
In distance-based methods, the original data are converted into pairwise distances. These distances are commonly represented as a distance matrix. UPGMA is a classical distance-based clustering method that repeatedly joins the closest clusters and recalculates their distances using arithmetic means.
Most important exam chain:
Phenetics → Overall similarity
Cladistics → Shared derived characters
Character-based → Individual character states
Maximum Parsimony → Minimum changes
Similarity coefficient → Similarity value
Distance-based → Pairwise distance
Distance matrix → Pairwise distances in table form
UPGMA → Unweighted Pair Group Method with Arithmetic Mean
UPGMA → Join smallest distance → Average → Repeat
UPGMA → Classical constant-rate assumption
No comments:
Post a Comment