寻找有限字母表上的最优有限生物序列:OptiFin工具箱
Finding optimal finite biological sequences over finite alphabets: the OptiFin toolbox
摘要:
在本文中,我们提出了一个特定的优化问题,经常出现在生物信息学或基因组学的工具箱。在这个特定的优化问题中,状态空间是有限字母表上指定长度的一组字。每个字都有一个对应的分数。总的目标是找到得分最低的单词。这种类型的一般优化问题在例如用于蛋白质结构预测的3D构象优化或基于一组物种的最佳支持的系统发育树的最大核心基因子集发现中遇到。为了解决这个问题,我们提出了一个工具箱,可以很容易地使用MPI启动,并嵌入3个著名的元分析。该工具箱已完全参数化并有良好的文档记录。它被专门设计为易于修改,并可能由用户根据应用程序进行改进,并且不需要是计算机科学家。我们表明,该工具箱在两个困难的实际问题上表现得非常好。
英文摘要:
In this paper, we present a toolbox for a specific optimization problem that frequently arises in bioinformatics or genomics. In this specific optimisation problem, the state space is a set of words of specified length over a finite alphabet. To each word is associated a score. The overall objective is to find the words which have the lowest possible score. This type of general optimization problem is encountered in e.g 3D conformation optimisation for protein structure prediction, or largest core genes subset discovery based on best supported phylogenetic tree for a set of species. In order to solve this problem, we propose a toolbox that can be easily launched using MPI and embeds 3 well-known metaheuristics. The toolbox is fully parametrized and well documented. It has been specifically designed to be easy modified and possibly improved by the user depending on the application, and does not require to be a computer scientist. We show that the toolbox performs very well on two difficult practical problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。