Entering edit mode
3.1 years ago
anasjamshed
▴
140
I have these 4 sequences : X: TACCCGAT Y: TAAACGAT Z: AAAACGCG W: AAAACGAT
1)I want to define the distance S(u,v) between two sequences u and v to be simply the number of letter substitutions (Hamming distance).
2)Will this distance function S(u, v) be ultrametric on these four sequences?
3) I also need to build the average linkage (a.k.a., UP GMA) tree for these four sequences. and then Bootstrap the above data using 5 replicates and compute the confidence of each branch by using MATLAB.
Can anyone help me?
