By Topic

A Fast Hybrid Pattern Matching Algorithm for Biological Sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guoyong Cai ; Sch. of Comput. Sci. & Technol., Guilin Univ. of Electron. Technol., Guilin, China ; Xining Nie ; Yong Huang

With the remarkable increase in the number of DNA and proteins sequences, it is necessary to study pattern matching in querying sequence patterns in the biological sequence database. To further raise the performance of the pattern matching algorithm, a fast hybrid algorithm (called ZTFS) is presented. It bases on the basic method of Zhu-Takaoka algorithm and absorbs the idea of fast search during the pattern matching to reduce the number of comparisons, and thus improves the performance. The best, worst and average cases in time complexities of the algorithm are also outlined. The experimental results show that the new algorithm works better than other compared algorithms, especially in case of small alphabets such as nucleotides sequences, and thus the proposed algorithm is more suitable for exact pattern matching in biological sequences.

Published in:

Biomedical Engineering and Informatics, 2009. BMEI '09. 2nd International Conference on

Date of Conference:

17-19 Oct. 2009