This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
archive:review_articles [2010/04/12 22:42] cbrumbau Formatted according to RefNotes plugin |
archive:review_articles [2010/04/16 00:43] learithe |
||
---|---|---|---|
Line 3: | Line 3: | ||
===== Assembler review articles ====== | ===== Assembler review articles ====== | ||
- | ** Assembly algorithms for next-generation sequencing data **[(cite:assem_alg>Jason R. Miller, Sergey Koren, Granger Sutton. Assembly algorithms for next-generation sequencing data. //Genomics//, In Press, Corrected Proof, Available online 6 March 2010. ISSN 0888-7543. doi:[[http://dx.doi.org/10.1016/j.ygeno.2010.03.001|10.1016/j.ygeno.2010.03.001]].)] | + | * ** Assembly algorithms for next-generation sequencing data **[(cite:assem_alg>Jason R. Miller, Sergey Koren, Granger Sutton. Assembly algorithms for next-generation sequencing data. //Genomics//, In Press, Corrected Proof, Available online 6 March 2010. ISSN 0888-7543. doi:[[http://dx.doi.org/10.1016/j.ygeno.2010.03.001|10.1016/j.ygeno.2010.03.001]].)] \\ Covers these assemblers: SSAKE, SHARCGS, VCAKE, Newbler, Celera, Euler, Velvet, ABySS, AllPaths, and SOAPdenovo. \\ Compares de Bruijn graph to overlap/layout/consensus. |
+ | |||
+ | |||
+ | |||
+ | ===== Technology review articles ====== | ||
+ | * ** Computational methods for discovering structural variation with next-generation sequencing. **[(cite:tech>Medvedev P, Stanciu M, Brudno M. Computational methods for discovering structural variation with next-generation sequencing. //Nat Methods//,2009 Nov 6 (11 Suppl):S13-20.http://www.nature.com/nmeth/journal/v6/n11s/abs/nmeth.1374.html)] \\ A good 2009 review article **on the state of paired-end sequencing**. Includes some discussion of the difference between mate-pair and paired-end reads, the many types of of contig linkages they can produce, as well as discussion about data prossessing and available tools. | ||
- | Covers these assemblers: SSAKE, SHARCGS, VCAKE, Newbler, Celera, Euler, Velvet, ABySS, AllPaths, and SOAPdenovo. | ||
- | Compares de Bruijn graph to overlap/layout/consensus. | ||
===== References ===== | ===== References ===== | ||
<refnotes>notes-separator: none</refnotes> | <refnotes>notes-separator: none</refnotes> | ||
~~REFNOTES cite~~ | ~~REFNOTES cite~~ |