| 1 |
Source: bio-rainbow |
| 2 |
Maintainer: Debian Med Packaging Team <[email protected]> |
| 3 |
Uploaders: Olivier Sallou <[email protected]>, |
| 4 |
Pranav Ballaney <[email protected]> |
| 5 |
Section: science |
| 6 |
Priority: optional |
| 7 |
Build-Depends: debhelper-compat (= 13), |
| 8 |
help2man |
| 9 |
Standards-Version: 4.5.0 |
| 10 |
Vcs-Browser: https://salsa.debian.org/med-team/bio-rainbow |
| 11 |
Vcs-Git: https://salsa.debian.org/med-team/bio-rainbow.git |
| 12 |
Homepage: http://sourceforge.net/projects/bio-rainbow/ |
| 13 |
Rules-Requires-Root: no |
| 14 |
|
| 15 |
Package: bio-rainbow |
| 16 |
Architecture: any |
| 17 |
Depends: ${shlibs:Depends}, |
| 18 |
${misc:Depends}, |
| 19 |
${perl:Depends} |
| 20 |
Description: clustering and assembling short reads for bioinformatics |
| 21 |
Efficient tool for clustering and assembling short reads, |
| 22 |
especially for RAD. |
| 23 |
. |
| 24 |
Rainbow is developed to provide an ultra-fast and memory-efficient |
| 25 |
solution to clustering and assembling short reads produced by RAD-seq. |
| 26 |
First, Rainbow clusters reads using a spaced seed method. Then, Rainbow |
| 27 |
implements a heterozygote calling like strategy to divide potential |
| 28 |
groups into haplotypes in a top-down manner. long a guided tree, it |
| 29 |
iteratively merges sibling leaves in a bottom-up manner if they are |
| 30 |
similar enough. Here, the similarity is defined by comparing the 2nd |
| 31 |
reads of a RAD segment. This approach tries to collapse heterozygote |
| 32 |
while discriminate repetitive sequences. At last, Rainbow uses a greedy |
| 33 |
algorithm to locally assemble merged reads into contigs. Rainbow not |
| 34 |
only outputs the optimal but also suboptimal assembly results. Based on |
| 35 |
simulation and a real guppy RAD-seq data, it is shown that Rainbow is |
| 36 |
more competent than the other tools in dealing with RAD-seq data. |