Search Results for "basic-miktex-2.9.6"

...BioEmu outputs structures in backbone frame representation. To reconstruct the side-chains, several tools are available. As an example, we interface with HPacker to conduct side-chain reconstruction and also provide basic tooling for running a short molecular dynamics (MD) equilibration.

...Xiaole Shirley Liu's lab at Dana-Farber Cancer Institute/Harvard School of Public Health, and is maintained by Wei Li lab at Children's National Medical Center. We thank the support from Claudia Adams Barr Program in Innovative Basic Cancer Research and NIH/NHGRI to develop MAGeCK.

pybrn is a Python package for the analysis of biochemical reaction networks. It provides basic model handling capabilities, import from SBML, analysis of conservation relations, steady state computation and model simulation.

...We optimized the P3BSseq parameters for both directional and non-directional libraries, and for both single-end and paired-end reads of Whole Genome and Reduced Representation BSseq. P3BSseq is a user-friendly streamlined solution for BSseq upstream analysis, requiring only basic computer and NGS knowledge.

The General Hidden Markov Model Library (GHMM) is a C library with additional Python bindings implementing a wide range of types of Hidden Markov Models and algorithms: discrete, continous emissions, basic training, HMM clustering, HMM mixtures.

math lib for .NET. n-dim arrays, complex numbers, linear algebra, FFT, sorting, cells- and logical arrays as well as 3D plotting classes help developing algorithms on every platform supporting .NET. Sources from SVN, binaries: http://ilnumerics.net

Educational Learning Classifier System (eLCS) is a set of learning classifier system (LCS) educational demos designed to introduce students or researchers to the basics of a modern Michigan-style LCS algorithm. This eLCS package includes 5 different implementations of a basic LCS algorithm, as part of a 6 stage set of demos that will be paired with the first introductory LCS textbook. Each eLCS implementations (from demo 2 up to demo 6) progressively add major components of the entire LCS algorithm in order to illustrate how work, how they are coded, and what impact they have on how an LCS algorithm runs. ...

...A student's first attempt at a phylogenetic inference program, written in the simplistic yet elegant Python. Pysimony reads a FASTA file (only ATGC accepted) specified as its only argument. Basic testing has shown that it is slow, inaccurate and most definitely inefficient. An unlikely-to-be-the-most-parsimonious tree is printed upon completion in basic Newick tree format. As all parts of the program are the original work of a beginner programmer, this may represent one of the worst approaches to solving the phylogenetic problem. ...