Search Results for "algorithm"
Sort By:
36 projects for "algorithm" with 2 filters applied:
-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
BD-Func
Bidirectional Functional Enrichment of Gene Expression Data
BD-Func is an algorithm to predict activation or inhibition of pathways based upon gene expression patterns. If you use BD-Func, please cite: Warden C, Kanaya N, Chen S, and Yuan Y-C. (2013) BD-Func: A Streamlined Algorithm for Predicting Activation and Inhibition of Pathways. peerJ, 1:e159 -
2
ModST
A tool to search post-translational modifications in a blind mode
ModST (pronounced as modest) is a tool to search post-translational modifications (PTMs) in mass spectrometry data in an unrestrictive manner. It can search for hundreds of modification without any user provided information for variable modifications. Due to data level parallelization implemented through perl it is fast, portable and easy to use to identify and analyse PTMs in MS/MS data. -
3
COHCAP
City of Hope CpG Island Analysis Pipeline
COHCAP (City of Hope CpG Island Analysis Pipeline, pronounced "co-cap") is an algorithm to analyze single-nucleotide resolution methylation data (Illumina 450k methylation array, targeted BS-Seq, etc.). Please note: 1) The SourceForge version of COHCAP is no longer being updated. Please see the GitHub version: https://github.com/cwarden45/COHCAP This was the source repository for the Bioconductor version, with some changes after the decision to only provide the code through GitHub. 2) In addition to the original NAR paper, please see the following links: Benchmarks: http://www.nature.com/protocolexchange/protocols/2965#/introduction Protocol Exchange Files: http://sourceforge.net/projects/cohcap/files/Protocol_Exchange_Example.zip 3) Custom Annotation Files (including EPIC Array): https://sourceforge.net/projects/cohcap/files/additional_Bioconductor_annotations.zip/download -
4
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. ...
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
JSiteDescriptor
Binding site descriptor generation for SVM based classification.
A set of java programs that extract coordinate and chemical information from PDB files. The binding site regions are extracted using grid based scheme. For binding site, spatio-chemical descriptor is generated based on PocketMatch algorithm of Dr. Kalidas (author of this project too). -
6
faif
C++ header only library with AI and bioinformatics algorithms
C++ header only library, small and fast; Naive Bayesian Classifier, Decision Tree Classifier (ID3), DNA/RNA nucleotide second structure predictor, timeseries management, timeseries prediction, generic Evolutionary Algorithm, generic Hill Climbing algorithm and others. -
7
ExSTraCS
Extended Supervised Tracking and Classifying System
This advanced machine learning algorithm is a Michigan-style learning classifier system (LCS) developed to specialize in classification, prediction, data mining, and knowledge discovery tasks. Michigan-style LCS algorithms constitute a unique class of algorithms that distribute learned patterns over a collaborative population of of individually interpretable IF:THEN rules, allowing them to flexibly and effectively describe complex and diverse problem spaces. -
8
GeneticAlgorithms
Framework for using the Genetic Algorithms optimization heuristic.
GeneticAlgorithms is a simple and lightweight framework to implement an optimization heuristic following the Genetic Algorithms model. A genetic algorithm mimics the natural processes of evolution, selection and "survival of the fittest". This framework is intuitive and good integrated with Java 1.5 SDK and later. -
9
fitGCP
Fitting genome coverage distributions with mixture models
...Besides commonly used distributions, fitGCP uses distributions tailored to account for common artifacts. The mixture models are iteratively fitted based on the Expectation-Maximization algorithm. Please find the accompanying paper here: http://dx.doi.org/10.1093/bioinformatics/btt147 -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
RaTrav
mean first passage times and node occupancies calculations
...Bates, 'RaTrav: a tool for calculating mean first-passage times on biochemical networks', BMC Syst. Biol. 7, 130 (2013). M. Torchala, P. Chelminiak and P. A. Bates, 'Mean first-passage time calculations: comparison of the deterministic Hill's algorithm with Monte Carlo simulations', Eur. Phys. J. B 85, 116 (2012). -
11
GenNon-h
Simulating non-homogeneous multiple sequence alignments
...GenNon-H is the first package designed to generate multiple sequence alignments under the discrete-time Markov processes on phylogenetic trees, which samples directly from the transition matrices. Based on the input model and a phylogenetic tree in the Newick format (with branch lengths measured as the expected number of substitutions per site), the algorithm produces DNA alignments of desired length. GenNon-H is a collaborative project described at http://genome.crg.es/cgi-bin/phylo_mod_sel/AlgGenNonH.pl. -
12
NeedlemanWunsch
Fast global sequence alignment for the masses!
MOVED TO GITHUB: https://github.com/noporpoise/seq-align Global optimal sequence alignment using the Needleman-Wunsch algorithm. Aligns DNA, RNA, protein sequence and more! See our sister project local alignment using Smith-Waterman: http://sourceforge.net/projects/smithwaterman/ -
13
Darwin 2: Java Framework for Evolutionary Computation (genetic algorithm, GA). A true framework with out-of-the-box functionality and extensibility of all classes. Interface-based pattern with dependency-injection to configure components.
-
14
EToS (Efficient Technology of Spike sorting; Extracellular recording To Spike trains) is an open-source system for spike sorting. EToS contains the programs of spike detection, feature extraction and clustering.
-
15
Software for making Clusters of Orthologous Groups (featuring the new EdgeSearch algorithm). Latest ref: Kristensen DM, Kannan L, Coleman MK, Wolf YI, Sorokin A, Koonin EV, Mushegian A. Bioinformatics 2010.
-
16
SmithWaterman
Fast local sequence alignment for the masses!
MOVED TO GITHUB: https://github.com/noporpoise/seq-align An implementation of the Smith-Waterman local sequence alignment algorithm. See our sister project global alignment using Needleman-Wunsch: http://sourceforge.net/projects/needlemanwunsch/ -
17
We here present a novel computer algorithm, called AutoClickChem, capable of performing many click-chemistry reactions in silico. In silico modeling of click-chemistry products may prove useful in rational drug design and drug optimization.
-
18
This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
-
19
CNV Workshop is a web-enabled platform for analyzing genome variation such as copy number variation (CNV). Learn about CNV Workshop in our associated BMC Bioinformatics manuscript: http://www.biomedcentral.com/1471-2105/11/74
-
20
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
-
21
CheMecher is a fully-featured chemical simulator that supports an arbitrary number of reaction steps and chemical species. Uses the Runge-Kutta algorithm for numeric solutions.
-
22
Multi-functional batch sequence aligner incorporating Needleman-Wunsch, Smith-Waterman and Oommen-Kashyap algorithms along with compound alignment of secondary sequences.
-
23
D-finder is a bioinformatic search algorithm for the identification of D-sites in JNK interacting proteins. The algorithm is a combination of pattern matching and a hidden markov model (HMM) based on a training set of known JNK D-sites.
-
24
An efficient implementation of the Smith-Waterman algorithm that takes advantage of SIMD instruction sets in modern CPUs. The Smith-Waterman algorithm is used for sequence alignment in bioinformatics.
-
25
