Dr. Gabriela Hristescu
Spring ’13: Data Structures & Algorithms
Office Hours: Wednesday 9:50-10:50am and 3-5pm Or by appointment: Please feel free to set up an appointment with me to meet at a time more convenient for you if you can't make it to my office hours!
Office: Education Hall 1049
Courses taught since Fall '00:
Computer Science & Programming
Introduction to Object-Oriented Programming
Data Structures & Algorithms
Data Structures for Engineers
Database Systems: Theory and Programming
Advanced Database Systems
Parallel and Distributed Computing
Springer Book Series: Advances in Experimental Medicine and Biology
Book Title: Software Tools and Algorithms for Biological Systems
Chapter 7: Microarray database mining and cell differentiation defects in schizophrenia. pp 696:67-74, 2011.Authors: Radu A, Hristescu G, Katsel P, Haroutunian V, Davis KL.
The Human Genome Contains Numerous Clusters of Adjacent Co-regulated Genes. International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS ’04), pp 300-306, 2004.
Computational Model and Simulation of Cellular Protein Import through Nuclear Pores. International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS ’02), pp 551-556, 2002.
Structure-Based Feature Extraction from Protein Databases. International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS ’01), pp 126-131, 2001.
Cofe: A Scalable Method for Feature Extraction from Complex Objects. Proc. 2nd International Conference on Data Warehousing and Knowledge Discovery (DaWaK ’00), pp 358-371, 2000.
Embedding of Proteins. DIMACS
Technical Report TR-99-50,
DNA Strand Separation Prediction: A Parallel Implementation. Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA ’97), pp 610-619, 1997.
Triangulation of a Set of Points for Coarse Grained Multicomputers. Technical Report, TR-439-93,
Phone: (856) 256-4000 ext 3893
Fax: (856) 256-4741