\input zb-basic
\input zb-ioport
\iteman{io-port 06105736}
\itemau{Sambo, Francesco; Di Camillo, Barbara}
\itemti{Minimizing time when applying bootstrap to contingency tables analysis of genome-wide data.}
\itemso{Hamadi, Youssef (ed.) et al., Learning and intelligent optimization. 6th international conference, LION 6, Paris, France, January 16--20, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34412-1/pbk). Lecture Notes in Computer Science 7219, 175-189 (2012).}
\itemab
Summary: Bootstrap resampling is starting to be frequently applied to contingency tables analysis of Genome-Wide SNP data, to cope with the bias in genetic effect estimates, the large number of false positive associations and the instability of the lists of SNPs associated with a disease. The bootstrap procedure, however, increases the computational complexity by a factor $B$, where $B$ is the number of bootstrap samples. In this paper, we study the problem of minimizing time when applying bootstrap to contingency tables analysis and propose two levels of optimization of the procedure. The first level of optimization is based on an alternative representation of bootstrap replicates, bootstrap histograms, which is exploited to avoid unnecessary computations for repeated subjects in each bootstrap replicate. The second level of optimization is based on an ad-hoc data structure, the bootstrap tree, exploited for reusing computations on sets of subjects which are in common across more than one bootstrap replicate. The problem of finding the best bootstrap tree given a set of bootstrap replicates is tackled with best improvement local search. Different constructive procedures and local search operators are proposed to solve it. The two proposed levels of optimization are tested on a real Genome-Wide SNP dataset and both are proven to significantly decrease computation time.
\itemrv{~}
\itemcc{}
\itemut{Bootstrap; Contingency tables analysis; Genome-Wide SNP Data; Local Search}
\itemli{doi:10.1007/978-3-642-34413-8\_13}
\end