phylogenetics
Methods in phylogenetics
2. Character-Based Method
Types of phylogenetic analysis methods
Konsep UPGMA :
indeks p-distance terkecil antar pasangan organisme akan
digunakan untuk menggabungkan kedua organisme tersebut
dalam 1 kelompok filogenetik (yang disebut "clade").
- UPGMA Method
mengutamakan aditifitas.
- Neighbor Joining Method
E
C
A B C E D
• So UPGMA is very simple and generates rooted trees, however…
• Major weakness is that the algorithm assumes that rates of evolution
are the same among different lineages
• This does not fit existing biological data, so probably shouldn’t use
UPGMA to build phylogenetic trees
• One variant of UPGMA tries to pair species in such a
way as to minimize the sum of the branch lengths
• On a rooted tree, pairs of species separated from each
other by only one node are called neighbors
• We have important relationships between neighbors of a
phylogenetic tree with four nodes
Neighbor-joining: Semakin kecil jarak antar pasangan sekuen maka
semakin mirip pula pasangan tersebut dan
semakin dekat hubungan kekerabatannya
• Species A ATGGCTATTCTTATAGTACG
• Species B ATCGCTAGTCTTATATTACA
• Species C TTCACTAGACCTGTGGTCCA
Distance(A,B) = 4/20
• Species D TTGACCAGACCTGTGGTCCG
• Species E TTGACCAGTTCTCTAGTTCG
B C D E A
E A,B C D E
B C A,B 0 2.5 4.5 3.5
A C 0 3 4
D 0 5
D
A,B E 0
B
E
C
A
The Minimum Evolution (ME) criterion:
in each iteration we separate the two D
sequences which result with the minimal
B E
sum of branch lengths
Neighbor’s Relation Method
The following hold for this tree
A C
a c
b d
B D
Neighbor-Joining Methods
• Other neighborliness approaches are available as well
• Neighbor-joining methods start with all species
arranged in a star tree
b
a c
a c
d
d e b e
2. Character-Based Method
• Maximum-Parsimony (MP)
• Maximum-Likelihood (ML)
• Bayesian Inference
2. Character-Based Method
• Advantages
• based on shared derived characters
• evaluates different tree topologies
• does not reduce the information
• Disadvantages
• computationally intensive for large datasets
• no correction for multiple mutations
• sensitive to unequal rates of evolution (long branch
attraction)
Number of
Mutasi
1
GGG GGA
0
Number Of Tree GGG
4
Ex: 2 1
ACA
ACG 0
Species A :GGA ACG
GCG GGA
ACG 6
GGG
GCG ACA
Maximum parsimony
• Sites are informative if
• they are variable
• The help us differentiate between trees
• At least 2 characters occur at least 2 times
• Site2 is uninformative because all three
possible trees require 1 evolutionary
change, G ->A.
• Site 3 is uninformative because all trees
require 2 changes.
• Site4 is uninformative because all trees
require 3 changes.
•
Site5 is informative because tree I requires
Same as one change, trees II and III require two
Site 7
• changes
• Site7 is informative,likesite 5
Site 9 is informative because tree II requires
one change, trees I and III require two.
site9+2*site5 4 5 6
- Maximum Likelihood Method
Sekuen.
- Maximum Likelihood Method
metode.