Abstract
Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations are copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome’s copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis. We model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile \(\mathbf {a}\) to \(\mathbf {b}\) by the minimum number of events needed to transform \(\mathbf {a}\) into \(\mathbf {b}\). Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given k profiles, the second, more general problem, seeks a phylogenetic tree, whose k leaves are labeled by the k given profiles and whose internal vertices are labeled by ancestral profiles such that the sum of edge distances is minimum. For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation. We assess the efficiency and quality of our algorithms on simulated instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chowdhury, S., et al.: Algorithms to model single gene, single chromosome, and whole genome copy number changes jointly in tumor phylogenetics. PLoS Comput. Biol. 10(7), 1–19 (2014)
Ciriello, G., et al.: Emerging landscape of oncogenic signatures across human cancers. Nat. Genet. 45, 1127–1133 (2013)
El-Kebir, M., et al.: Reconstruction of clonal trees and tumor composition from multi-sample sequencing data. Bioinformatics 31(12), i62–i70 (2015)
Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Sunderland (2004)
Fisher, R., et al.: Cancer heterogeneity: implications for targeted therapeutics. Br. J. Cancer 108(3), 479–485 (2013)
Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3, 43–49 (1982)
Jiao, W., et al.: Inferring clonal evolution of tumors from single nucleotide somatic mutations. BMC Bioinform. 15(1), 1–16 (2014)
Malikic, S., et al.: Clonality inference in multiple tumor samples using phylogeny. Bioinformatics 31(9), 1349–1356 (2015)
Nowell, P.C.: The clonal evolution of tumor cell populations. Science 194, 23–28 (1976)
Popic, V., et al.: Fast and scalable inference of multi-sample cancer lineages. Genome Biol. 16, 91 (2015)
Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci. 53, 131–147 (1981)
Schwarz, R., et al.: Phylogenetic quantification of intra-tumour heterogeneity. PLoS Comput. Biol. 10(4), 1–11 (2014)
Shamir, R., et al.: A linear-time algorithm for the copy number transformation problem. In: Grossi, R., Lewenstein, M., et al. (eds.) 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs, vol. 54, pp. 16:1–16:13. Dagstuhl, Germany (2016)
Sottoriva, A., et al.: A Big Bang model of human colorectal tumor growth. Nat. Genet. 47(3), 209–216 (2015)
Yuan, K., et al.: BitPhylogeny: a probabilistic framework for reconstructing intra-tumor phylogenies. Genome Biol. 16(1), 1–16 (2015)
Zhou, J., Lin, Y., Rajan, V., Hoskins, W., Tang, J.: Maximum parsimony analysis of gene copy number changes. In: Pop, M., Touzet, H. (eds.) WABI 2015. LNCS, vol. 9289, pp. 108–120. Springer, Heidelberg (2015)
Acknowledgments
B.J.R. is supported by a National Science Foundation CAREER Award CCF-1053753, NIH RO1HG005690 a Career Award at the Scientific Interface from the Burroughs Wellcome Fund, and an Alfred P Sloan Research Fellowship. R. Shamir is supported by the Israeli Science Foundation (grant 317/13) and the Dotan Hemato-Oncology Research Center at Tel Aviv University. R.Z. is supported by fellowships from the Edmond J. Safra Center for Bioinformatics at Tel Aviv University and from the Israeli Center of Research Excellence (I-CORE) Gene Regulation in Complex Human Disease (Center No. 41/11). M.Z. is supported by a fellowship from the I-CORE in Algorithms and the Simons Institute for the Theory of Computing in Berkeley and by the Postdoctoral Fellowship for Women of Israel’s Council for Higher Education. Part of this work was done while M.E-K., B.J.R., R. Shamir, R. Sharan and M.Z. were visiting the Simons Institute for the Theory of Computing.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
El-Kebir, M. et al. (2016). Copy-Number Evolution Problems: Complexity and Algorithms. In: Frith, M., Storm Pedersen, C. (eds) Algorithms in Bioinformatics. WABI 2016. Lecture Notes in Computer Science(), vol 9838. Springer, Cham. https://doi.org/10.1007/978-3-319-43681-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-43681-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-43680-7
Online ISBN: 978-3-319-43681-4
eBook Packages: Computer ScienceComputer Science (R0)