Short read de novo assembler using de Bruijn graphs, as published in: D.R. Zerbino and E. Birney. 2008. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Research, 18: 821-829
We are pleased to inform you that we released a new version of MetaVelvet (1.2.01).
Major changes include:
enable to use paired-end information in a graph decomposition step.
three options are newly added in order to specify how to use paired-end connections for graph decomposition: -valid_connections, -noise_connections, and -use_connections.
for details, please see "Advanced topic 3: how to use paired-end information for graph decompositoin" in our web site http://metavelvet.dna.bio.keio.ac.jp/.
I removed previous contrib/MetaVelvet-1.1.01 directory and newly created contrib/MetaVelvet-1.2.01 directory.
No code is changed for other directories.
We are very happy if you kindly merge our changes.
Very sincerely yours,
Dear Dr. Zerbino,
We are pleased to inform you that we released a new version of MetaVelvet (1.2.01). Major changes include:
I removed previous contrib/MetaVelvet-1.1.01 directory and newly created contrib/MetaVelvet-1.2.01 directory. No code is changed for other directories.
We are very happy if you kindly merge our changes. Very sincerely yours,
Tsuyoshi