Showing 20 open source projects for "algorithm"

View related business solutions
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You 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.
    Try free now
  • 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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Interactome  Transcriptome Integration
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4

    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • AestheticsPro Medical Spa Software Icon
    AestheticsPro Medical Spa Software

    Our new software release will dramatically improve your medspa business performance while enhancing the customer experience

    AestheticsPro is the most complete Aesthetics Software on the market today. HIPAA Cloud Compliant with electronic charting, integrated POS, targeted marketing and results driven reporting; AestheticsPro delivers the tools you need to manage your medical spa business. It is our mission To Provide an All-in-One Cutting Edge Software to the Aesthetics Industry.
    Learn More
  • 5

    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.
    Leader badge
    Downloads: 31 This Week
    Last Update:
    See Project
  • 6
    CABBaGe

    CABBaGe

    Classification Algorithm Based on a Bayesian method for Genomics

    Downloads: 0 This Week
    Last Update:
    See Project
  • 7

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Inventors: Validate Your Idea, Protect It and Gain Market Advantages Icon
    Inventors: Validate Your Idea, Protect It and Gain Market Advantages

    SenseIP is ideal for individual inventors, startups, and businesses

    senseIP is an AI innovation platform for inventors, automating any aspect of IP from the moment you have an idea. You can have it researched for uniqueness and protected; quickly and effortlessly, without expensive attorneys. Built for business success while securing your competitive edge.
    Learn More
  • 10

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences.
    Leader badge
    Downloads: 1 This Week
    Last Update:
    See Project
  • 12

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    Algorithm Based Automatic Contiguation of Assembled sequences (ABACAS) is an integrated platform for quickly contiguating reference based assemblies.
    Leader badge
    Downloads: 5 This Week
    Last Update:
    See Project
  • 16
    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
    Downloads: 1 This Week
    Last Update:
    See Project
  • 17
    ChIPOTle is a peak-finding algorithm used to analyze ChIP-chip microarray data
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    A novel algorithm to layout the contigs with more than one reference genomes at a time using global searches
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    Basic implementation of K-nearest neighbour Algorithm and the application of KNN to classify protein sequences as transmembrane beta barrel or non-transmembrane beta barrel on the basis of whole sequence amino acid composition given as input.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20

    biojazz

    In silico evolution of biochemical networks.

    In silico evolution of biochemical networks using a genetic algorithm combined with a rule-based biochemical network model.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next