Fast mutual exclusivity algorithm nominates potential synthetic lethal gene pairs through brute force matrix product...

Area of Science:

• Genomics
• Cancer Biology
• Bioinformatics

Background:

• Mutual exclusivity analysis of genomic aberrations is crucial for discovering synthetic lethal relationships and identifying cancer vulnerabilities.
• Comprehensive genome-wide analyses of large patient cohorts and multiple aberration classes are computationally challenging with existing methods.

Purpose of the Study:

• To develop a computationally efficient algorithm, Fast Mutual Exclusivity (FaME), for genome-wide mutual exclusivity testing.
• To enable rapid identification of potential synthetic lethal interactions and cancer cell vulnerabilities.

Main Methods:

• Developed FaME, an algorithm utilizing matrix multiplication and a logarithm-based Fisher's exact test for fast computation.
• Applied FaME to allele-specific whole exome sequencing data from 27 The Cancer Genome Atlas (TCGA) cohorts.
• Integrated loss of function screens and patient transcriptomic data for case study analysis.

Main Results:

• FaME significantly accelerates the computation of genome-wide mutual exclusivity tests, analyzing millions of combinations in minutes.
• Detected mutual exclusivity between point mutations and identified allele-specific copy number alterations across cytobands.
• Successfully applied to a case study involving tumor suppressor and druggable gene loss.

Conclusions:

• FaME provides a computationally feasible approach for large-scale mutual exclusivity analysis in cancer genomics.
• The algorithm facilitates the discovery of novel synthetic lethal interactions and potential therapeutic targets.
• FaME and its outputs are publicly available to advance cancer research.