1. A new approach to solve job sequencing problem using dynamic programming with reduced time complexity;Ahammad,2020
2. PMS6: A fast algorithm for motif discovery;Bandyopadhyay;International Journal of Bioinformatics Research and Applications,2014
3. Finding motifs using random projections;Buhler;Journal of Computational Biology,2004
4. Fast exact algorithms for the closest string and substring problems with application to the planted (L,d)-motif model;Chen;IEEE/ACM Transactions on Computational Biology and Bioinformatics,2011
5. Davila, J., Balla, S., & Rajasekaran, S. “Space and time efficient algorithms for planted motif search,” 2006. doi: 10.1007/11758525_110.