By Topic

A Fast Improved 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
$33 $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

5 Author(s)
Yong Huang ; Coll. of Comput. Sci. & Technol., Zhejiang Univ., Hangzhou ; Lingdi Ping ; Xuezeng Pan ; Li Jiang
more authors

With the remarkable increase in the number of nucleotide and acid 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, an improved BM algorithm (called BMBR) is presented. It bases on the method of BM algorithm and combines with the shift function of BR algorithm, thus reaches the best shift distance and improves the performance. The best and worst cases in time complexities of the proposed algorithm are also discussed. The experimental results show that the algorithm is faster than other compared algorithms for small alphabets and long patterns, and thus the proposed algorithm is quite suitable for pattern matching in biological sequences.

Published in:

Computational Intelligence and Design, 2008. ISCID '08. International Symposium on  (Volume:2 )

Date of Conference:

17-18 Oct. 2008