Author:
Davila Jaime,Balla Sudha,Rajasekaran Sanguthevar
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Balla, S., Davila, J., Rajasekaran, S.: Approximation Algorithms for the Primer Selection, Planted Motif Search and Related Problems. In: Approximation Algorithms and Metaheuristics (to Appear)
2. Buhler, J., Tompa, M.: Finding motifs using random projections. Journal of Computational Biology 9(2), 225–242 (2002)
3. Chin, F.Y., Leung, H.C.: Voting algorithms for discovering long motifs. In: APBC (2005)
4. Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in dna sequences. In: ISMB, pp. 354–363 (2002)
5. Evans, P., Smith, A.: Toward optimal motif enumeration. In: WADS (2003)
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献