Integrating evidence from protein domains to identify cancer driver mutations

Cancer can develop through the accumulation of somatic mutations that drive uncontrolled cell proliferation. A central objective in cancer research is to identify mutations that provide a selective growth advantage to tumor cells, so-called driver mutations. Many computational methods infer driver missense mutations in proteins by assessing their recurrence. However, such an approach suffers from the limited capacity to detect those driver mutations that occur infrequently across tumor samples. One strategy to overcome this limitation is to aggregate mutations from proteins sharing the same protein domain. Here we constructed a benchmark of cancer driver and passenger mutations, based on the known experimental and clinical studies, and systematically evaluated the applicability of methods that aggregate mutations across different mutation types and protein domains. We found that accounting for evidence mutations from different types of amino acid substitutions occurring in the same protein position enhances the classification performance. Furthermore, accounting for evidence mutations from paralogous proteins in the domain family increased the precision but compromised the overall classification accuracy. In addition, the performance of domain-based approaches was shown to crucially depend on the similarity between the target and evidence proteins.

Authors

Institutions

Publication Details

Journal
Protein Science
Published
2026-01-20
DOI
https://doi.org/10.1002/pro.70422
Primary Topic
Bioinformatics and Genomic Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Integrating evidence from protein domains to identify cancer driver mutations

Yiru Sheng, Igor B. Rogozin, Anna R. Panchenko, Daria Ostroverkhova
Protein Science
Bioinformatics and Genomic Networks
article

Integrating evidence from protein domains to identify cancer driver mutations

Yiru Sheng, Igor B. Rogozin, Anna R. Panchenko, Daria Ostroverkhova
article en

Abstract

Cancer can develop through the accumulation of somatic mutations that drive uncontrolled cell proliferation. A central objective in cancer research is to identify mutations that provide a selective growth advantage to tumor cells, so-called driver mutations. Many computational methods infer driver missense mutations in proteins by assessing their recurrence. However, such an approach suffers from the limited capacity to detect those driver mutations that occur infrequently across tumor samples. One strategy to overcome this limitation is to aggregate mutations from proteins sharing the same protein domain. Here we constructed a benchmark of cancer driver and passenger mutations, based on the known experimental and clinical studies, and systematically evaluated the applicability of methods that aggregate mutations across different mutation types and protein domains. We found that accounting for evidence mutations from different types of amino acid substitutions occurring in the same protein position enhances the classification performance. Furthermore, accounting for evidence mutations from paralogous proteins in the domain family increased the precision but compromised the overall classification accuracy. In addition, the performance of domain-based approaches was shown to crucially depend on the similarity between the target and evidence proteins.

Protein ScienceVol. 35(2)
Ontario Institute for Cancer Research (CA), University of Ostrava (CZ), Queen's University (CA)
Openalex Percentile: Top 84%
Bioinformatics and Genomic Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.