File: control

package info (click to toggle)
jmodeltest 2.1.10+dfsg-7
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 6,880 kB
  • sloc: java: 16,115; xml: 61; sh: 54; makefile: 10
file content (40 lines) | stat: -rw-r--r-- 1,739 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
40
Source: jmodeltest
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 (>= 11~),
               javahelper,
               default-jdk,
               ant,
               alter-sequence-alignment,
               libfreemarker-java,
               libjcommon-java,
               libjfreechart-java,
               libmpj-java,
               libpal-java,
               prottest,
               texlive-latex-base,
               texlive-fonts-recommended,
               texlive-latex-recommended
Standards-Version: 4.2.1
Vcs-Browser: https://salsa.debian.org/med-team/jmodeltest
Vcs-Git: https://salsa.debian.org/med-team/jmodeltest.git
Homepage: https://github.com//ddarriba/jmodeltest2

Package: jmodeltest
Architecture: all
Depends: ${misc:Depends},
         ${java:Depends}
Description: HPC selection of models of nucleotide substitution
 jModelTest is a tool to carry out statistical selection of best-fit
 models of nucleotide substitution. It implements five different model
 selection strategies: hierarchical and dynamical likelihood ratio tests
 (hLRT and dLRT), Akaike and Bayesian information criteria (AIC and BIC),
 and a decision theory method (DT). It also provides estimates of model
 selection uncertainty, parameter importances and model-averaged
 parameter estimates, including model-averaged tree topologies.
 jModelTest 2 includes High Performance Computing (HPC) capabilities and
 additional features like new strategies for tree optimization, model-
 averaged phylogenetic trees (both topology and branch length), heuristic
 filtering and automatic logging of user activity.