Difference between revisions of "Velvet"
(Created page with "This is Daniel Zerbino and Ewan Birney's de-novo genome assembler and is one of the most widely used. It consists of two stages, a hashing stage invoked by the velveth progra...") |
|||
| Line 1: | Line 1: | ||
This is Daniel Zerbino and Ewan Birney's de-novo genome assembler and is one of the most widely used. | This is Daniel Zerbino and Ewan Birney's de-novo genome assembler and is one of the most widely used. | ||
| − | It consists of two stages, a hashing stage invoked by the velveth program, and then the actual genome assembly stage | + | It consists of two stages, a hashing stage invoked by the '''velveth''' program, and then the actual genome assembly stage |
| − | which is invoked by the velvetg program. | + | which is invoked by the '''velvetg''' program. |
| − | As with many other genome assemblers, the program splits short reads into shorter sequences of | + | As with many other genome assemblers, the program splits short reads into even shorter sequences of length k, called kmers and |
arranges these in de Bruijn graphs from which the genome is then assembled. | arranges these in de Bruijn graphs from which the genome is then assembled. | ||
Revision as of 17:28, 6 April 2016
This is Daniel Zerbino and Ewan Birney's de-novo genome assembler and is one of the most widely used.
It consists of two stages, a hashing stage invoked by the velveth program, and then the actual genome assembly stage which is invoked by the velvetg program.
As with many other genome assemblers, the program splits short reads into even shorter sequences of length k, called kmers and arranges these in de Bruijn graphs from which the genome is then assembled.
