This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
lecture_notes:04-05-2010 [2010/04/07 18:22] galt |
lecture_notes:04-05-2010 [2010/04/07 18:57] galt |
||
---|---|---|---|
Line 31: | Line 31: | ||
+ | Assembly Review Articles: | ||
+ | * [[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6WG1-4YJ6GD8-1&_user=10&_coverDate=03%2F06%2F2010&_rdoc=1&_fmt=high&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1282691739&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=32c08d11cc10fd1eefca0f8a8def738b|Assembly algorithms for next-generation sequencing data]] | ||
- | [[Review Article | http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6WG1-4YJ6GD8-1&_user=10&_coverDate=03%2F06%2F2010&_rdoc=1&_fmt=high&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1282691739&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=32c08d11cc10fd1eefca0f8a8def738b]] | + | Jason R. Miller, Sergey Koren and Granger Suttona |
+ | |||
+ | Covers these assemblers: SSAKE, SHARCGS, VCAKE, Newbler, Celera Assembler, Euler, Velvet, ABySS, AllPaths, and SOAPdenovo. | ||
+ | |||
+ | Compares de Bruijn graph to overlap/layout/consensus. | ||
+ | |||
+ | 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: 10.1016/j.ygeno.2010.03.001. | ||
+ | (http://www.sciencedirect.com/science/article/B6WG1-4YJ6GD8-1/2/ae6c957910e4ea658cdebff4a0ce9793) | ||
+ | Keywords: Genome assembly algorithms; Next-generation sequencing | ||
- | Assembly algorithms for next-generation sequencing data | ||
- | Jason R. Miller, Sergey Korena and Granger Suttona | ||
- | |||
- | SSAKE, SHARCGS, VCAKE, Newbler, Celera Assembler, Euler, Velvet, ABySS, | ||
- | AllPaths, and SOAPdenovo. | ||
- | |||
- | More generally, it compares the two standard methods known as the de | ||
- | Bruijn graph approach and | ||
- | the overlap/layout/consensus approach to assembly. | ||
=====Assembly Overview===== | =====Assembly Overview===== |