Breaking the complexity of cancer using computational transcriptomic network biology

DOI10.1002/WICS.70020MaRDI QIDQ6910438zbMATH OpenFDO

Authors Heewon Park, Satoru Miyano

Publication date 29 October 2025

Published in Wiley Interdisciplinary Reviews. WIREs Computational Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/WICS.70020

zbMATH Keywords

cancer systems biologycomputational network biologygene networkstatistical strategies

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites work

• A practical guide to splines
• Brownian distance covariance
• Elements of Information Theory
• Finding optimal Bayesian network given a super-structure
• Flexible smoothing with B-splines and penalties. With comments and a rejoinder by the authors
• scientific article; zbMATH DE number 3738710 (Why is no real title available?)
• scientific article; zbMATH DE number 1222293 (Why is no real title available?)
• scientific article; zbMATH DE number 3444596 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Measuring and testing dependence by correlation of distances
• Practical smoothing. The joys of P-splines
• Regularization and Variable Selection Via the Elastic Net
• Smoothing methods in statistics

This page was built for publication: Breaking the complexity of cancer using computational transcriptomic network biology

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