Mona Singh

Whitehead Institute for Biomedical Research, Massachusetts Institute of Technology

Papers

Total Citations

150

H-Index

About

Mona Singh is a leading figure in theoretical computer science and computational biology, best known for her pioneering work in algorithmic graph exploration and protein interaction networks. Her foundational research on piecemeal graph exploration—where a mobile robot must systematically learn an unknown environment while periodically returning to its start—established key principles for autonomous navigation and search. Her 1999 paper on this topic has garnered over 113 citations, reflecting its lasting influence on robotics and distributed computing. Singh’s contributions extend deeply into bioinformatics, where she has developed innovative algorithms for analyzing protein complexes and functional modules within large-scale interaction networks. Her work bridges rigorous theoretical foundations with practical biological discovery, enabling researchers to predict protein functions and uncover disease mechanisms. Recognized for her interdisciplinary impact, Singh’s research continues to shape how we model complex systems—from robotic pathfinding to cellular organization—making her a vital figure for students exploring the intersection of algorithms, computation, and life sciences.