相比之下，生物信息学的搜索系统使用的是一对算法，基本上是将一个基因组中的数据与另一个基因组中的数据进行比对。
Bioinformatics searches, by contrast, use a couple algorithms that basically compare the data from one genome to the data from another.
本文主要对适用于生物序列数据上的后缀树索引技术和生物信息学中的多序列比对算法进行了分析和研究。
This thesis mainly focuses on the study of suffix tree index technical dealing with bio-sequences and multiple sequences alignment problem in bioinformatics.
序列比对算法是生物信息学中重要的研究方向之一，而动态规划法是序列比对算法中最有效最基本的方法。
Sequence alignment algorithm is an important research direction in Bioinfor-matics. Dynamic programming is the most efficient and basic method in sequence alignment algorithm.
多序列联配（MSA）在生物信息学研究中占有重要地位，MSA问题是一个典型的NP问题，遗传算法是求解NP完全问题的一种理想方法。
Multiple Sequence Alignment (MSA)has great importance in the field of Bioinformatics, MSA is a typical NP-Complete problem, and genetic algorithms (GAs )is the perfect method for solving NP-Complete.
多序列联配（MSA）在生物信息学研究中占有重要地位，MSA问题是一个典型的NP问题，遗传算法是求解NP完全问题的一种理想方法。
Multiple Sequence Alignment (MSA)has great importance in the field of Bioinformatics, MSA is a typical NP-Complete problem, and genetic algorithms (GAs )is the perfect method for solving NP-Complete.
应用推荐