摘要
序列比对是生物信息学中基本的信息处理方法,对于发现生物序列中的功能、结构和进化信息具有重要的意义。该文对典型的双序列比对算法Smith-Waterman、FASTA、BLAST以及多序列比对算法CLUSTAL进行了描述和评价;针对目前序列比对算法普遍存在的不足,简单介绍了应用KDD技术进行序列相似性发现的定义及其处理过程。
Sequence alignment is a basic information processing method in bioinformatics and useful for discovering functional,structural,and evolutionary information in biological sequences.Typical pair-wise sequence alignment algorithms of Smith-Waterman,FASTA and BLAST and multiple sequence alignment algorithm of CLUSTAL are described and evaluated in this paper.After analyzing the difficulties in sequence alignment ,a sequence alignment algorithm based on knowledge discovery is discussed.This paper describes the definition and data processing of knowledge discovery in this sequence alignment research.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第29期5-7,共3页
Computer Engineering and Applications
基金
北京市科技计划项目(编号:H020720030530-1)