A Fast Exact Pattern Matching Algorithm for Biological Sequences

@article{Huang2008AFE,
  title={A Fast Exact Pattern Matching Algorithm for Biological Sequences},
  author={Yong Huang and Lingdi Ping and Xuezeng Pan and Guoyong Cai},
  journal={2008 International Conference on BioMedical Engineering and Informatics},
  year={2008},
  volume={1},
  pages={8-12}
}
Pattern matching is a powerful tool for querying sequence patterns in the biological sequence databases. The remarkable increase in the number of DNA and proteins sequences has also stimulated the study of many pattern matching algorithms. To further raise the performance of the pattern matching algorithm, a fast exact algorithm (called BRFS) is presented. It bases on the method of FS algorithm and absorbs the idea of BR algorithm during the pattern matching, thus reaches the best shift… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

et al

S. S. Sheik, S. K. Aggarwal, A. Poddar
“A fast pattern matching algorithm”, Journal of Chemical Information and Computer Sciences, (44): 1251–1256 • 2004

Experimental Results on String Matching Algorithms

Softw., Pract. Exper. • 1995
View 1 Excerpt

A Very Fast Substring Search Algorithm

Commun. ACM • 1990
View 2 Excerpts

Practical Fast Searching in Strings

Softw., Pract. Exper. • 1980
View 1 Excerpt

Similar Papers

Loading similar papers…