default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSudha Balla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j4]Sanguthevar Rajasekaran, Sudha Balla, Patrick Gradie, Michael R. Gryk, Krishna Kadaveru, Vamsi Kundeti, Mark W. Maciejewski, Tian Mi, Nicholas Rubino, Jay Vyas, Martin R. Schiller
:
Minimotif miner 2nd release: a database and web system for motif search. Nucleic Acids Res. 37(Database-Issue): 185-190 (2009)- 2007
- [j3]Sudha Balla, Sanguthevar Rajasekaran, Ion I. Mandoiu:
Efficient Algorithms for degenerate Primer Search. Int. J. Found. Comput. Sci. 18(4): 899-910 (2007) - [j2]Jaime I. Dávila, Sudha Balla, Sanguthevar Rajasekaran:
Fast and Practical Algorithms for Planted (l, d) Motif Search. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 544-552 (2007) - 2005
- [j1]Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang:
Exact Algorithms for Planted Motif Problems. J. Comput. Biol. 12(8): 1117-1128 (2005)
Conference and Workshop Papers
- 2009
- [c7]Dolly Sharma, Sudha Balla, Sanguthevar Rajasekaran, Nikoletta DiGirolamo:
Degenerate primer selection algorithms. CIBCB 2009: 155-162 - 2008
- [c6]Sudha Balla, Sanguthevar Rajasekaran, Ion I. Mandoiu:
Faster greedy algorithms for Multiple Degenerate Primer Selection. BIBE 2008: 1-4 - 2007
- [c5]Sudha Balla, Sanguthevar Rajasekaran:
Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data. ISBRA 2007: 260-269 - [c4]Jaime I. Dávila, Sudha Balla, Sanguthevar Rajasekaran:
Fast Algorithms for Selecting Specific siRNA in Complete mRNA Data. WABI 2007: 302-309 - 2006
- [c3]Jaime I. Dávila, Sudha Balla, Sanguthevar Rajasekaran:
Space and Time Efficient Algorithms for Planted Motif Search. International Conference on Computational Science (2) 2006: 822-829 - 2005
- [c2]Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang, Vishal Thapar, Michael R. Gryk, Mark W. Maciejewski, Martin R. Schiller:
Exact algorithms for motif search. APBC 2005: 239-248 - [c1]Sanguthevar Rajasekaran, Sudha Balla, Chun-Hsi Huang:
Exact algorithms for planted motif challenge problems. APBC 2005: 249-259
Parts in Books or Collections
- 2018
- [p1]Sudha Balla, Jaime I. Dávila, Marius Nicolae, Sanguthevar Rajasekaran:
Approximation Algorithms for the Primer Selection, PlantedMotif Search, and Related Problems. Handbook of Approximation Algorithms and Metaheuristics (2) 2018
Reference Works
- 2007
- [r1]Sudha Balla, Jaime I. Dávila, Sanguthevar Rajasekaran:
Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems. Handbook of Approximation Algorithms and Metaheuristics 2007
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-05 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
