哪个好心的帮我做作业哇？

cherubyupan

关于INFORMATIC的！DANKE DANKE

cherubyupan

你帮我做？embarassedembarassedembarassed写几个很小很小的PROGRAMMING！关于蛋白质序列的比较和搜索！
还有谁给我讲解下下面这些东东哇！Algorithm
1 dynamic programming;
2 Needlman-Wunsch(
3 overlap
4 Smith Waterman  
5 heuristic

6 UPGMA clustering
7 metropolis algorithm
8 t-test
9 K-means clustering
10 Gillespie algorithm
11 Viterbi algorithm
12 Baum-Welch algorithm
13k-similarity D(K)

Originally posted by Fatimah at 2005-2-20 22:36:
咦....短路了..

cherubyupan

那个高手不睬我！cry2.gifcry2.gifcry2.gif

Originally posted by Fatimah at 2005-2-20 22:44:
拜托, 有高手不问,出来打野食?

cherubyupan

1.1
Is there a problem with the following algorithm for i = N + 1?
i=1;
while (i<=N && a[i]==b[i]) { i=i+1;}
if (i>N) {equal = true;} else {equal = false}
1.4
Write a program that finds a substring in a string (on a character by character basis, not using
built-in functions). Do this either in Java (if you can) or in Excel. Hint: with Excel, you have
to write iterations/loops spatially, i.e. use one cell per iteration and copy the body of the loop
into each cell.
1.5
Implement the Needleman-Wunsch algorithm (again, either in Java or in Excel)
1.6
Write down the algorithm for overlay matches.
3.4
Write a small clustering program (you can probably also simulate a simple clustering
algorithm with Excel). Print the expression matrix ordered according to the clustering (either
numerically or graphically, if you can). Vary clustering parameters and observe differences in
the result.

cherubyupan

行行好吧！