Cart (Loading....) | Create Account
Close category search window

A Fast 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

4 Author(s)
Yong Huang ; Coll. of Comput. Sci. & Technol., Univ. Hangzhou, Hangzhou ; Xuezeng Pan ; Yunjun Gao ; Guoyong Cai

With the remarkable increase in the number of DNA and proteins sequences, it is more important for the study of pattern matching in querying sequence patterns in the biological sequence database. To further raise the performance of the pattern matching algorithm, a fast exact algorithm (called ZTBMH), which is a variation of Zhu-Takaoka algorithm, is presented. It absorbs the idea of Boyer-Moore-Horspool algorithm, which utilizes only bad character heuristic and reduces the number of comparisons, thus improves the performance in practice. The best, worst and average cases in time complexities of the new algorithm are also discussed in this paper. The experimental results show that the proposed algorithm works better than other compared algorithms, especially in case of small alphabets such as nucleotides sequences, and thus the proposed algorithm is quite applicable for exact pattern matching in biological sequences.

Published in:

Bioinformatics and Biomedical Engineering, 2008. ICBBE 2008. The 2nd International Conference on

Date of Conference:

16-18 May 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.