1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
Source: sga
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Uploaders: Michael R. Crusoe <michael.crusoe@gmail.com>,
Andreas Tille <tille@debian.org>
Section: science
Priority: optional
Build-Depends: debhelper (>= 11~),
libsparsehash-dev,
zlib1g-dev | libz-dev,
libbamtools-dev,
gawk,
help2man,
# Run-Time Depends
# (to prevent building on architectures where it won't be installable)
samtools,
python,
python-ruffus,
python-pysam
Standards-Version: 4.2.1
Vcs-Browser: https://salsa.debian.org/med-team/sga
Vcs-Git: https://salsa.debian.org/med-team/sga.git
Homepage: https://github.com/jts/sga
Package: sga
Architecture: any
Depends: ${shlibs:Depends},
${misc:Depends},
samtools,
python,
python-ruffus,
python-pysam
Recommends: abyss (>= 2.0.2-1)
Description: de novo genome assembler that uses string graphs
The major goal of SGA is to be very memory efficient, which is achieved by
using a compressed representation of DNA sequence reads.
.
SGA is a de novo assembler for DNA sequence reads. It is based on Gene Myers'
string graph formulation of assembly and uses the FM-index/Burrows-Wheeler
transform to efficiently find overlaps between sequence reads.
|
