| 查看: 1121 | 回复: 1 | ||
| 本帖产生 1 个 翻译EPI ，点击这里进行查看 | ||
[求助]
关于序列比对算法 的一小段翻译，尽量精确，金币多多~
|
||
| 对于相似的同源DNA 序列，本文方法指定第一条序列作为中心星序列。依次将该序列与其他序列做比对，记录下每次中心星序列插入空格的位置，这些可以写入文件保存，以节省内存消耗。设第一条序列长为m，则在这m个字符中间及前后共有m+1 个位置可以插入空隙，当比对之后，综合第一条序列与每条序列比对时插入的空格，记录每个空隙在比对过程中最多插入的空格数。于是m个碱基和m+1 个空隙组成了第一条序列（中心星序列）的最终比对结果。得到了比对后的中心星序列，再依次将各个序列与该序列比对，便得到了最终比对结果。值得注意的是，中心星序列综合入所有插入的空格后，一定比所有其他序列都长，最后的比对不允许向中心星序列插入空格，对应于图1 的动态规划表就是只允许向前或向左上回溯，不可以向上回溯。 |
回复此楼
alvarohao
铁杆木虫 (著名写手)
- 翻译EPI: 85
- 应助: 0 (幼儿园)
- 贵宾: 0.005
- 金币: 13664.2
- 红花: 3
- 沙发: 5
- 帖子: 2355
- 在线: 261.5小时
- 虫号: 1402388
- 注册: 2011-09-15
- 性别: MM
- 专业: 机械结构强度学
【答案】应助回帖
★
爱与雨下(金币+1): 2011-12-15 12:41:35
wannengk(金币+35, 翻译EPI+1): 3Q~ 2011-12-18 22:45:29
爱与雨下(金币+1): 2011-12-15 12:41:35
wannengk(金币+35, 翻译EPI+1): 3Q~ 2011-12-18 22:45:29
| For the similar homologous DNA sequences, this paper assigned the first sequence as the central star sequence. Successively compare it with other sequences, and record the position where the central star sequence was inserted by a blank space, writing into a file to save the RAM. Suppose the length of the first sequence is m, there will be m+1 positions for the blank space to be inserted among the m characters and their front and back. After the comparison, the number of the most blank spaces inserted in the interspace during the comparison was recorded. Therefore, the m basic groups and the m+1 interspaces formed the last comparison result of the first sequence (the central star sequence). After getting the compared central star sequence, successively compare each sequence with this sequence to get the last comparison results. It is worth noting that the central star sequence after inserting blank spaces is longer than other sequences and it is not allowed to insert any blank space into it. The dynamic programming table corresponding to Figure 1 only allowed the front or up-left backtracking，not upward. |
2楼2011-12-15 11:01:54