A novel graph-based algorithm to infer recurrent copy number variations in cancer

1Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Many cancers have been linked to copy number variations (CNVs) in the genomic DNA. Although there are existing methods to analyze CNVs from individual samples,cancer-causing genes are more frequently discovered in regions where CNVs are common among tumor samples,also known as recurrent CNVs. Integrating multiple samples and locating recurrent CNV regions remain a challenge,both computationally and conceptually. We propose a new graph-based algorithm for identifying recurrent CNVs using the maximal clique detection technique. The algorithm has an optimal solution,which means all maximal cliques can be identified,and guarantees that the identified CNV regions are the most frequent and that the minimal regions have been delineated among tumor samples. The algorithm has successfully been applied to analyze a large cohort of breast cancer samples and identified some breast cancer-associated genes and pathways.

Cite

CITATION STYLE

APA

Chi, C., Ajwad, R., Kuang, Q., & Hu, P. (2016). A novel graph-based algorithm to infer recurrent copy number variations in cancer. Cancer Informatics, 15, 43–50. https://doi.org/10.4137/CIN.S39368

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free