Search Results for "algorithm" - Page 3
Sort By:
Showing 123 open source projects for "algorithm"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
1
RSSA
Rejection-based stochastic simulation algorithm (RSSA)
Rejection-based stochastic simulation algorithm (RSSA) is an efficient exact algorithm for doing stochastic simulation of biochemical reaction systems. RSSA improves over state of the art of stochastic simulations by avoiding and collapsing as much the number of propensity updates. -
2
EducationalLCS
eLCS - Educational Learning Classifier System
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. ... -
3
MolSig
The Stereo Signature Molecular Descriptor
An algorithm to compute molecular graph descriptors considering the stereochemistry of the molecular structure, based on our previously introduced signature molecular descriptor. The algorithm can generate two types of descriptors, one which is compliant with the Cahn-Ingold-Prelog priority rules, and a faster one based on our previous definition of a directed acyclic graph that isaugmented to a chiral molecular graph. -
4
FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences.
-
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.
-
5
This space is not maintained anymore. If you want to get the latest updates on fpocket refer to https://github.com/Discngine/fpocket. Fpocket is a very fast open source protein pocket detection algorithm based on Voronoi tessellation. The platform is suited for the scientific community willing to develop new scoring functions and extract pocket descriptors on a large scale level.
-
6
cmotif
A method for mining conditional phosphorylation motifs
...Although several algorithms have been proposed to uncover phosphorylation motifs, the problem of efficiently discovering a set of significant motifs with sufficiently high coverage and non-redundancy still remains unsolved. In this paper, we propose an algorithm called C-Motif for a non-redundant identification of significant phosphorylation motifs. In tests with real data including both non-kinase-specific and kinase-specific phosphorylation data, the C-Motif algorithm successfully reports a relatively complete set of of conditional phosphorylation motifs efficiently. -
7
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). -
8
mrCaNaVaR is a more user friendly and faster re-implementation of our previously published algorithm together with the mrFAST/mrsFAST/drFAST read mapping programs to discover large segmental duplications and deletions and predicts absolute copy numbers.
-
9
Fylogenetica
Constructing level-1-networks consistent with a set of quartets
This project is an implementation of an algorithm by J. Keijsper and R. Pendavingh. The goal of the algorithm is to construct a phylogenetic level-1-network that is consistent with a given set of quartets. -
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.
-
10
hrefinder
Detection of homologous recombination events from SNP data
...Based on SNP alleles calls and locations, it breaks the genomes into locally colinear blocks, and looks for cases where SNPs do not agree with the vertical pattern of inheritance in a phylogeny. It applies a dynamic programming algorithm to model whether changes within a block are likely a result of mutations, sequencing errors, or HRE. We use information from the nearby SNPs, so that if 1-2 alleles in a series of SNPs differs from the ancestral allele, it may be better explained as a mutation or sequencing error. But if a series of SNP alleles differ from the ancestral pattern, then it may be more likely that an HRE has occurred, particularly if the allele pattern matches that from another part of the tree better than that of the ancestral node. -
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
DeNovoCheck
DeNovoCheck: Inheritance analysis for NGS trio data
DeNovoCheck is intended to be used for inheritance analysis in NGS tio data. For rare dominant Mendelian diseases, patient-parent trios are often used to reduce the number of candidate variants. The algorithm bases the inheritance prediction on the data available in the parental BAM files and allows for a fast and reliable selection of potential de novo variants. -
13
segment
Solve the Viterbi algorithm in a data stream
It is often necessary to assign a series of discrete values to continuosly variable data sequenced by time, position, etc., thereby parsing the data into fewer and larger segments of variable width. The 'segment' utility takes an input data stream as a Hidden Markov Model and applies the Viterbi algorithm to find the most likely segmentation path through the data. -
14
smooth
Wavelet smoothing in a data stream
It is often necessary to smooth high frequency fluctuations out of data streams sequenced by time, position, etc. The 'smooth' utility applies such smoothing using the wavelet algorithm. This implementation of wavelet smoothing was optimized for use in a data stream. It was adapted from HMMSeg Wavelet.Java by Thomas E. Wilson, University of Michigan. HMMSeg Wavelet.Java was written by Andrew Hemmaplardh, University of Washington. http://noble.gs.washington.edu/proj/hmmseg/ Unsupervised segmentation of continuous genomic data, Bioinformatics 2007 23:1424-1426 See the above references for a more thorough description of the principles behind wavelet smoothing. -
15
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/ -
16
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.
-
17
ISAD
Individual Synaptic Activity Detection (ISAD)
...It computes synaptic signals from automatically segmented regions of interest and detects peaks that represent vesicle fusion events, thus, pre-synaptic activity. ISAD is based on MWA, which is a continuous wavelet transform based algorithm that employs multiple wavelets and is published as: Sokoll, S., Tönnies, K., and Heine, M. Detection of Spontaneous Vesicle Release at Individual Synapses Using Multiple Wavelets in a CWT-Based Algorithm. Med Image Comput Comput Assist Interv (MICCAI). 2012;15(Pt 1):165-72 ISAD is written in MATLAB and comes with a graphical user interface. -
18
C++ software which implements serial and parallel Nullspace Algorithm based on algebraic rank test for the computation of elementary flux modes.
-
19
Swift Sequence Alignment Program
GPU-based DNA sequence alignment program using Smith-Waterman
Swift is a DNA sequence alignment program that produces gapped alignment using the Smith-Waterman algorithm. It takes in a query file (FASTA format) and a reference file (FASTA format) as input. It outputs the reference name, read name, gapped alignment, alignment score, alignment start and end positions, and alignment length. I gave a talk on Swift in the GPU Technology Conference 2012. The talk can be accessed at http://www.gputechconf.com/gtcnew/on-demand-GTC.php? -
20
ParsInsert efficiently produces both a phylogenetic tree and taxonomic classification for sequences for microbial community sequence analysis. This is a C++ implementation of the Parsimonious Insertion algorithm.
-
21
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.
-
22
DecGPU: CUDA-based Error Correction
The first distributed and parallel short-read error corrector on GPUs
DecGPU (Distributed Error correction on GPUs) is a parallel and distributed error correction algorithm for large-scale short read assembly. It is implemented using CUDA C++ and MPI, running on a GPU cluster. -
23
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.
-
24
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/ -
25
GWCNV is a genome-wide algorithm for detecting CNV associations with diseases. It works directly on a transformation of intensity data. It is powerful and sensitive in detecting small CNV associations, and retains high power for large CNVs.
