Need help to find hamming distance
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?
• 857 views
•
link
written
by
anasjamshed
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
Need help to built Bootstrapping Phylogenetic Trees in MATLAB
written by anasjamshed
-
hamming and ultrameric distance
written by anasjamshed
-
Tutorial: Yes .. BBMap can do that! - Part II randomreads (read simulation), demuxbyname/filterbyna…
written by GenoMax
-
cluster groups of values disregarding specific sequence of values
written by mccormack •
-
Encountering Paml Error When Using Lazarus Package
written by Ncemami •
