文章基本信息

标题：An Index Based Skip Search Multiple Pattern Matching Algorithm
本地全文：下载
作者：Raju Bhukya ; Balram Parmer ; Anand Kulkarni 等
期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2011
卷号：3
期号：04
页码：1510-1517
出版社：Engg Journals Publications
摘要：DNA Pattern matching, the problem of finding sub sequences within a long DNA sequence has many applications in computational biology. As the sequences can be long, matching can be an expensive operation, especially as approximate matching is allowed. Searching DNA related data is a common activity for molecular biologists. In this paper we explore the applicability of a new pattern matching technique called Index based Skip Search Multiple Pattern matching algorithm (ISMPM), for DNA sequences. Our approach avoids unnecessary comparisons in the DNA sequence due to this, the number of comparisons gradually decreases and comparison per character ratio of the proposed algorithm reduces accordingly when compared to other existing popular methods. Our experimental results show that there is considerable amount of performance improvement. The total no of comparisons are drastically reduced when the length of the pattern increases in our algorithm.
关键词：DNA Sequence; Index; Skip Search; Pattern Matching.