Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
