On the sample complexity of cancer pathways identification

DOI10.1007/978-3-319-16706-0_33MaRDI QIDQ2814593zbMATH OpenOpenAlexFDO

Authors Fabio Vandin, Benjamin J. Raphael, Eli Upfal

Publication date 22 June 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://europepmc.org/articles/pmc4700400

zbMATH Keywords

genomic datasetsprobably approximately correct learningsequencing studies

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• A novel and efficient algorithm for de novo discovery of mutated driver pathways in cancer
• Differentially Mutated Subnetworks Discovery
• Discovering Combinations of Genomic Aberrations Associated With Cancer
• Identification of supervised and sparse functional genomic pathways
• Probabilistic methods in cancer biology

Cited in

(5)

• Identification of supervised and sparse functional genomic pathways
• Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer
• A new technique for generating pathogenic barcodes in breast cancer susceptibility analysis
• Learning Oncogenic Pathways from Binary Genomic Instability Data
• Algebraic and topological indices of molecular pathway networks in human cancers

This page was built for publication: On the sample complexity of cancer pathways identification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814593)