Velvet consists of two main parts - Velveth and Velvetg
This is a KBase wrapper for Velvet.
Velvet is a classic de-bruijn graph based assembler. Velvet works by efficiently manipulating de Bruijn graphs through simplification and compression. It eliminates errors and resolves repeats by first using an error correction algorithm that merges sequences together. Repeats are then removed from the sequence via the repeat solver that separates paths which share local overlaps. Velvet is fast and robust, although it is no longer in active development.
NOTE that Velvet is not deterministic See https://www.biostars.org/p/86907/ and https://www.researchgate.net/post/Does_velvet_generate_different_assemblies_from_the_same_input_data_and_same_velvet_parameters
Known limitations: Velvet assembly quality is known to be sensitive to the hash length.
- Zerbino DR, Birney E. Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 2008; doi:10.1101/gr.074492.107 , https://genome.cshlp.org/content/early/2008/04/07/gr.074492.107
Module Commit: 00afa308d7b0f1b87b53446b9b3a96dfddaca7ac