Source: quicktree Standards-Version: 4.7.4 Maintainer: Debian Med Packaging Team Uploaders: Steffen Moeller , Section: science Build-Depends: debhelper-compat (= 14), d-shlibs, help2man, Vcs-Browser: https://salsa.debian.org/med-team/quicktree Vcs-Git: https://salsa.debian.org/med-team/quicktree.git Homepage: https://github.com/khowe/quicktree/ Package: quicktree Architecture: any Depends: ${misc:Depends}, ${shlibs:Depends}, Suggests: hmmer|hmmer2, Description: Neighbor-Joining algorithm for phylogenies QuickTree is an efficient implementation of the Neighbor-Joining algorithm (PMID: 3447015), capable of reconstructing phylogenies from huge alignments in time less than the age of the universe. . QuickTree accepts both distance matrix and multiple-sequence-aligment inputs. The former should be in PHYLIP format. The latter should be in Stockholm format, which is the native alignment format for the Pfam database. Alignments in various formats can be converted to Stockholm format with the sreformat program, which is part of the HMMer package (hmmer.org). . The tress are written to stdout, in the Newick/New-Hampshire format use by PHYLIP and many other programs Package: libquicktree2 Architecture: any Multi-Arch: same Section: libs Depends: ${misc:Depends}, ${shlibs:Depends}, Description: Neighbor-Joining algorithm for phylogenies (shared library) QuickTree is an efficient implementation of the Neighbor-Joining algorithm (PMID: 3447015), capable of reconstructing phylogenies from huge alignments in time less than the age of the universe. . This package contains the shared library libquicktree.so.2. Package: libquicktree-dev Architecture: any Multi-Arch: same Section: libdevel Depends: libquicktree2 (= ${binary:Version}), ${misc:Depends}, Description: Neighbor-Joining algorithm for phylogenies (development) QuickTree is an efficient implementation of the Neighbor-Joining algorithm (PMID: 3447015), capable of reconstructing phylogenies from huge alignments in time less than the age of the universe. . QuickTree accepts both distance matrix and multiple-sequence-aligment inputs. The former should be in PHYLIP format. The latter should be in Stockholm format, which is the native alignment format for the Pfam database. Alignments in various formats can be converted to Stockholm format with the sreformat program, which is part of the HMMer package (hmmer.org). . The tress are written to stdout, in the Newick/New-Hampshire format use by PHYLIP and many other programs . This package contains the header files and the static library from quicktree that are used by other packages, as well as the libquicktree.so linker symlink.