File: control

package info (click to toggle)
examl 3.0.22-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 3,120 kB
  • sloc: ansic: 27,325; makefile: 73; sh: 48
file content (39 lines) | stat: -rw-r--r-- 1,677 bytes parent folder | download
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: examl
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Uploaders: Andreas Tille <tille@debian.org>
Section: science
Priority: optional
Build-Depends: debhelper-compat (= 12),
               libopenmpi-dev,
               libsimde-dev
Standards-Version: 4.5.0
Vcs-Browser: https://salsa.debian.org/med-team/examl
Vcs-Git: https://salsa.debian.org/med-team/examl.git
Homepage: https://github.com/stamatak/ExaML
Rules-Requires-Root: no

Package: examl
Architecture: any
Built-Using: ${simde:Built-Using}
Depends: ${shlibs:Depends},
         ${misc:Depends},
         openmpi-bin
Description: Exascale Maximum Likelihood (ExaML) code for phylogenetic inference
 Exascale Maximum Likelihood (ExaML) is a code for phylogenetic inference
 using MPI. This code implements the popular RAxML search algorithm for
 maximum likelihood based inference of phylogenetic trees.
 .
 ExaML is a strapped-down light-weight version of RAxML for phylogenetic
 inference on huge datasets. It can only execute some very basic
 functions and is intended for computer-savvy users that can write little
 perl-scripts and have experience using queue submission scripts for
 clusters. ExaML only implements the CAT and GAMMA models of rate
 heterogeneity for binary, DNA, and protein data.
 .
 ExaML uses a radically new MPI parallelization approach that yields
 improved parallel efficiency, in particular on partitioned multi-gene or
 whole-genome datasets. It also implements a new load balancing algorithm
 that yields better parallel efficiency.
 .
 It is up to 4 times faster than its predecessor RAxML-Light and scales
 to a larger number of processors.