带通配符的模式匹配问题及其解空间特征分析

项泰宁
项泰宁

计算机科学, 2014.

Cited by: 0|Views39

Abstract:

随着生物信息学、信息检索等领域的发展,带有通配符和长度约束的模式匹配问题引起了广泛关注。该问题扩展了精确模式匹配问题,使匹配更加灵活,同时也增加了匹配的复杂性,极大地提高了非线性匹配算法的复杂度。求解该问题的匹配算法的效率与问题的解空间密切相关,而目前针对该问题的解空间及其特征尚缺乏系统的研究。鉴于此,描述了该问题的解空间,并分析了解空间的可分性。之后,提出解空间划分算法SPLIT,并分析了SPLIT的时间复杂性。实验部分以3个匹配算法为对照,在真实DNA数据集下,使用了5109组模式。实验结果表明,SPLIT不影响匹配解的结构,且可以有效降低非线性匹配算法的时间消耗。

Code:

Data:

ZH带通配符的模式匹配问题及其解空间特征分析
Get fulltext within 24h
Bibtex
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

Upload a single paper

for 5 coins

Wechat's Red Packet
?

Upload 50 articles

for 250 coins

Wechat's Red Packet
?

Upload 200 articles

for 1000 coins

Wechat's Red Packet
?

Upload 500 articles

for 2500 coins

Wechat's Red Packet
?

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :
0

 

Tags
Comments