[ Research ] [ Education ] [ Publications ] [Experience] [Talks] [Awards]


Raja Jothi

National Center for Biotechnology Information (NCBI)

National Library of Medicine (NLM)

National Institutes of Health (NIH)

8600 Rockville Pike; Bldg 38A, Room 8S816G

Bethesda, MD 20894

Phone: (301) 402-8221

Fax: (301) 480-9241

Email: jothi AT ncbi.nlm.nih.gov

URL: http://www.rajajothi.com

 

RESEARCH  INTERESTS

Computational Molecular Biology, Bioinformatics, Systems Biology, Comparative and Functional Genomics, Design and Analysis of Algorithms, Graph Theory

EDUCATION

Postdoc

National Center for Biotechnology Information (NCBI/NLM/NIH), Bethesda, MD, U.S.A.
Postdoctoral Research Fellow, August 2004 – July 2005
Advisor: Dr. Teresa Przytycka

Ph.D

University of Texas at Dallas, Richardson, TX, U.S.A.
Ph.D. in Computer Science, August 2004
Thesis: Approximation Algorithms for Single-Sink Edge Installation Problems and Other Graph Problems
Advisor: Prof. Balaji Raghavachari

M.S.

University of Texas at Dallas, Richardson, TX, U.S.A.
M.S. in Computer Science, December 2000
Specialization: Networks and Telecommunications

B.E.

University of Madras, Chennai, INDIA
B.E. in Computer Science and Engineering, April 1998

PROFESSIONAL EXPERIENCE

Postdoctoral Research Associate, National Institutes of Health (NIH)
National Center for Biotechnology Information (NCBI/NLM),  Bethesda, MD, USA, 2005 - present

  •  Studied functional interactions in E. coli and yeast on a genome-wide scale to understand evolutionary traits of proteins from various pathways and cellular systems.

  • Investigated protein interaction networks at the sequence, structure and network level to identify interacting domains based on sequence co-evolution.

  • Developed novel methods to perform a comparative analysis of large-scale genomic and proteomic data sets, and predict protein and domain interactions.

Postdoctoral Research Fellow ,National Institutes of Health (NIH)
National Center for Biotechnology Information (NCBI/NLM),  Bethesda, MD, USA, 2004 - 2005

  • Used co-evolution of protein sequences to understand and predict protein-protein interactions.
  • Designed and developed an algorithm, COCO-CL, for hierarchical clustering of homology relations based on correlation of evolutionary histories of individual genes.

Fall 2003, Spring 2004
Guest Lecturer
University of Texas at Dallas, Richardson, TX, USA

Taught graph algorithms for the graduate algorithms class.

August 2001 - August 2004
Teaching Assistant
University of Texas at Dallas, Richardson, TX, USA

Assisted in preparing and grading of homeworks, exams and programming assignments.

Graduate Courses

* Computer Algorithms (Spring 2002, Fall 2002, Spring 2003, Fall 2003, Spring 2004)
* Database Design (Fall 2001)
* Automata Theory (Fall 2002)

Undergraduate Courses

* Advanced Data Strucutres and Algorithms (Summer 2004)
* Operating Systems Concepts (Spring 2003, Summer 2003)
* Programming Languages (Fall 2003)

May 2002 - August 2002
Research Assistant
University of Texas at Dallas, Richardson, TX, USA

Designed 5/4-approximation algorithm for minimum cardinality 2-edge connectivity problem.

August 2000 - June 2001
Software Engineer
Westwave Communications, Richardson, TX, USA

* Designed and developed of variants of Call Forwarding Services (based on GR-580 and Bellcore standards)
* Designed requirements and call flows for Call Waiting Service
* Designed and developed Call Agent for testing Session Control and Trigger Management subsystem
* Part of a team that developed TimesTen database accessors

May 1998 - August 1999
Database Engineer
P’Four Software and Marketing Services Chennai, INDIA

* Designed Database Schemas – ER diagrams and Normalization
* Performed data requirements and validation.

November 1997 - March 1998
Intern
Nestle (INDIA) Limited Chennai, INDIA

Maintenance of Sales and Marketing database.

