Copy-number evolution problems: complexity and algorithms

DOI10.1007/978-3-319-43681-4_11MaRDI QIDQ1708426zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mohammed El-Kebir, Benjamin J. Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira

Publication date 23 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43681-4_11

zbMATH Keywords

phylogenetic treesomatic mutationssegmental deletions and amplifications

Mathematics Subject Classification ID

Medical applications (general) (92C50) Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08)

Recommendations

• A linear-time algorithm for the copy number transformation problem
• Genome halving and aliquoting under the copy number distance
• Character-based phylogeny construction and its application to tumor evolution
• Reconstructing mutational history in multiply sampled tumors using perfect phylogeny mixtures
• Parsimonious Clone Tree Reconciliation in Cancer.

Cited in

(7)

• Detecting transcriptomic structural variants in heterogeneous contexts via the multiple compatible arrangements problem
• A linear-time algorithm for the copy number transformation problem
• scientific article; zbMATH DE number 7651113 (Why is no real title available?)
• Approximation algorithms for speeding up dynamic programming and denoising acgh data
• Reconstructing mutational history in multiply sampled tumors using perfect phylogeny mixtures
• Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
• Phyolin: identifying a linear perfect phylogeny in single-cell DNA sequencing data of tumors

Describes a project that uses

Uses Software

• CNT-ILP
• BitPhylogeny

This page was built for publication: Copy-number evolution problems: complexity and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708426)