arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.7416cs.DScs.CE
收藏

生物序列字符串匹配算法的比较研究

A Comparative Study on String Matching Algorithm of Biological Sequences

Pandiselvam. P, Marimuthu. T, Lawrance. R

摘要:

字符串匹配算法在计算生物学中起着至关重要的作用。生物序列的功能和结构关系由该序列的相似性决定。为此,研究人员应该意识到生物序列的相似性。生物序列间的相似性研究是揭示基因间进化和遗传关系的重要研究领域。本文研究了不同类型的字符串匹配算法,观察了它们的时间复杂度和空间复杂度。在这项研究中,我们评估了生物序列测试算法的性能。

英文摘要:

String matching algorithm plays the vital role in the Computational Biology. The functional and structural relationship of the biological sequence is determined by similarities on that sequence. For that, the researcher is supposed to aware of similarities on the biological sequences. Pursuing of similarity among biological sequences is an important research area of that can bring insight into the evolutionary and genetic relationships among the genes. In this paper, we have studied different kinds of string matching algorithms and observed their time and space complexities. For this study, we have assessed the performance of algorithms tested with biological sequences.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