PUBLICATIONS are listed HERE

INVITED TALKS

  • “The Effects of Topology of Evolutionary Tree on Predicting Protein Interaction Specificity,” Department of Computer Science, University of Maryland, College Park, December 2004.
  • “The Effects of Topology of Evolutionary Tree on Predicting Protein Interaction Specificity,” Knots in Washington XIX: Topology in Biology, Georgetown University, Washington D.C., November 2004.
  • “Protein Folding in Hydrophobic-Hydrophilic Model,” National Center for Biotechnology Information (NCBI), National Institutes of Health (NIH), Bethesda, March 2004.
  • “Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and its Variants in Network Design,” Dept. of Computer Science, University of Maryland, College Park, April 2003.
  • “Leave No Stone Unturned: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees,” DIMACS Workshop on Geometric Optimization, New Jersey, May 2003.
  • “The Traveling Salesman Problem,” Dept. of Mathematics and Computer Science, Hobart and William Smith Colleges, Geneva, New York, March 2004.
  • “The Traveling Salesman Problem,” Dept. of Mathematics, Statistics and Computer Science, State University of New York (SUNY), Oneonta, New York, March 2004.
  • “Theory and Practice: Capacitated Minimum Spanning Trees,” Department of Computer Science, University of Texas at Dallas, Texas, March 2003.

CONFERENCE PRESENTATIONS

  • "Co-evolutionary analysis of domains in interacting proteins reveals insights into domain-domain interactions mediating protein-protein interactions," 9th Annual Computational Genomics Conference, October 2006.
  • "Predicting Protein-Protein Interaction by Searching Evolutionary Tree Automorphism Space," 13th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB), June 2005.
  • “A 5/4-Approximation Algorithm for Minimum 2-Edge-Connectivity,” 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003.
  • “Leave No Stone Unturned: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees,” DIMACS Workshop on Geometric Optimization, May 2003.
  • “Survivable Network Design: The Capacitated Minimum Spanning Network Problem,” 7th INFORMS Telecommunications Conference, 2004.
  • “Multi-Homing Protection in WDM Mesh Networks,” 7th INFORMS Telecommunications Conference, 2004.
  • "Revisiting Esau-Williams’ Algorithm: On the Design of Local Access Networks,” 7th INFORMS Telecommunications Conference, 2004.
  • “Threshold-Based Differentiated Intermediate-Node Initiated (TDINI) Signaling for Optical Burst-Switched Networks,” 7th INFORMS Telecommunications Conference, 2004.
  • “A Note on Altinkemer-Gavish's Algorithm for the Design of Tree Networks,” 7th INFORMS Telecommunications Conference, 2004.
  • “Design of Local Access Networks,” 15th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), November 2003.

GRANTS / AWARDS

  • National Institutes of Health Post-doctoral Fellowship, 2004 – 2005.
  • Texas Public Educational Grant, 2001-2004.
  • University of Texas at Dallas Engineering and Computer Science Special Fellowship, 2002.
  • University of Texas at Dallas Doctoral Scholarship, 2001-2004.
  • IBM Student Travel Award to attend Symposium on Discrete Algorithms (SODA), 2003.
  • DIMACS Travel Grant to attend Workshop on Geometric Optimization, 2003.
  • Nominated for the Best Paper Award, PDCS 2004.

PROFESSIONAL ACTIVITIES

Member

  • ISCB
  • ACM
  • IEEE

Reviewer

  • Journals: Bioinformatics, Pattern Recognition Letters, IEEE/ACM Transactions on Computational Biology and Bioinformatics, IEEE Transactions on NanoBioscience, Networks, Discrete and Computational Geometry, Journal of Graph Algorithms and Applications.
  • Conferences: PSB 2006, IWBRA 2006, APPROX 2006, INFOCOM 2004, ICC 2004, Globecom 2003, FSTTCS 2003

Session Chair

  • 7th INFORMS Telecommunications Conference, 2004.
  • 3rd IEEE International Conference on Networking, 2004.
  • 15th IASTED International Conference on Parallel and Distributed Computing and Systems, 2003.
© Raja Jothi. All Rights Reserved