To refer to this page use:
|Abstract:||MOTIVATION:Copy number aberrations (CNAs), which delete or amplify large contiguous segments of the genome, are a common type of somatic mutation in cancer. Copy number profiles, representing the number of copies of each region of a genome, are readily obtained from whole-genome sequencing or microarrays. However, modeling copy number evolution is a substantial challenge, because different CNAs may overlap with one another on the genome. A recent popular model for copy number evolution is the copy number distance (CND), defined as the length of a shortest sequence of deletions and amplifications of contiguous segments that transforms one profile into the other. In the CND, all events contribute equally; however, it is well known that rates of CNAs vary by length, genomic position and type (amplification versus deletion). RESULTS:We introduce a weighted CND that allows events to have varying weights, or probabilities, based on their length, position and type. We derive an efficient algorithm to compute the weighted CND as well as the associated transformation. This algorithm is based on the observation that the constraint matrix of the underlying optimization problem is totally unimodular. We show that the weighted CND improves phylogenetic reconstruction on simulated data where CNAs occur with varying probabilities, aids in the derivation of phylogenies from ultra-low-coverage single-cell DNA sequencing data and helps estimate CNA rates in a large pan-cancer dataset. AVAILABILITY AND IMPLEMENTATION:Code is available at https://github.com/raphael-group/WCND. SUPPLEMENTARY INFORMATION:Supplementary data are available at Bioinformatics online.|
|Citation:||Zeira, Ron, Raphael, Benjamin J. (2020). Copy number evolution with weighted aberrations in cancer.. Bioinformatics (Oxford, England), 36 (Supplement_1), i344 - i352. doi:10.1093/bioinformatics/btaa470|
|Pages:||i344 - i352|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Bioinformatics (Oxford, England)|
|Version:||Final published version. This is an open access article.|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.