Search Results for "number prediction algorithm"
Sort By:
Showing 30 open source projects for "number prediction algorithm"
View related business solutions-
Level Up Your Cyber Defense with External Threat ManagementMove beyond alerts. Gain full visibility, context, and control over your external attack surface to stay ahead of every threat.
-
Dun and Bradstreet Connect simplifies the complex burden of data managementThe amount, speed, and types of data created in today’s world can be overwhelming. With D&B Connect, you can instantly benchmark, enrich, and monitor your data against the Dun & Bradstreet Data Cloud to help ensure your systems of record have trusted data to fuel growth.
-
1
miRDeep*
MiRDeep*
Please cite: An, J., Lai, J., Lehman, M.L. and Nelson, C.C. (2013) miRDeep*: an integrated application tool for miRNA identification from RNA sequencing data. Nucleic Acids Res, 41, 727-737. We will create index for you if you tell us your interested species (j.an@qut.edu.au). download command line version "MDS_command_line_Vxx.zip" clicking "Browse All Files" please find miRPlant in sourceforge for plant miRNA prediction. -
2
Updated 2022-06-11 added option to allow use of atoms other than C-alpha Updated 2021-11-29 to enable compilation on stricter compilers. Ab Initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. Calibur is an efficient tool for finding the decoy with the most number of neighbors within a threshold distance. If you prefer to use GitHub, go to https://github.com/kalngyk/calibur
-
3
DACO-algorithm
A novel transcription factor complex prediction algorithm.
Eukaryotic gene expression is controlled through molecular logic circuits that combine regulatory signals of many different factors. Complexation of transcription factors and other regulatory proteins is a prevailing and highly conserved mechanism of signal integration within critical regulatory pathways and enable to infer controlled genes as well as the exerted regulatory mechanism. We developed DACO (domain-aware cohesiveness optimization), a novel algorithm that combines... -
4
PF_HP
Prediction of proteinfolding in 2D HP model
Even in the simplified two dimensional HP-model (hydrophob/polar) the prediction of proteinfolding is NP complete. We implement a brute force algorithm with serial and parallel execution to solve short inputs of HP sequences (0-1 bitstrings). Selbst im vereinfachten zweidimensionalen HP-Modell (hydrophob/polar) ist die Proteinfaltung bereits NP-vollständig. Hier implementieren wir einen brute-force Algorithmus zur Lösung kurzer Eingabesequenzen (0-1-Bitstrings) für die Proteinfaltung. ... -
Repair-CRMAll-In-One Solution with an Online Booking portal for automating scheduling & dispatching to ditch paperwork and improve the productivity of your technicians!
-
5
D-Tailor
D-Tailor: automated analysis and design of DNA sequences
...DNA-Tailor (D-Tailor) is a fully extendable software framework for biological sequence analysis and multi-objective sequence design. D-Tailor permits the seamless integration of an arbitrary number of sequence analysis tools into a Monte-Carlo algorithm that evolves synthetic sequences towards user-defined goals. -
6
rDock
A Fast, OpenSource Program for Docking Ligands to Proteins and N.Acids
rDock is a fast and versatile Open Source docking program that can be used to dock small molecules against proteins and nucleic acids. It is designed for High Throughput Virtual Screening (HTVS) campaigns and Binding Mode prediction studies. rDock is mainly written in C++ and accessory scripts and programs are written in C++, perl or python languages. The full rDock software package requires less than 50 MB of hard disk space and it is compilable in all Linux computers. Thanks to its design and implementation, it can be installed on a computation cluster and deployed on an unlimited number of CPUs, allowing HTVS campaigns to be carried out in a matter of days. ... -
7
cfPred
Chou & Fasman algorithm implemented using C language.
Chou & Fasman algorithm implemented using C language. It is a CUI tool used for protein secondary structure prediction. -
8
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. -
9
PSICOV
The unofficial binary for PSICOV: Protein Sparse Inverse COVariance
PSICOV (Protein Sparse Inverse Covariance estimation program) is a coevoultion algorithm applied to very large (typically >=1000 sequences) multiple sequence alignments for precise protein structural contact prediction. This is the unofficial precompiled Windows binary for PSICOV compiled by Chengxin Zhang at Fudan University. The source code is copyrighted by David T. Jones, University College London. -
Most modern and flexible cloud platform for MLM companiesFor direct selling (MLM) companies, from startup to well established enterprises with millions of distributors across the world
-
10
Visualization of Protein-Ligand Graphs
Compute protein graphs. Moved to https://github.com/MolBIFFM/PTGLtools
NOTE: Project moved to https://github.com/MolBIFFM/PTGLtools. The Visualization of Protein-Ligand Graphs (VPLG) software package computes and visualizes protein graphs. It works on the super-secondary structure level and uses the atom coordinates from PDB files and the SSE assignments of the DSSP algorithm. VPLG is command line software. If you do not like typing commands, try our PTGL web server: http://ptgl.uni-frankfurt.de/ -
11
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. -
12
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... -
13
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). ... -
14
NOFI ranking
The Non-Outlier Fragment Ion ranking for enhaced DIA quantification
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. -
15
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 -
16
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. -
17
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.
-
18
Face Recognition Based Login Assistant
Login to Websites Automatically Using Your Face as Password
...The Viola - Jones Algorithm presents a novel face detection technique, we would implement this technique for face detection and then use eigen faces method to recognize the person in the image. Once recognized the person can easily sign in to any applications without the need of typing passwords or usernames. -
19
easyPAC
easy Primer prediction from Alignments and Consensus sequences
Primer prediction from alignments and consensus sequences. easyPAC applies all standard quality tests to degenerate primer and primer pairs and optionally maps all primer candidates to an arbitrary number of reference files like repeat databases or genomes to ensure target specifity. -
20
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. -
21
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. -
22
CRUMp
A probabilistic prediction system of protein phosphorylation sites
CRUMp is based on a kernel-based learning method called Classification Relevance Units Machine (CRUM). Given an input set of protein sequences in FASTA format, the system outputs the position, residue type (S, T, or Y), and the estimated probability of each tested site being phosphorylatable. Latest downloadable files: - crump-0.2.0.tar.gz: CRUMp GNU Octave package - crump-0.2.0.zip: CRUMp MATLAB script - crumptestset.fasta: A testing dataset in FASTA format. The sequence headers list... -
23
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.
-
24
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
-
25
Juggernaut is a high throughput out of core sequence assembly algorithm. This program is very useful in assembly projects involving massive number of short reads which originate from high coverage of the genome.
