In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...
There has been considerable recent interest in the use of haplotype structure to aid in the design and analysis of case-control association studies searching for genetic predictors...
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this c...