| 2008 |
| 9 | EE | Sudha Balla,
Sanguthevar Rajasekaran,
Ion I. Mandoiu:
Faster greedy algorithms for Multiple Degenerate Primer Selection.
BIBE 2008: 1-4 |
| 2007 |
| 8 | EE | Sudha Balla,
Sanguthevar Rajasekaran:
Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data.
ISBRA 2007: 260-269 |
| 7 | EE | Jaime Davila,
Sudha Balla,
Sanguthevar Rajasekaran:
Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data.
WABI 2007: 302-309 |
| 6 | EE | Jaime Davila,
Sudha Balla,
Sanguthevar Rajasekaran:
Fast and Practical Algorithms for Planted (l, d) Motif Search.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 544-552 (2007) |
| 5 | EE | Sudha Balla,
Sanguthevar Rajasekaran,
Ion I. Mandoiu:
Efficient Algorithms for degenerate Primer Search.
Int. J. Found. Comput. Sci. 18(4): 899-910 (2007) |
| 2006 |
| 4 | EE | Jaime Davila,
Sudha Balla,
Sanguthevar Rajasekaran:
Space and Time Efficient Algorithms for Planted Motif Search.
International Conference on Computational Science (2) 2006: 822-829 |
| 2005 |
| 3 | EE | Sanguthevar Rajasekaran,
Sudha Balla,
Chun-Hsi Huang,
Vishal Thapar,
M. Gryk,
M. Maciejewski,
M. Schiller:
Exact algorithms for motif search.
APBC 2005: 239-248 |
| 2 | EE | Sanguthevar Rajasekaran,
Sudha Balla,
Chun-Hsi Huang:
Exact algorithms for planted motif challenge problems.
APBC 2005: 249-259 |
| 1 | EE | Sanguthevar Rajasekaran,
Sudha Balla,
Chun-Hsi Huang:
Exact Algorithms for Planted Motif Problems.
Journal of Computational Biology 12(8): 1117-1128 (2005) |