Yamada Kazunori D
1Graduate School of Information Sciences, Tohoku University, 6-3-09, Aramaki-Aza-Aoba, Aoba-ku, Sendai, 980-8579 Japan.
2Artificial Intelligence Research Center, National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan.
Algorithms Mol Biol. 2018 Feb 15;13:5. doi: 10.1186/s13015-018-0123-6. eCollection 2018.
A profile-comparison method with position-specific scoring matrix (PSSM) is among the most accurate alignment methods. Currently, cosine similarity and correlation coefficients are used as scoring functions of dynamic programming to calculate similarity between PSSMs. However, it is unclear whether these functions are optimal for profile alignment methods. By definition, these functions cannot capture nonlinear relationships between profiles. Therefore, we attempted to discover a novel scoring function, which was more suitable for the profile-comparison method than existing functions, using neural networks.
Although neural networks required derivative-of-cost functions, the problem being addressed in this study lacked them. Therefore, we implemented a novel derivative-free neural network by combining a conventional neural network with an evolutionary strategy optimization method used as a solver. Using this novel neural network system, we optimized the scoring function to align remote sequence pairs. Our results showed that the pairwise-profile aligner using the novel scoring function significantly improved both alignment sensitivity and precision relative to aligners using existing functions.
We developed and implemented a novel derivative-free neural network and aligner (Nepal) for optimizing sequence alignments. Nepal improved alignment quality by adapting to remote sequence alignments and increasing the expressiveness of similarity scores. Additionally, this novel scoring function can be realized using a simple matrix operation and easily incorporated into other aligners. Moreover our scoring function could potentially improve the performance of homology detection and/or multiple-sequence alignment of remote homologous sequences. The goal of the study was to provide a novel scoring function for profile alignment method and develop a novel learning system capable of addressing derivative-free problems. Our system is capable of optimizing the performance of other sophisticated methods and solving problems without derivative-of-cost functions, which do not always exist in practical problems. Our results demonstrated the usefulness of this optimization method for derivative-free problems.
带有位置特异性评分矩阵(PSSM)的轮廓比较方法是最精确的比对方法之一。目前,余弦相似度和相关系数被用作动态规划的评分函数来计算PSSM之间的相似度。然而,尚不清楚这些函数对于轮廓比对方法是否是最优的。根据定义,这些函数无法捕捉轮廓之间的非线性关系。因此,我们试图使用神经网络发现一种比现有函数更适合轮廓比较方法的新型评分函数。
尽管神经网络需要代价函数的导数,但本研究中要解决的问题却没有。因此,我们通过将传统神经网络与用作求解器的进化策略优化方法相结合,实现了一种新型的无导数神经网络。使用这个新型神经网络系统,我们优化了评分函数以比对远缘序列对。我们的结果表明,与使用现有函数的比对器相比,使用新型评分函数的成对轮廓比对器在比对灵敏度和精度方面均有显著提高。
我们开发并实现了一种用于优化序列比对的新型无导数神经网络和比对器(Nepal)。Nepal通过适应远缘序列比对并提高相似性得分的表现力来提高比对质量。此外,这种新型评分函数可以通过简单的矩阵运算实现,并易于整合到其他比对器中。而且我们的评分函数有可能提高远缘同源序列的同源性检测和/或多序列比对的性能。本研究的目标是为轮廓比对方法提供一种新型评分函数,并开发一种能够解决无导数问题的新型学习系统。我们的系统能够优化其他复杂方法的性能,并解决没有代价函数导数的问题,而这些问题在实际问题中并不总是存在的。我们的结果证明了这种优化方法对于无导数问题的有效性。