摘要
提出利用正则表达式进行生物序列检索时应先确定该正则表达式的最优NFA,然后再转化为相应的算法步骤,进而提高生物序列的检索效率。并给出了一个具体的序列检索实例。
This paper presented that the regular expressions' optimal NFA should be first determined when we used them for biological sequence indexing, and then tumed into the corresponding algorithm steps, which could improve the efficiency of biological sequence's indexing. Furthermore, a retrieve instance of a specific biological sequence was showed in this paper.
出处
《莆田学院学报》
2009年第5期43-46,共4页
Journal of putian University
基金
福建农林大学校内青年基金(021749)
福建省自然科学基金资助项目(2006J0018)
关键词
正则表达式
序列检索
模式匹配
regular expression
sequence indexing
pattern matching