Sumaiya Nazeen

Bangladesh | Fulbright S&T awardee 2012 | Massachusetts Institute of Technology | Computer Science

Sunplus

Sumaiya Nazeen is pursuing her doctoral studies in the Department of Electrical Engineering and Computer Science at Massachusetts Institute of Technology. Her 2012 International Fulbright Science & Technology Award supports research in Computational Biology and Bioinformatics. Her re- search focuses on the development of computational methods for the interpretation of genetic foundation of complex human diseases. Computational integration of large-scale functional and comparative genomics datasets, can provide insight into the disease-associated sequence variants and their likely molecular roles. Sumaiya’s research aims at designing better tools for furthering such insight.

A native of Bangladesh, Sumaiya pursued her Bachelor’s degree from the Department of Computer Science and Engineering (CSE) at Bangladesh University of Engineering and Technology (BUET) and was awarded the Chancellor’s Gold Medal on graduation. Her undergraduate research was focused on Stringology and she co-authored several journal and conference papers on String Inference problem. Later, her research interest shifted towards exploring the applicability of various computational techniques in Biology. Prior to receiving the 2012 International Fulbright Science & Technology Award, she served as a Lecturer in the Department of CSE, BUET, and taught a number of theory and sessional courses. She has a keen interest in music, and enjoys traveling and reading.

 

Education

PhD (current, Computer Science) Massachusetts Institute of Technology, Cambridge, MA
MS (2014, Computer Science) Massachusetts Institute of Technology, Cambridge, MA
BSc Engineering (2011, Computer Science and Engineering) Bangladesh University of Engineering and Technology, Bangladesh

 

Research Highlights


Inferring strings from cover arrays. Discrete Mathematics, Algorithms and Applications 5(2): 1360005 (2013)

Indeterminate string inference algorithms. Journal of Discrete Algorithms 10: 23-34 (2012)

 

Contact