Search arXivSearch

arXiv · 2305.19423

A Comparison of Mutation and Amplification-Driven Resistance Mechanisms and Their Impacts on Tumor Recurrence

Abstract

Tumor recurrence, driven by the evolution of drug resistance is a major barrier to therapeutic success in cancer. Resistance is often caused by genetic alterations such as point mutation, which refers to the modification of a single genomic base pair, or gene amplification, which refers to the duplication of a region of DNA that contains a gene. Here we investigate the dependence of tumor recurrence dynamics on these mechanisms of resistance, using stochastic multi-type branching process models. We derive tumor extinction probabilities and deterministic estimates for the tumor recurrence time, defined as the time when an initially drug sensitive tumor surpasses its original size after developing resistance. For models of amplification-driven and mutation-driven resistance, we prove law of large numbers results regarding the convergence of the stochastic recurrence times to their mean. Additionally, we prove sufficient and necessary conditions for a tumor to escape extinction under the gene amplification model, discuss behavior under biologically relevant parameters, and compare the recurrence time and tumor composition in the mutation and amplification models both analytically and using simulations. In comparing these mechanisms, we find that the ratio between recurrence times driven by amplification vs. mutation depends linearly on the number of amplification events required to acquire the same degree of resistance as a mutation event, and we find that the relative frequency of amplification and mutation events plays a key role in determining the mechanism under which recurrence is more rapid. In the amplification-driven resistance model, we also observe that increasing drug concentration leads to a stronger initial reduction in tumor burden, but that the eventual recurrent tumor population is less heterogeneous, more aggressive, and harbors higher levels of drug-resistance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aaron Li, Danika Kibby, Jasmine Foo. 2023-08-21. A Comparison of Mutation and Amplification-Driven Resistance Mechanisms and Their Impacts on Tumor Recurrence. https://arxiv.org/abs/2305.19423

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE