MAGE: an efficient algorithm for identifying Maximal Age-indexed GEne sets

Murat Çalış, Volkan Altuntas, Omer Kahveci, Pietro Hiram Guzzi, Pierangelo Veltri, Tamer Kahveci

Open source

DOI
10.1093/bib/bbag613
Published
2026-11
Container
Briefings in Bioinformatics
Publisher
Oxford University Press (OUP)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1093/bib/bbag613,
  title = {MAGE: an efficient algorithm for identifying Maximal Age-indexed GEne sets},
  author = {Murat Çalış and Volkan Altuntas and Omer Kahveci and Pietro Hiram Guzzi and Pierangelo Veltri and Tamer Kahveci},
  year = {2026},
  journal = {Briefings in Bioinformatics},
  doi = {10.1093/bib/bbag613},
  url = {https://doi.org/10.1093/bib/bbag613}
}

RIS

TY  - JOUR
TI  - MAGE: an efficient algorithm for identifying Maximal Age-indexed GEne sets
AU  - Murat Çalış
AU  - Volkan Altuntas
AU  - Omer Kahveci
AU  - Pietro Hiram Guzzi
AU  - Pierangelo Veltri
AU  - Tamer Kahveci
PY  - 2026
JO  - Briefings in Bioinformatics
DO  - 10.1093/bib/bbag613
UR  - https://doi.org/10.1093/bib/bbag613
ER  - 

APA

Çalış, M., Altuntas, V., Kahveci, O., Guzzi, P. H., Veltri, P., & Kahveci, T. (2026). MAGE: an efficient algorithm for identifying Maximal Age-indexed GEne sets. Briefings in Bioinformatics. https://doi.org/10.1093/bib/bbag613

Source records