Search Results for "algorithm"

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

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

...TEACUP utilises a text-based configuration file to define experiments as combinations of parameters specifying desired network path and end host conditions. When multiple values are provided (e.g. for TCP congestion control algorithm), an experiment is made up of multiple tests. For each experiment and test, TEACUP collects a range of data, such as tcpdump files of traffic seen or TCP stack information (e.g. using Web10G). TEACUP also collects a variety of metadata from the end hosts and bottleneck router, such as the actual OS/kernel version(s) used. ...

- MixtureModel_v1r1: overlapping community algorithm [3], which includes novel partition density and fuzzy modularity metrics. - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2].

The NOFI ranking algorithm has been developed to assign low priority to fragment ions affected by interference. The implementation is an R script that can be customized. A future version will contain a modular version. The outline is as follows: 1) The input contains the list of SWATH fragment ion XICs from the identified and quantified peptides by software tools such as Skyline and OpenSWATH. 2) The first step in NOFI is the computation of the 4 attributes (RTd, FWHMd, IRd and IRrep) used to represent each fragment ion as a vector. 3) Multivariate outlier detection techniques are used to rank all the fragment ions from each peptide. 4) Several figures are generated (a pdf file) to visualize the effect of the Top-N fragment ions over different indicators. 5) The user can choose the number of top fragment ions per peptide, thereby utilizing the optimal subset of high priority Top-N NOFIs for quantification while excluding the impaired fragment ions.

...This project tries to realize these algorithms with statistical programming. Overcoming the long span has important meanings. First, we can verify the validity of algorithm with big data. Second, we can put them into unprecedented wide application in the age of data. Third, the unique inspection of I Ching that linked "all the universe" open new eyes for us in thought and methodology about interdisciplinary use of data. This program is open-source for human. If you are interested in it, welcome to discuss and work together.

...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.

The RDXplorer is a computational tool for copy number variants (CNV) detection in whole human genome sequence data using read depth (RD) coverage. CNV detection is based on the Event-Wise Testing (EWT) algorithm recently published by our group.

This is a variant of k-means algorithm which allows datas to belong to several clusters instead of just one.

The TreeRank project is a R package implementing a Machine Learning algorithm to build tree-based ranking rules from data with binary labels, based on ROC optimization.

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

R based genetic algorithm for optimization, variable selection and other machine learning and statistical analysis approaches.

A suite of tools for discovering and genotyping genome structural variation from sequencing data, including the Genome STRiP algorithm.