SLIQ: Simple linear inequalities for efficient contig scaffolding

Journal of Computational Biology

Volumn 19, Issue 10, 2012, Pages 1162-1175

  Roy, Rajat S ^a   Chen, Kevin C ^b   Sengupta, Anirvan M ^b   Schliep, Alexander ^a  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

algorithms; biochemical networks; combinatorics; computational molecular biology; evolution; gene expressions; gene networks; genetic variation; graph theory; graphs and networks; next generation sequencing

Indexed keywords

ALGORITHM; ARTICLE; CONTIG MAPPING; DNA SEQUENCE; HUMAN; HUMAN GENOME; METHODOLOGY;

ALGORITHMS; CONTIG MAPPING; GENOME, HUMAN; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 84867500400     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2011.0263     Document Type: Article

References (19)

1. Batzoglou, S., Jaffe, D.B., Stanley, K., et al. 2002. Arachne: a whole-genome shotgun assembler. Genome Res 12, 177-189.
2. Boetzer, M., Henkel, C.V., Jansen, H.J., et al. 2011. Scaffolding pre-assembled contigs using SSPACE. Bioinformatics 27, 578-579.
3. Butler, J., MacCallum, I., Kleber, M., et al. 2008. Allpaths: de novo assembly of whole-genome shotgun microreads. Genome Res. 18, 810-820.
4. Chapman, J.A., Ho, I., Sunkara, S., et al. 2011. Meraculous: de novo genome assembly with short paired-end reads. PLoS One 6, e23501.
5. Dayarian, A., Michael, T.P., and Sengupta, A.M. 2010. Sopra: Scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics 11, 345.
6. Farrer, R.A., Kemen, E., Jones, J.D.G., et al. 2009. De novo assembly of the pseudomonas syringae pv. syringae b728a genome using Illumina/Solexa short sequence reads. FEMS Microbiol Lett. 291, 103-111.
7. Gao, S., Nagarajan, N., and kin Sung, W. 2011. Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. LNBI. 6577, 437-451.
8. Garey, Michael, R, and Johnson, D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
9. Gnerre, S., Maccallum, I., Przybylski, D., et al. 2011. High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proc Natl Acad Sci U S A. 108, 1513-1518.
10. Haubold, B., and Wiehe, T. 2006. How repetitive are genomes? BMC Bioinformatics. 7, 541.
11. Hopcroft, J., and Tarjan, R. 1973. Efficient algorithms for graph manipulation. Communications of the ACM. 16, 372-378.
12. Huson, D.H., Reinert, K., and Myers, E. 2002. The greedy path-merging algorithm for contig scaffolding. Journal of the ACM. 49, 603-615.
13. Johnson, D.B. 1975. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing. 4, 77-84.
14. Koren, S., Treangen, T.J., and Pop, M. 2011. Bambus 2: scaffolding metagenomes. Bioinformatics. 27, 2964-2971.
15. Langmead, B., Trapnell, C., Pop, M., et al. 2009. Ultrafast and memory-efficient alignment of short dna sequences to the human genome. Genome Biol. 10, R25.
16. Li, R., Zhu, H., Ruan, J., et al. 2010. De novo assembly of human genomes with massively parallel short read sequencing. Genome Res. 20, 265-272.
17. Pop, M., Kosack, D.S., and Salzberg, S.L. 2004. Hierarchical scaffolding with Bambus. Genome Res. 14, 149-159.
18. Salmela, L., Mkinen, V., Vlimki, N., et al. 2011. Fast scaffolding with small independent mixed integer programs. Bioinformatics 27, 3259-3265
19. Zerbino, D.R., and Birney, E. 2008. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18, 821-829.