| 1 | # -*- coding: utf-8; mode: tcl; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- vim:fenc=utf-8:ft=tcl:et:sw=4:ts=4:sts=4 |
|---|
| 2 | # $Id$ |
|---|
| 3 | |
|---|
| 4 | PortSystem 1.0 |
|---|
| 5 | |
|---|
| 6 | name velvet |
|---|
| 7 | version 1.2.08 |
|---|
| 8 | categories science |
|---|
| 9 | platforms darwin |
|---|
| 10 | license GPL-3 |
|---|
| 11 | |
|---|
| 12 | homepage http://www.ebi.ac.uk/~zerbino/velvet |
|---|
| 13 | description Velvet is a set of algorithms manipulating de Bruijn graphs for genomic and de novo transcriptomic Sequence assembly. |
|---|
| 14 | long_description Velvet is a set of algorithms manipulating de Bruijn graphs \ |
|---|
| 15 | for genomic and de novo transcriptomic Sequence assembly. It was designed \ |
|---|
| 16 | for short read sequencing technologies, such as Solexa or 454 Sequencing \ |
|---|
| 17 | and was developed by Daniel Zerbino and Ewan Birney at the European \ |
|---|
| 18 | Bioinformatics Institute. The tool takes in short read sequences, removes \ |
|---|
| 19 | errors then produces high quality unique contigs. It then uses paired-end \ |
|---|
| 20 | read and long read information, when available, to retrieve the repeated \ |
|---|
| 21 | areas between contigs. It has also been implemented inside of commercial \ |
|---|
| 22 | packages, such as the Geneious Server. |
|---|
| 23 | maintainers node99.org:sean openmaintainer |
|---|
| 24 | |
|---|
| 25 | master_sites http://www.ebi.ac.uk/~zerbino/velvet |
|---|
| 26 | distfiles ${name}_${version}.tgz |
|---|
| 27 | checksums rmd160 03fe8348293d039dc4f93f691f3456fc2e2bacd5 \ |
|---|
| 28 | sha256 1caf3fff54f264641a6bdd2ebd2e418f275703ed46debaf12b582c64daca3a57 |
|---|
| 29 | worksrcdir velvet |
|---|
| 30 | use_configure no |
|---|
| 31 | build.target velvetg velveth |
|---|
| 32 | |
|---|
| 33 | destroot { |
|---|
| 34 | xinstall -m 755 ${worksrcpath}/velvetg ${destroot}${prefix}/bin |
|---|
| 35 | xinstall -m 755 ${worksrcpath}/velveth ${destroot}${prefix}/bin |
|---|
| 36 | } |
|---|
