Approximate Dynamic Programming for Fast Denoising of aCGH Data

[1]  J. Daudin,et al.  A Segmentation/Clustering Model for the Analysis of Array CGH Data , 2007, Biometrics.

[2]  Yi Li,et al.  Bayesian Hidden Markov Modeling of Array CGH Data , 2008, Journal of the American Statistical Association.

[3]  Douglas Grove,et al.  Denoising array-based comparative genomic hybridization data using wavelets. , 2005, Biostatistics.

[4]  Bernard Chazelle,et al.  Halfspace range search: An algorithmic application ofk-sets , 1986, Discret. Comput. Geom..

[5]  Feng Jiang,et al.  Inferring Tree Models for Oncogenesis from Comparative Genome Hybridization Data , 1999, J. Comput. Biol..

[6]  R. Tibshirani,et al.  Spatial smoothing and hot spot detection for CGH data using the fused lasso. , 2008, Biostatistics.

[7]  Lawrence L. Larmore,et al.  The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity , 2009, SODA '06.

[8]  D. Pinkel,et al.  Comparative Genomic Hybridization for Molecular Cytogenetic Analysis of Solid Tumors , 2022 .

[9]  M. Srivastava,et al.  On Tests for Detecting Change in Mean , 1975 .

[10]  J. Hartigan,et al.  A Bayesian Analysis for Change Point Problems , 1993 .

[11]  Tao Huang,et al.  Detection of DNA copy number alterations using penalized least squares regression , 2005, Bioinform..

[12]  Ash A. Alizadeh,et al.  Genome-wide analysis of DNA copy-number changes using cDNA microarrays , 1999, Nature Genetics.

[13]  S. Bull,et al.  A hierarchical clustering method for estimating copy number variation. , 2007, Biostatistics.

[14]  M. Wigler,et al.  Circular binary segmentation for the analysis of array-based DNA copy number data. , 2004, Biostatistics.

[15]  Ajay N. Jain,et al.  Hidden Markov models approach to the analysis of array CGH data , 2004 .

[16]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[17]  Jane Fridlyand,et al.  Bioinformatics Original Paper a Comparison Study: Applying Segmentation to Array Cgh Data for Downstream Analyses , 2022 .

[18]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[19]  Franck Picard,et al.  A statistical approach for array CGH data analysis , 2005, BMC Bioinformatics.

[20]  Donald E. Knuth,et al.  Optimum binary search trees , 1971, Acta Informatica.

[21]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[22]  R. Tibshirani,et al.  A method for calling gains and losses in array CGH data. , 2005, Biostatistics.

[23]  Sun-Yuan Kung,et al.  Accurate detection of aneuploidies in array CGH and gene expression microarray data , 2004, Bioinform..

[24]  Ajay N. Jain,et al.  Assembly of microarrays for genome-wide measurement of DNA copy number , 2001, Nature Genetics.

[25]  Alok Aggarwal,et al.  Solving query-retrieval problems by compacting Voronoi diagrams , 1990, STOC '90.

[26]  Feng Jiang,et al.  Distance-Based Reconstruction of Tree Models for Oncogenesis , 2000, J. Comput. Biol..

[27]  David Eppstein,et al.  Speeding up dynamic programming , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.