{"id":6055,"date":"2012-02-22T11:09:06","date_gmt":"2012-02-22T09:09:06","guid":{"rendered":"http:\/\/www.ehu.es\/sgi\/?p=6055"},"modified":"2013-11-12T11:15:49","modified_gmt":"2013-11-12T09:15:49","slug":"velvet-2","status":"publish","type":"post","link":"https:\/\/www.ehu.eus\/sgi\/software-de-calculo\/velvet-2","title":{"rendered":"Velvet"},"content":{"rendered":"<h2>Informaci\u00f3n general<\/h2>\n<p>Versi\u00f3n 1.2.03. Velvet is a set of algorithms manipulating de Bruijn  graphs for genomic and de novo transcriptomic Sequence assembly. It was  designed for short read sequencing technologies, such as Solexa or 454  Sequencing and was developed by Daniel Zerbino and Ewan Birney at the <a title=\"EBI\" href=\"http:\/\/www.ebi.ac.uk\/\" target=\"_blank\">European Bioinformatics Institute<\/a>.  The tool takes in short read sequences, removes errors then produces  high quality unique contigs. It then uses paired-end read and long read  information, when available, to retrieve the repeated areas between  contigs.<\/p>\n<p>Leer tambi\u00e9n sobre [intlink id=\u00bb6111&#8243; type=\u00bbpost\u00bb]ABySS[\/intlink] y el <a title=\"abyss vs velvet\" href=\"http:\/\/www.ehu.es\/ehusfera\/hpc\/2012\/06\/20\/benchmarking-genetic-assemblers-abyss-vs-velvet\/\" target=\"_blank\">art\u00edculo que hemos publicado<\/a> comparando ambos.<\/p>\n<h2>C\u00f3mo usar<\/h2>\n<p>Para ejecutar <code>velveth<\/code> o <code>velvetg<\/code> en el sistema de colas Torque a\u00f1adir en los scripts:<\/p>\n<pre>\/software\/bin\/velvet\/velveth [opciones de velvet]<\/pre>\n<pre>\/software\/bin\/velvet\/velvetg [opciones de velvet]<\/pre>\n<h2>Rendimiento<\/h2>\n<p>Velvet ha sido compilado con soporte paralelo a trav\u00e9s de OpenMP. Hemos medido el rendimiento y los resultados est\u00e1n disponibles en la memoria\u00a0<a title=\"velvet performance\" href=\"http:\/\/www.ehu.es\/sgi\/ARCHIVOS\/velvet_performance.pdf\" target=\"_blank\"><em>Velvet performance in the machines of the Computing Service of the UPV\/EHU<\/em><\/a>.  Velvet usa una enorme cantidad de memoria RAM para grandes c\u00e1lculos y tambi\u00e9n la hemos medido. Hemos obtenido unas simples f\u00f3rmulas para predecir el uso de memoria RAM en funci\u00f3n de los ficheros de entrada de modo que el investigador pueda planificar su investigaci\u00f3n.<\/p>\n<p>Leer tambi\u00e9n sobre [intlink id=\u00bb6111&#8243; type=\u00bbpost\u00bb]ABySS[\/intlink] y el <a title=\"abyss vs velvet\" href=\"http:\/\/www.ehu.es\/ehusfera\/hpc\/2012\/06\/20\/benchmarking-genetic-assemblers-abyss-vs-velvet\/\" target=\"_blank\">art\u00edculo que hemos publicado<\/a> comparando ambos.<\/p>\n<h2>M\u00e1s informaci\u00f3n<\/h2>\n<p><a title=\"velvet web page\" href=\"http:\/\/www.ebi.ac.uk\/~zerbino\/velvet\/\" target=\"_parent\">P\u00e1gina web de Velvet<\/a>.<br \/>\nMemoria sobre el rendimiento <a title=\"velvet performance\" href=\"http:\/\/www.ehu.es\/sgi\/ARCHIVOS\/velvet_performance.pdf\" target=\"_blank\">Velvet performance in the machines of the Computing Service of the UPV\/EHU<\/a>.<br \/>\nEntrada en el <a title=\"velvet performance\" href=\"http:\/\/www.ehu.es\/ehusfera\/hpc\" target=\"_blank\">blog hpc<\/a>: <a title=\"velvet performance\" href=\"http:\/\/www.ehu.es\/ehusfera\/hpc\/2012\/06\/20\/benchmarking-genetic-assemblers-abyss-vs-velvet\/\" target=\"_blank\">Velvet performance in the machines of the Computing Service of the UPV\/EHU<\/a>.<\/p>\n<div id=\"_mcePaste\" class=\"mcePaste\" style=\"position: absolute; left: -10000px; top: 12px; width: 1px; height: 1px; overflow: hidden;\">, post in the <a title=\"hpc blog\" href=\"http:\/\/www.ehu.es\/ehusfera\/hpc\" target=\"_blank\">hpc blog<\/a><\/div>\n","protected":false},"excerpt":{"rendered":"<p>Informaci\u00f3n general Versi\u00f3n 1.2.03. Velvet is a set of algorithms manipulating de Bruijn graphs for genomic and de novo transcriptomic Sequence assembly. It was designed for short read sequencing technologies, such as Solexa or 454 Sequencing and was developed by Daniel Zerbino and Ewan Birney at the European Bioinformatics Institute. The tool takes in short &hellip; <a href=\"https:\/\/www.ehu.eus\/sgi\/software-de-calculo\/velvet-2\" class=\"more-link\">Seguir leyendo <span class=\"screen-reader-text\">Velvet<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_links_to":"","_links_to_target":""},"categories":[176,3],"tags":[],"_links":{"self":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts\/6055"}],"collection":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/comments?post=6055"}],"version-history":[{"count":9,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts\/6055\/revisions"}],"predecessor-version":[{"id":7093,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts\/6055\/revisions\/7093"}],"wp:attachment":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/media?parent=6055"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/categories?post=6055"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/tags?post=6055"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}