Related Experiment Video
Updated: Aug 23, 2026

In Vitro Selection of Aptamers to Differentiate Infectious from Non-Infectious Viruses
Published on: September 7, 2022
A FAST pattern matching algorithm
S S Sheik1, Sumit K Aggarwal, Anindya Poddar
1Bioinformatics Centre and Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore 560 012, India.
Abstract:
The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore, Quick-search, Raita, and Horspool. The overall performance of the proposed algorithm has been improved using the shift provided by the Quick-search bad-character and by defining a fixed order of comparison. These result in the reduction of the character comparison effort at each attempt. The best- and the worst- case time complexities are also presented in this paper. Most importantly, the proposed method has been compared with the other widely used algorithms. It is interesting to note that the new algorithm works consistently better for any alphabet size.
Related Concept Videos
Fixed Action Patterns
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in value between...
Rapid Identification of Pathogens
Wilcoxon Signed-Ranks Test for Matched Pairs
RACE - Rapid Amplification of cDNA Ends
Since the...
Multiple Comparison Tests
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...

