On the Sample Complexity of Cancer Pathways Identification

Conference paper

DOI: 10.1007/978-3-319-16706-0_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9029)
Cite this paper as:
Vandin F., Raphael B.J., Upfal E. (2015) On the Sample Complexity of Cancer Pathways Identification. In: Przytycka T. (eds) Research in Computational Molecular Biology. RECOMB 2015. Lecture Notes in Computer Science, vol 9029. Springer, Cham


In this work we propose a framework to analyze the sample complexity of problems that arise in the study of genomic datasets. Our framework is based on tools from combinatorial analysis and statistical learning theory that have been used for the analysis of machine learning and probably approximately correct (PAC) learning. We use our framework to analyze the problem of the identification of cancer pathways through mutual exclusivity analysis of mutations from large cancer sequencing studies. We analytically derive matching upper and lower bounds on the sample complexity of the problem, showing that sample sizes much larger than currently available may be required to identify all the cancer genes in a pathway. We also provide two algorithms to find a cancer pathway from a large genomic dataset. On simulated and cancer data, we show that our algorithms can be used to identify cancer pathways from large genomic datasets.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Fabio Vandin
    • 1
    • 2
    • 3
  • Benjamin J. Raphael
    • 2
    • 3
  • Eli Upfal
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdenseDenmark
  2. 2.Department of Computer ScienceBrown UniversityProvidenceUSA
  3. 3.Center for Computational Molecular BiologyBrown UniversityProvidenceUSA

Personalised recommendations