default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaja Jothi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j14]Pengyi Yang
, Sean J. Humphrey, David E. James, Yee Hwa Yang, Raja Jothi:
Positive-unlabeled ensemble learning for kinase substrate prediction from dynamic phosphoproteomics data. Bioinform. 32(2): 252-259 (2016)- 2015
- [j13]Pengyi Yang, Xiaofeng Zheng, Vivek Jayaswal, Guang Hu, Jean Yee Hwa Yang, Raja Jothi:
Knowledge-Based Analysis for Detecting Key Signaling Events from Time-Series Phosphoproteomics Data. PLoS Comput. Biol. 11(8) (2015) - 2011
- [j12]Sailu Yellaboina, Asba Tasneem, Dmitri V. Zaykin, Balaji Raghavachari, Raja Jothi:
DOMINE: a comprehensive collection of known and predicted domain-domain interactions. Nucleic Acids Res. 39(Database-Issue): 730-735 (2011)
2000 – 2009
- 2009
- [j11]Mei Liu, Xue-wen Chen, Raja Jothi:
Knowledge-guided inference of domain-domain interactions from incomplete protein-protein interaction networks. Bioinform. 25(19): 2492-2499 (2009) - [j10]Raja Jothi, Balaji Raghavachari:
Degree-bounded minimum spanning trees. Discret. Appl. Math. 157(5): 960-970 (2009) - [j9]Raja Jothi, Balaji Raghavachari:
Improved approximation algorithms for the single-sink buy-at-bulk network design problems. J. Discrete Algorithms 7(2): 249-255 (2009) - 2008
- [j8]Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi:
DOMINE: a database of protein domain interactions. Nucleic Acids Res. 36(Database-Issue): 656-661 (2008) - 2007
- [j7]Raja Jothi, Teresa M. Przytycka, L. Aravind:
Discovering functional linkages and uncharacterized cellular pathways using phylogenetic profile comparisons: a comprehensive assessment. BMC Bioinform. 8 (2007) - [j6]Raja Jothi, Balaji Raghavachari:
Approximating the k-traveling repairman problem with repairtimes. J. Discrete Algorithms 5(2): 293-303 (2007) - 2006
- [j5]Elena Zotenko, Katia S. Guimarães, Raja Jothi, Teresa M. Przytycka:
Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations. Algorithms Mol. Biol. 1 (2006) - [j4]Raja Jothi, Elena Zotenko, Asba Tasneem, Teresa M. Przytycka:
COCO-CL: hierarchical clustering of homology relations based on evolutionary correlations. Bioinform. 22(7): 779-788 (2006) - [j3]Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi:
Load-balanced agent activation for value-added network services. Comput. Commun. 29(11): 1905-1916 (2006) - 2005
- [j2]Raja Jothi, Balaji Raghavachari:
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Trans. Algorithms 1(2): 265-282 (2005) - [c10]Raja Jothi, Maricel G. Kann, Teresa M. Przytycka:
Predicting protein-protein interaction by searching evolutionary tree automorphism space. ISMB (Supplement of Bioinformatics) 2005: 241-250 - [c9]Elena Zotenko, Katia S. Guimarães, Raja Jothi, Teresa M. Przytycka:
Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations. Systems Biology and Regulatory Genomics 2005: 23-38 - 2004
- [j1]Raja Jothi, Balaji Raghavachari:
Survivable network design: the capacitated minimum spanning network problem. Inf. Process. Lett. 91(4): 183-190 (2004) - [c8]Raja Jothi, Balaji Raghavachari:
Degree-bounded minimum spanning trees. CCCG 2004: 192-195 - [c7]Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç:
Load balancing for reliable multicast. Communications, Internet, and Information Technology 2004: 86-91 - [c6]Raja Jothi, Balaji Raghavachari:
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. ICALP 2004: 805-818 - [c5]Vinod Vokkarane, Jianping Wang, Xiangtong Qi, Raja Jothi, Balaji Raghavachari, Jason P. Jue:
Dynamic dual-homing protection in WDM mesh networks. ICC 2004: 1644-1648 - [c4]Raja Jothi, Balaji Raghavachari:
Minimum Latency Tours and the k-Traveling Repairmen Problem. LATIN 2004: 423-433 - [c3]Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç:
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. SAC 2004: 334-338 - [c2]Raja Jothi, Balaji Raghavachari:
Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. SWAT 2004: 336-348 - 2003
- [c1]Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan:
A 5/4-approximation algorithm for minimum 2-edge-connectivity. SODA 2003: 725-734
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-04-24 23:08 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:
