1. Pevzner P, Sze S, et al: Combinatorial approaches to finding subtle signals in DNA sequences. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, August 19-23. 2000, AAAI 2000:269–278, , La Jolla / San Diego, CA, USA, Volume 8
2. Lanctot J, Li M, Ma B, Wang S, Zhang L: Distinguishing string selection problems. Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19. 1999, ACM/SIAM 1999:633–642, January , Baltimore, Maryland
3. Yu Q, Huo H, Zhang Y, Guo H: PairMotif: a new pattern-driven algorithm for planted (l,d) DNA motif search. PLoS ONE. 2012, 7 (10): e48442-10.1371/journal.pone.0048442.
4. Davila J, Balla S, Rajasekaran S: Fast and practical algorithms for planted (l,d) motif search. IEEE/ACM Trans Comput Biol and Bioinformatics. 2007, 4 (4): 544-552.
5. Dinh H, Rajasekaran S, Davila J: qPMS7: A Fast Algorithm for Finding (l,d)-Motifs in DNA and Protein Sequences. PLoS ONE. 2012, 7 (7): e41425-10.1371/journal.pone.0041425.