Ports Search

"The SEQIO package is a set of C functions which can read and write biological sequence files formatted using various file formats and which can be used to perform database searches on biological databases." - from the README file

ProtoMol is an object-oriented, component based, framework for molecular dynamics (MD) simulations. The framework supports the CHARMM 19 and 28a2 force fields and is able to process PDB, PSF, XYZ and DCD trajectory files. It is designed for high flexibility, easy extendibility and maintenance, and high performance demands, including parallelization. The technique of multiple time-stepping is used to improve long-term efficiency. The use of fast electrostatic force evaluation algorithms like Ewald, particle Mesh Ewald (PME), and Multigrid (MG) summation further enhances performance. Longer time steps are possible using MOLLY, Langevin Molly and Hybrid Monte Carlo, Nose-Hoover, and Langevin integrators. In addition, ProtoMol has been designed to interact with VMD, a visualization engine developed by the University of Illinois that is used for displaying large biomolecular systems in three dimensions. ProtoMol is freely distributed software, and the source code is available.

This package implements the Sim4 algorithm for aligning expressed DNA with genomic sequences, described in the paper: L. Florea, G. Hartzell, Z. Zhang, G. Rubin, and W. Miller (1998) "A computer program for aligning a cDNA sequence with a genomic DNA sequence." Genome Research 8, 967-974. Port maintained by the FreeBSD bio-porters mailing list.

The BIOM file format (canonically pronounced biome) is designed to be a general-use format for representing biological sample by observation contingency tables. BIOM is a recognized standard for the Earth Microbiome Project and is a Genomics Standards Consortium supported project. The BIOM format is designed for general use in broad areas of comparative -omics. For example, in marker-gene surveys, the primary use of this format is to represent OTU tables: the observations in this case are OTUs and the matrix contains counts corresponding to the number of times each OTU is observed in each sample. With respect to metagenome data, this format would be used to represent metagenome tables: the observations in this case might correspond to SEED subsystems, and the matrix would contain counts corresponding to the number of times each subsystem is observed in each metagenome. Similarly, with respect to genome data, this format may be used to represent a set of genomes: the observations in this case again might correspond to SEED subsystems, and the counts would correspond to the number of times each subsystem is observed in each genome.

pyfasta is a python module for fast, memory-efficient, pythonic access to fasta sequence files.

Tinker is a set of small programs for doing general purpose molecular modeling calculations. Tools are included for energy minimizations, geometry calculations, simulated annealing, molecular dynamics, and molecular analysis calculations. Tools for converting coordinate sets are also provided. Tinker employs several force fields and minimization techniques. This port sets the maxatm value to 2500 atoms. This should be sufficient for most molecular systems. Should you need to work with larger systems you can set the maxatm parameter in the sizes.i file located in the tinker/source directory and recompile. Note that if it is set too large that tinker programs will abort and core dump. For more information about Tinker see:

TREE-PUZZLE is a computer program to reconstruct phylogenetic trees from molecular sequence data by maximum likelihood. It implements a fast tree search algorithm, quartet puzzling, that allows analysis of large data sets and automatically assigns estimations of support to each internal branch. TREE-PUZZLE also computes pairwise maximum likelihood distances as well as branch lengths for user specified trees. Branch lengths can be calculated under the clock-assumption. In addition, TREE-PUZZLE offers a novel method, likelihood mapping, to investigate the support of a hypothesized internal branch without computing an overall tree and to visualize the phylogenetic content of a sequence alignment. TREE-PUZZLE also conducts a number of statistical tests on the data set (chi-square test for homogeneity of base composition, likelihood ratio clock test, Kishino-Hasegawa test). The models of substitution provided by TREE-PUZZLE are TN, HKY, F84, SH for nucleotides, Dayhoff, JTT, mtREV24, VT, WAG, BLOSUM 62 for amino acids, and F81 for two-state data. Rate heterogeneity is modeled by a discrete Gamma distribution and by allowing invariable sites. The corresponding parameters can be inferred from the data set.

Velvet is a de novo genomic assembler specially designed for short read sequencing technologies, such as Solexa or 454, developed by Daniel Zerbino and Ewan Birney at the European Bioinformatics Institute (EMBL-EBI). Citation: Velvet: algorithms for de novo short read assembly using de Bruijn graphs. D.R. Zerbino and E. Birney. Genome Research 18: 821-829 (2008)

python-nexus is a generic nexus (phylogenetics) file format(.nex, .trees) reader for python.

Recombine fits a model which has a single population of constant size with a single recombination rate across all sites. It can accomodate either plain DNA or RNA data or SNP (single nucleotide polymorphism) data. Recombine forms part of the Lamarc (Likelihood Analysis with Metropolis Algorithm using Random Coalescence) suite. See: http://evolution.genetics.washington.edu/lamarc.html