Back

Predicting Gene Mutations in Colon Cancer Using Long-Term Temporal Dependency Learning on a Directed Co-Occurrence Asymmetry Graph

Sumrell, C. R.; Shishkin, A.; Moussa, M. R.

2026-01-23 bioinformatics
10.64898/2026.01.22.701121 bioRxiv
Show abstract

MotivationAccurate prediction of mutational dependencies to model tumor evolution can improve our understanding of cancer progression and is crucial for early diagnosis and interventions. This is especially true in colorectal tumorigenesis which often follows stepwise mutational progression patterns. Here, we propose a graph-based approach to infer a longest path as well as global gene mutational order based on data-driven co-occurrence conditional probabilities. we train long-term deep learning models (Long-Short-Term Memory (LSTM) recurrent neural network and dilated Convolutional Neural Network (CNN) to predict, for each path and at each pseudo-temporal step, whether the next gene in the inferred path is mutated. We use a large gene network (23,858 genes) and a large curated cohort (2,344 samples) of publicly available human colon adenocarcinoma samples for path inference and training and validation tasks. ResultsFrom the proposed directed co-occurrence asymmetry graph we inferred a longest path and global graph-derived mutational orders. Both proposed long-term models achieve high prediction accuracies and dramatically improve precision and recall in mutation prediction over previous studies results, with longest weighted path achieving best results overall. Availabilityhttps://github.com/moussa-lab/MutationPrediction

Matching journals

The top 5 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.