中文XML论坛--源码查错

姓名：(无权查看)
城市：(无权查看)
院校：(无权查看)

类别：algorithm and data struction

小弟业余爱好者，初学JAVA的算法及数据结构，有一个程序，据说是某大学的考试题，想了一个多星期还没弄出来，快急S偶了。
求各位大大帮帮忙，感激不尽。

题目：
Write a java program that reads two strings from the command line and outputs the cost of an optimal alignment for the two inputs as well as one alignment with the optimal score.

The program should implement a dynamic programming algorithm.

hits:
An alignment with optimal score is one that maximizes the total score when aligning two strings alowing gaps in both strings. The cost for aligning letters is given by a score matrix 。Assume that the cost of introducing a gap is -8. The cost for the alignment of the two strings is the sum of the costs at each possition.

You should meassure the execution time of your implementation and produce the file with your meassurements and conclusions. This means that you should write a program that tests sequence alignment for some sizes of the input and that you should provide experimental evidence for the calculated asymptotic execution time

谢谢

[此贴子已经被作者于2007-10-1 18:49:46编辑过]

姓名：(无权查看)
城市：(无权查看)
院校：(无权查看)

翻译：

用JAVA程序，从命令行读取两个字符串，输出这两个输入的最优（佳）对比的花费（COST）和输出有着最优分数的对比（alignment）

要求用动态规划(dynamic programming)

有着最优分数(score)的一个对比(alignment)是:当对比两个各自都允许间隙(gap)的字符串时,有着最大分数(score)的对比.通过一个分数矩阵来表示字母(letter)对比的花费.假设一个间隙(gap)的花费是-8.两个字符串对比的花费是各自位置的花费的总和.

应该测量执行时间(execution time),并生成一个包含有测量及结论的文件.表示你应该写一个程序,测试序列对比中的输入(input)的大小,必须提供计算执行时间的证据


	W 3 C h i n a ( since 2003 ) 旗下站点苏ICP备05006046号《全国人大常委会关于维护互联网安全的决定》《计算机信息网络国际联网安全保护管理办法》	42.969ms