Vesterstrøm Jakob, Taylor William R
BiRC-Bioinformatics Research Center, University of Aarhus, DK-8000 Aarhus C, Denmark.
J Comput Biol. 2006 Jan-Feb;13(1):43-63. doi: 10.1089/cmb.2006.13.43.
We present a novel method for structural comparison of protein structures. The approach consists of two main phases: 1) an initial search phase where, starting from aligned pairs of secondary structure elements, the space of 3D transformations is searched for similarities and 2) a subsequent refinement phase where interim solutions are subjected to parallel, local, iterative dynamic programming in the areas of possible improvement. The proposed method combines dynamic programming for finding alignments but does not restrict solutions to be sequential. In addition, to deal with the problem of nonuniqueness of optimal similarities, we introduce a consensus scoring method in selecting the preferred similarity and provide a list of top-ranked solutions. The method, called FASE (flexible alignment of secondary structure elements), was tested on well-known data and various standard problems from the literature. The results show that FASE is able to find remote and weak similarities consistently using a reasonable run time. The method was tested (using the SCOP database) on its ability to discriminate interfold pairs from intrafold pairs at the level of the best existing methods. The method was then applied to the problem of finding circular permutations in proteins.
我们提出了一种用于蛋白质结构进行结构比较的新方法。该方法包括两个主要阶段:1)初始搜索阶段,从二级结构元件的对齐对开始,在三维变换空间中搜索相似性;2)后续优化阶段,在可能改进的区域对中间解进行并行、局部、迭代动态规划。所提出的方法结合了用于寻找比对的动态规划,但不将解限制为顺序的。此外,为了解决最优相似性的非唯一性问题,我们在选择首选相似性时引入了一种一致性评分方法,并提供了排名靠前的解的列表。该方法称为FASE(二级结构元件的灵活比对),在知名数据和文献中的各种标准问题上进行了测试。结果表明,FASE能够在合理的运行时间内一致地找到远程和弱相似性。该方法(使用SCOP数据库)在区分折叠间对和折叠内对的能力方面,在现有最佳方法的水平上进行了测试。然后将该方法应用于寻找蛋白质中的环状排列问题。