Corpus ID: 211082909

# Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms

@article{Lafond2020GenomicPI,
title={Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms},
author={Manuel Lafond and Binhai Zhu and Peng Zou},
journal={ArXiv},
year={2020},
volume={abs/2002.04778}
}
• Published in ArXiv 2020
• Computer Science, Mathematics
• Recently, due to the genomic sequence analysis in several types of cancer, the genomic data based on {\em copy number profiles} ({\em CNP} for short) are getting more and more popular. A CNP is a vector where each component is a non-negative integer representing the number of copies of a specific gene or segment of interest. In this paper, we present two streams of results. The first is the negative results on two open problems regarding the computational complexity of the Minimum Copy Number… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

## On the Minimum Copy Number Generation Problem in Cancer Genomics

• Computer Science
• BCB '18
• 2018

## A Linear-Time Algorithm for the Copy Number Transformation Problem

• Computer Science, Medicine
• J. Comput. Biol.
• 2017

## Intra-tumour heterogeneity: a looking glass for cancer?

• Medicine, Biology
• Nature Reviews Cancer
• 2012

## Scaffold Filling under the Breakpoint and Related Distances

• Computer Science, Medicine
• IEEE/ACM Transactions on Computational Biology and Bioinformatics
• 2012

## Evolution of platinum resistance in high-grade serous ovarian cancer.

• Medicine
• The Lancet. Oncology
• 2011