应用于分类EST序列拼接的并行遗传算法  

Applying Paralleled Genetic Algorithm to Classified EST Sequence

作　　者：蔡晨远[1] 郁松年[1] 

机构地区：[1]上海大学计算机工程与科学学院,上海200072

出　　处：《计算机工程》2004年第22期6-7,39,共3页Computer Engineering

摘　　要：利用EST(Expressed Sequence Tag )序列数据发现新基因,是当前国际上基因组研究的热点,但程序设计十分复杂,计算量非常巨大。而遗传算法是一种能在复杂而庞大的搜索空间中利用问题的固有知识来缩小搜索范围,避免组合爆炸,从而得到最优解或准最优解的通用搜索算法。该文结合核酸序列的特征,提出了一种改进的并行遗传算法,应用于EST序列拼接的组合优化。To discover gene based on EST sequencing is a mainly concentrated work of the genome research world-widely. However, it always suffers some difficulties such as complex algorithm design and extremely mass of computation. The genetic algorithm (GA) is a kind of general search algorithm that finds most optimized solution or sub-optimized solution within complex and immense search space, and avoids information explosion by using internal characteristics of the problem. This paper proposes a specially improved genetic algorithm which can be applied to classified EST sequence,and offers a paralleled version as well.

关 键 词：并行遗传算法 EST序列 搜索算法 计算机 序列匹配 生物数据库 生物学 

分 类 号：O242.23[理学—计算数学] Q81[理学—数学]