Search arXivSearch

arXiv · 1304.5848

The time-evolution of DCIS size distributions with applications to breast cancer growth and progression

Abstract

Ductal carcinoma {\em in situ} (DCIS) lesions are non-invasive tumours of the breast which are thought to precede most invasive breast cancers (IBC). As individual DCIS lesions are initiated, grow and invade (i.e. become IBC) the size distribution of the DCIS lesions present in a given human population will evolve. We derive a differential equation governing this evolution and show, for given assumptions about growth and invasion, that there is a unique distribution which does not vary with time. Further, we show that any initial distribution converges to this stationary distribution exponentially quickly. It is therefore reasonable to assume that the stationary distribution is equal to the true DCIS size distribution, at least for human populations which are relatively stable with respect to the determinants of breast cancer. Based on this assumption and the size data of 110 DCIS lesions detected in a mammographic screening program between 1993 and 2000, we produce maximum likelihood estimates for certain growth and invasion parameters. Assuming that DCIS size is proportional to a positive power $p$ of the time since tumour initiation we estimate $p$ to be 0.50 with a 95% confidence interval of $(0.35, 0.71)$. Therefore we estimate that DCIS lesions follow a square-root growth law and hence that they grow rapidly when small and relatively slowly when large. Our approach and results should be useful for other mathematical studies of cancer, especially those investigating biological mechanisms of invasion.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James G. Dowty, Graham B. Byrnes, Dorota M. Gertig. 2013-06-25. The time-evolution of DCIS size distributions with applications to breast cancer growth and progression. https://doi.org/10.1093/imammb%2Fdqt014

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