EPMA: Efficient pattern matching algorithm for DNA sequences
- 1 September 2017
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 80, 162-170
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The exact online string matching problemACM Computing Surveys, 2013
- A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search AlgorithmsJournal of Computer Science, 2011
- Improving practical exact string matchingInformation Processing Letters, 2010
- Fast exact string matching algorithmsInformation Processing Letters, 2007
- Shift-or string matching with super-alphabetsInformation Processing Letters, 2003
- A text compression scheme that allows fast searching directly in the compressed fileACM Transactions on Information Systems, 1997
- A new approach to text searchingCommunications of the ACM, 1992
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977