2016
DOI: 10.1007/978-3-319-43681-4_11
|View full text |Cite
|
Sign up to set email alerts
|

Copy-Number Evolution Problems: Complexity and Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
37
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 22 publications
(37 citation statements)
references
References 14 publications
0
37
0
Order By: Relevance
“…However, we suspect the problem to NP-hard, as the related unmixed version, the CNT problem, is NPhard [7]. Moreover, other similar deconvolution problems under a tree constraint are NP-hard as well [6,8].…”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…However, we suspect the problem to NP-hard, as the related unmixed version, the CNT problem, is NPhard [7]. Moreover, other similar deconvolution problems under a tree constraint are NP-hard as well [6,8].…”
Section: Methodsmentioning
confidence: 99%
“…Following the model in [7,25,27], we represent a chromosome as a sequence of m segments. A copy-number profile, or profile for short, specifies the number of copies of each segment in a clone.…”
Section: Copy-number Tree Mixture Deconvolution Problemmentioning
confidence: 99%
See 3 more Smart Citations