The inference of cancer evolutionary histories is a key step for the understanding and treatment of the disease; thus, many tools had been developed in the last decade to address this important problem. However, methods for inferring tumor phylogenies need to strike a balance between keeping reasonable running times and employing sophisticated evolution models. Binary characters, such as single-nucleotide variants and known mutations, which is our focus, is an example of a simple model that is able to capture most relevant cases—but not copy number variants. On binary characters, most methods are designed for simpler models where mutations can only be accumulated under the infinite sites assumption; however, those models tend to be too simplistic for real case scenarios. While the most explored direction in the context of binary characters is to allow mutation losses, in this paper, we introduce an even more general model, where each mutation can be acquired and lost more than once. We describe this model, provide a simulated annealing approach exploiting this novel evolutionary framework, and show its accuracy on different sets of experimental evaluations when compared to less general models, and demonstrate potential application to real data.
Ciccolella, S., Patterson, M., Hajirasouliha, I., Della Vedova, G. (2025). Cancer progression inference using a finite-state model to allow recurrences and losses of mutations. NEURAL COMPUTING & APPLICATIONS, 37(26), 21545-21562 [10.1007/s00521-025-11474-1].
Cancer progression inference using a finite-state model to allow recurrences and losses of mutations
Ciccolella S.
;Della Vedova G.
2025
Abstract
The inference of cancer evolutionary histories is a key step for the understanding and treatment of the disease; thus, many tools had been developed in the last decade to address this important problem. However, methods for inferring tumor phylogenies need to strike a balance between keeping reasonable running times and employing sophisticated evolution models. Binary characters, such as single-nucleotide variants and known mutations, which is our focus, is an example of a simple model that is able to capture most relevant cases—but not copy number variants. On binary characters, most methods are designed for simpler models where mutations can only be accumulated under the infinite sites assumption; however, those models tend to be too simplistic for real case scenarios. While the most explored direction in the context of binary characters is to allow mutation losses, in this paper, we introduce an even more general model, where each mutation can be acquired and lost more than once. We describe this model, provide a simulated annealing approach exploiting this novel evolutionary framework, and show its accuracy on different sets of experimental evaluations when compared to less general models, and demonstrate potential application to real data.| File | Dimensione | Formato | |
|---|---|---|---|
|
Ciccolella et al-2025-Neural Computing and Applications-VoR.pdf
accesso aperto
Descrizione: s This article is licensed under a Creative Commons Attribution 4.0 International License
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Creative Commons
Dimensione
7.56 MB
Formato
Adobe PDF
|
7.56 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


