MAGE: an efficient algorithm for identifying Maximal Age-indexed GEne sets
Related Experiment Video
Updated: Nov 3, 2026

High-Throughput Behavioral Aging and Lifespan Assays Using the Lifespan Machine
Published on: January 26, 2024
Murat Çalış1, Volkan Altuntas2, Omer Kahveci3
1Electronics Technology Programme, Electronics and Automation Department, Technical Sciences Vocational School, Bursa Uludağ University, Görükle Campus, Görükle Mahallesi, Üniversite 1. Cadde, No. 711G, Nilüfer, Bursa 16059, Türkiye.
Abstract:
Aging alters transcriptional regulation in a tissue- and time-specific manner, reshaping gene regulatory networks and shifting regulatory influence dynamics. Traditional in silico influence maximization methods often rely on static gene expression snapshots and fail to capture gene-to-gene influence variations over time. To address this, we introduce the Age Index, a network-based metric that quantifies time-varying gene influence. We define the Maximal and Minimal Age Index Problems (MAP$^{+}$ and MAP$^{-}$) as the tasks of identifying gene sets with the highest and lowest Age Index, and prove these problems are NP-hard. To solve them, we develop MAGE (Maximal Age-Index Algorithm), a stochastic method that iteratively constructs gene sets by prioritizing genes likely to optimize the Age Index. MAGE identifies statistically significant gene sets at the genome scale, with strong literature support, highlighting its potential to uncover age-sensitive regulatory mechanisms.
