Estimating the number of block boundaries from diagonal blockwise matrices without penalization

From MaRDI portal
(Redirected from Publication:5738841)



Abstract: In computational biology, numerous recent studies have been dedicated to the analysis of the chromatin structure within the cell by two-dimensional segmentation methods. Motivated by this application, we consider the problem of retrieving the diagonal blocks in a matrix of observations. The theoretical properties of the least-squares estimators of both the boundaries and the number of blocks proposed by L'evy-Leduc et al. [2014] are investigated. More precisely, the contribution of the paper is to establish the consistency of these estimators. A surprising consequence of our results is that, contrary to the onedimensional case, a penalty is not needed for retrieving the true number of diagonal blocks. Finally, the results are illustrated on synthetic data.












This page was built for publication: Estimating the number of block boundaries from diagonal blockwise matrices without penalization

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