z-logo
open-access-imgOpen Access
A Novel Graph-based Algorithm to Infer Recurrent Copy Number Variations in Cancer
Author(s) -
Chen Chi,
Rasif Ajwad,
Qin Kuang,
Pingzhao Hu
Publication year - 2016
Publication title -
cancer informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.606
H-Index - 31
ISSN - 1176-9351
DOI - 10.4137/cin.s39368
Subject(s) - copy number variation , breast cancer , genomics , cancer , algorithm , computer science , gene , genome , biology , genetics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom