07/12/2017 @ 10:00-10:45
Tutorial by David Tse
How to solve NP-hard assembly problems in linear time 
1. Bresler, G., Bresler, M.A. and Tse, D., 2013. Optimal assembly for high throughput shotgun sequencing. BMC bioinformatics, 14(5), p.S18.
2. Shomorony, I., Kim, S.H., Courtade, T.A. and David, N.C., 2016. Information-optimal genome assembly via sparse read-overlap graphs. Bioinformatics, 32(17), pp.i494-i502.
3. Kamath, G.M., Shomorony, I., Xia, F., Courtade, T. and David, N.T., 2017. Hinge: Long-read assembly achieves optimal repeat resolution. Genome Research, pp.gr-216465.
4. Kannan, S., Hui, J., Mazooji, K., Pachter, L. and Tse, D., 2016. Shannon: An Information-Optimal de Novo RNA-Seq Assembler. bioRxiv, p.039230.
David Tse | How to solve NP-hard assembly problems in linear time | CGSI 2017