Search Results for "algorithm"
Sort By:
Showing 48 open source projects for "algorithm"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
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
The Interactome-Transcriptome Integration (ITI) algorithm allows the analysis of gene expression data by superimposition of a large scale protein-protein interaction data (human interactome) over several gene expression datasets. ITI extracts regions in the interactome with differentiating expression over two conditions. These subnetworks can that be used to build a generalizable and stable genomic signature for genomic/cancer classification.
-
3
miRDP2
Accurately and fast analyzing microRNAs transcriptome in plants
miRDeep-P2 (miRDP2) is developed to accurately and fast analyze microRNAs (miRNAs) transcriptome in plants. It is adopted from miRDeep-P (miRDP) with new strategies and overhauled algorithm. We have tested miRDP2 to analyze miRNA transcriptomes in such plants with gradually increased genome size as Arabidopsis, rice, tomato, maize and wheat. Compared with miRDeep-P and several other computational tools, miRDP2 processed NGS data with superior speed. By incorporating newly updated plant miRNA annotation criteria, the accuracy of miRDP2 is also markedly improved. ... -
4
mapska
The Murder Accountability Project's Serial Killer Algorithm
Algorithm: Copyright (c) 2010, 2016 and 2017 - Murder Accountability Project. License: GNU General Public License (GPL) version 3. -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
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. -
6
Base62 Encode/Decode Utility
A tool for encoding/decoding to base62
...the base62 program has been written to encode/decode files into this format. The syntax is similar to the popular base64 command line program. Inside the package there is a working c++ version of the base62 algorithm. the sources are inside the package. Note that from release 2.0.0 the algorithm is different from the one used before. If you have coded a file using base62 < 2.0.0 DO NOT USE base62 >= 2.0.0 to decode it. The 2.0.1 release has a new algorithm for chew, we have a compat flag -
7
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 -
8
Flip card learning program for iPhone with a spaced learning algorithm. Create your own databases and edit the cards directly on the iPhone. Import Palm databases or csv-formatted files and backup your data with our Java application.
-
9
MaxBin
An automatic tool for binning metagenomics sequences
MaxBin is a software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users could understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome-related statistics, including estimated completeness, GC content and genome size in the binning summary page. -
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
CABBaGe
Classification Algorithm Based on a Bayesian method for Genomics
-
11
MicroGP
A multi-purpose extensible self-adaptive evolutionary algorithm
MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4 -
12
iCAS - An Illumina Clone Assembly System
An Illumina clone assembly system using SOAPdenovo and ABySS
...However, assemblies obtained using current whole genome assemblers are often fragmented and sometimes have issues of genome completeness owing to different data characteristics introduced by multiplexed sequencing. With iCAS the data filtering process is based on a novel kmer frequency algorithm, resulting in near perfect pre-assembly reads. Contigs are generated using different assembly algorithms and then merged together to achieve longer continuity. Re-aligning all the reads back to the draft contigs and recalibrating each sequence base achieves a final consensus. Using finished clones for QC, the pipeline is able to obtain assemblies with clone coverage of 99.7% and consensus base quality of Q39. ... -
13
GGNFS is an open source implementation of General Number Field Sieve algorithm for factoring integers.
-
14
CNVision
CNV prediction from Illumina genotyping data
CNVision is a Perl script that runs Illumina genotyping data (all chips from 300k to latest Omni) through PennCNV, QuantiSNPv2.3 and GNOSIS (an in-built algorithm). It merges the results and assesses the quality of the raw data. CNVision can also identify de novo CNVs in family-based data using a highly accurate algorithm that considers the possibility of CNVs in either parent based on the raw genotyping data. The script is optimized to work in a UNIX-based environment; it should work in Windows, however running the PennCNV component gives errors with the newer versions of PennCNV. ... -
15
mCarts
A hidden Markov model to predict clustered RNA motif sites
Many RBPs recognize very short and degenerate sequences, with targeting specificity achieved by mechanisms such as synergistic binding to multiple clustered sites and modulation of site accessibility through different RNA-secondary structures. mCarts integrates the number and spacing of individual motif sites, their accessibility and conservation, which substantially improves signal to noise ratio. This algorithm learns and quantifies rules of these features, taking advantage of a large number of in vivo RBP binding sites obtained from high throughput sequencing of RNAs isolated by cross-linking and immunoprecipitation (HITS-CLIP). We applied this algorithm to study two representative RBPs, Nova and Mbnl. Despite the very low information content in individual motif elements, our algorithm made very specific predictions for successful experimental validation. -
16
Digital Expression on the Web
DEW is a platform that allows users to explore RNA-Seq data
...The analysis proceeds as such: gapped alignments are performed and corrected for length, PCR and fragment bias so that a Fragment Per (effective) Kilobase per Million of reads (FPKM) is estimated as well as the simpler Reads Per Kb per Million of reads (RPKM). When provided with multiple isoforms and in the ‘contextual’ mode, corrections include a expectation maximization algorithm estimates effective expression profiles and a corrected alignment is produced. For each gene the user provides, DEW computes coverage descriptive statistics (RPKM, FKMP and total, mean and median corrected counts), expression profiles (normalized as R/FPKM and trimmed mean of fold change). DEW allows users to explore the data by providing interactive graphs. -
17
Use of Michael Rabin's Information Dispersal Algorithm to provide secure, dispersed storage in a networked environment. For full download, please get both Math-FastGF2 and Crypt-IDA releases under the files link. See project wiki for more information.
-
18
FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences.
-
19
HRSS
Hybrid Relative Specificity Similarity based on Gene Ontology
This software provides a hybrid GO-based semantic similarity algorithm for evaluating the functional similarity between GO terms or gene products. The software uses the pre-downloaded GO database files and the GO annotation files. It allows the users to set organisms, and evidence codes ignored. The software is composed of five modules, getGODAG, getGOAnno, hrssmatrix, hrsstps and hrsspps. -
20
Featurama is a library that implements various sequence-labeling algorithms. Currently Michael Collins' averaged perceptron algorithm is fully implemented.
-
21
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. -
22
HPeak
A HMM-based algorithm for defining enriched regions from ChIP-seq data
HPeak is a hidden Markov model-based approach that can accurately pinpoint regions to where significantly more sequence reads map. Testing on real data shows that these regions are indeed highly enriched by the right protein binding sites. Command (single-end): perl /compbio/software/HPeak3/HPeak.pl -sp HUMAN/MOUSE -format BED -t TREATMENT.inp -c CONTROL.inp -n OUTPUTPREFIX -fmin 100 -fmax 300 -r 36 -ann -wig -seq -interfiles Command (pair-end): perl /compbio/software/HPeak3/HPeak.pl... -
23
HIVCD
Informatics tool for contamination screening in the HIV sequencing lab
...Full details can be found in our paper titled "Application of a new informatics tool for contamination screening in the HIV sequencing laboratory" The code provided is a simple user interface to the underlying algorithm. We provide it as a convenience but it comes with absolutely no warranty as stated in the Apache License, Version 2.0. -
24
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. -
25
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.
