Gleizes A, Hénaut A
Centre de Génétique Moléculaire du CNRS, Gif sur Yvette, France.
Comput Appl Biosci. 1994 Jul;10(4):401-8. doi: 10.1093/bioinformatics/10.4.401.
A program for assembling sequences by using a global approach has been developed. By successive steps, a more and more precise classification of DNA fragments permits the positioning of the sequences on the contig; after having detected the pairs of overlapping sequences, groups are formed such that all sequences in a group overlap. Sequences common to several groups enable the groups to be ordered in a series. Ambiguities in the order of groups can arise at this stage, due to the presence of repeated fragments; different solutions are then proposed. Putting the groups into order leads to a preclassification of sequences. The fragments are then aligned by group, by searching for words common to all sequences in the group, and using an algorithm of dynamic programming. A detailed example on a set of nine sequences accompanies the description of the method.
已经开发了一种使用全局方法组装序列的程序。通过连续步骤,对DNA片段进行越来越精确的分类,从而将序列定位到重叠群上;在检测到重叠序列对之后,形成组,使得组中的所有序列都重叠。几个组共有的序列使这些组能够按顺序排列。由于存在重复片段,在这个阶段可能会出现组顺序的模糊性;然后提出了不同的解决方案。对组进行排序会导致序列的预分类。然后通过搜索组中所有序列共有的单词,并使用动态规划算法,按组对片段进行比对。该方法的描述附带了一组九个序列的详细示例。