Debian Codegraph @

debian/control

raw
1 Source: iva
2 Standards-Version: 4.7.4
3 Maintainer: Debian Med Packaging Team <[email protected]>
4 Uploaders:
5 Andreas Tille <[email protected]>,
6 Jorge Soares <[email protected]>,
7 Sascha Steinbiss <[email protected]>,
8 Section: science
9 Build-Depends:
10 debhelper-compat (= 14),
11 dh-sequence-python3,
12 libssl-dev,
13 bioperl,
14 fastaq,
15 kmc,
16 help2man,
17 mummer,
18 python3,
19 python3-setuptools,
20 python3-packaging,
21 python3-numpy,
22 python3-networkx,
23 python3-pysam,
24 python3-pytest,
25 samtools,
26 smalt,
27 default-jdk-headless,
28 Vcs-Browser: https://salsa.debian.org/med-team/iva
29 Vcs-Git: https://salsa.debian.org/med-team/iva.git
30 Homepage: https://github.com/sanger-pathogens/iva
31
32 Package: iva
33 Architecture: any
34 Depends:
35 ${misc:Depends},
36 ${python3:Depends},
37 ${perl:Depends},
38 fastaq,
39 kmc,
40 mummer,
41 smalt,
42 samtools,
43 python3-numpy,
44 python3-networkx,
45 python3-pysam,
46 default-jre-headless,
47 Recommends:
48 r-base-core,
49 bioperl,
50 trimmomatic,
51 Suggests: iva-examples
52 Description: iterative virus sequence assembler
53 IVA is a de novo assembler designed to assemble
54 virus genomes that have no repeat sequences,
55 using Illumina read pairs sequenced from mixed
56 populations at extremely high depth.
57 .
58 IVA's main algorithm works by iteratively extending
59 contigs using aligned read pairs. Its input can be
60 just read pairs, or additionally you can provide an
61 existing set of contigs to be extended. Alternatively,
62 it can take reads together with a reference sequence.
63
64 Package: iva-examples
65 Architecture: all
66 Depends:
67 ${misc:Depends},
68 Suggests:
69 iva
70 Breaks: iva (<< 1.0.11+ds-7~)
71 Replaces: iva (<< 1.0.11+ds-7~)
72 Multi-Arch: foreign
73 Description: iterative virus sequence assembler - test data
74 IVA is a de novo assembler designed to assemble
75 virus genomes that have no repeat sequences,
76 using Illumina read pairs sequenced from mixed
77 populations at extremely high depth.
78 .
79 IVA's main algorithm works by iteratively extending
80 contigs using aligned read pairs. Its input can be
81 just read pairs, or additionally you can provide an
82 existing set of contigs to be extended. Alternatively,
83 it can take reads together with a reference sequence.
84 .
85 Just test data are provided in a separate package.