Dipanka Tanu Sarmah
AboutProjectsPublicationsBlogContact
CV
Back to blog
2026-01-19

Navigating Spreading-out Graphs: Efficient Search in Biological Networks

A deep dive into the NSG paper, exploring how l2 norm proximity graphs and out-degree reduction enable fast complex detection and drug-response mapping in LINCS L1000.

Open in new tabDownload PDF← Back to all posts

If the PDF does not render in your browser, use "Open in new tab" above.

Continue reading

More posts you might find interesting

2026-01-05

Scale-Free Networks in Biology: Power, Pitfalls, and the Seduction of Universality

A critical essay on scale-free networks in biology, examining why the concept became dominant, where it provides insight, and where it can mislead biological interpretation.

Read post
2026-01-19

The Geometry of Interaction: Proximity Graphs in Modern Network Biology

An expert-level exploration of how k-NN, RNG, and NSG frameworks transform topological 'hairballs' into precise geometric manifolds for drug discovery and spatial transcriptomics.

Read post
2025-03-01

The Illusion in the Lab Coat: How Computational Biology Can Deceive Itself

A critical essay on self-deception, statistical illusion, and methodological fragility in computational biology.

Read post
📚

Explore more posts

Browse the complete collection of notes and essays on computational biology

View all posts

© 2026 Dipanka Tanu Sarmah

•Built with Next.js & Tailwind
Visitors: …