Originally posted by Fatimah at 2005-2-20 22:36:
咦....短路了..
作者: Fatimah 时间: 2005-2-20 22:44
拜托, 有高手不问,出来打野食?作者: yj_bobby 时间: 2005-2-20 22:45
看不明白作者: cherubyupan 时间: 2005-2-20 22:47
那个高手不睬我！cry2.gifcry2.gifcry2.gif
Originally posted by Fatimah at 2005-2-20 22:44:
拜托, 有高手不问,出来打野食?
作者: cherubyupan 时间: 2005-2-20 22:51
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 时间: 2005-2-20 23:33
