Boolean compressed sensing: LP relaxation for group testing

Author(s):  
Dmitry Malioutov ◽  
Mikhail Malyutov
2015 ◽  
Vol 61 (3) ◽  
pp. 1507-1507 ◽  
Author(s):  
George K. Atia ◽  
Venkatesh Saligrama ◽  
Cem Aksoylar

Author(s):  
Hooman Zabeti ◽  
Nick Dexter ◽  
Amir Hosein Safari ◽  
Nafiseh Sedaghat ◽  
Maxwell Libbrecht ◽  
...  

AbstractMotivationThe prediction of drug resistance and the identification of its mechanisms in bacteria such as Mycobacterium tuberculosis, the etiological agent of tuberculosis, is a challenging problem. Modern methods based on testing against a catalogue of previously identified mutations often yield poor predictive performance. On the other hand, machine learning techniques have demonstrated high predictive accuracy, but many of them lack interpretability to aid in identifying specific mutations which lead to resistance. We propose a novel technique, inspired by the group testing problem and Boolean compressed sensing, which yields highly accurate predictions and interpretable results at the same time.ResultsWe develop a modified version of the Boolean compressed sensing problem for identifying drug resistance, and implement its formulation as an integer linear program. This allows us to characterize the predictive accuracy of the technique and select an appropriate metric to optimize. A simple adaptation of the problem also allows us to quantify the sensitivity-specificity trade-off of our model under different regimes. We test the predictive accuracy of our approach on a variety of commonly used antibiotics in treating tuberculosis and find that it has accuracy comparable to that of standard machine learning models and points to several genes with previously identified association to drug resistance.Availabilityhttps://github.com/hoomanzabeti/[email protected]


2018 ◽  
Author(s):  
Xingzhao Wen ◽  
Weiqiang Xu ◽  
Xiao Sun ◽  
Jing Tu ◽  
Zuhong Lu

SUMMARYPlate-based single cell RNA-Seq (scRNA-seq) methods can detect a comprehensive profile for gene expression but suffers from high library cost of each single cell. Although cost can be reduced significantly by massively parallel scRNA-seq techniques, these approaches lose sensitivity for gene detection. Inspired by group testing and compressed sensing, here, we designed a computational framework to close the gap between sensitivity and library cost. In our framework, single cells were overlapped assigned into plenty of pools. Expression profile of each pool was then obtained by using plate-based sequence approach. The expression profile of all single cells was recovered based on the pool expression and the overlapped pooling design. The inferred expression profile showed highly consistency with the original data in both accuracy and cell types identification. A parallel computing scheme was designed to boost speed when processing the enormous single cells, and elastic net regression was combined with compressed sensing to auto-adapt for both sparsely and densely expressed genes.


2012 ◽  
Vol 58 (3) ◽  
pp. 1880-1901 ◽  
Author(s):  
George K. Atia ◽  
Venkatesh Saligrama

1971 ◽  
Author(s):  
Florence L. Denmark ◽  
Ethel Jackson Shirk ◽  
Leonard E. Bart ◽  
Bernice Baxter ◽  
Alfredo Casteneda ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document