Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Velvet assembler

String Algorithm

Velvet is an algorithm package designed for de novo genome assembly and the alignment of short sequencing reads, developed by Daniel Zerbino and Ewan Birney and first released in 2008. It works by building and manipulating de Bruijn graphs from the short reads, then removing errors and simplifying regions of repeated sequence within those graphs to reconstruct a genome's sequence without relying on a pre-existing reference genome. Velvet is written in C for Unix-like operating systems, distributed under the GPL license, and its assembly methods have also been incorporated into commercial bioinformatics packages such as Sequencher, Geneious, MacVector and BioNumerics, reflecting its influence on subsequent de novo assembly tools.

Connections

In Field

Bioinformatics, Fields
Source Velvet (software) (Wikipedia)
Sources
Velvet (software) (Wikipedia)
  • Lead section
    Velvet is an algorithm package that has been designed to deal with de novo genome assembly and short read sequencing alignments.
  • In Field: Bioinformatics, Lead sentence
    Velvet is an algorithm package that has been designed to deal with de novo genome assembly and short read sequencing alignments.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.