Approximation algorithms for speeding up dynamic programming and denoising acgh data

DOI10.1145/1963190.2063517MaRDI QIDQ5406242zbMATH OpenOpenAlexFDO

Authors Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Russell Schwartz, Gary L. Miller

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1963190.2063517

zbMATH Keywords

approximation algorithmscomputational biologydenoising aCGH datadynamic programminghalfspace range queriestime series segmentation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Medical applications (general) (92C50) Genetics and epigenetics (92D10)

Recommendations

• Research in Computational Molecular Biology
• Denoising array-based comparative genomic hybridization data using wavelets
• Approximate dynamic programming using halfspace queries and multiscale Monge decomposition
• Copy-number evolution problems: complexity and algorithms
• A Segmentation/Clustering Model for the Analysis of Array CGH Data

Cited in

(1)

• Approximate dynamic programming using halfspace queries and multiscale Monge decomposition

This page was built for publication: Approximation algorithms for speeding up dynamic programming and denoising acgh data

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