Search Results for "problem a"
Sort By:
Showing 15 open source projects for "problem a"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB 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.
-
Veeam Data Platform v13.1Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
1
MPprimer
a program for reliable multiplex PCR primer design
Background: Multiplex PCR, defined as the simultaneous amplification of multiple regions of a DNA template using more than one primer set (comprising a forward primer and a reverse primer) in one tube, has been widely used in clinical and environmental microbiology studies. However, primer design for multiplex PCR is still a challenging problem and several factors need to be considered. These problems include mis-priming due to nonspecific binding to non-target DNA templates, primer dimerization, and the inability to separate and purify DNA amplicons of similar electrophoretic mobility. Results: A new program named MPprimer was developed to help users design primer sets for multiplex PCR with high reliability. ... -
2
MuffinEC
Multi-technology, INDEL aware error correction for NGS data
...We are developing the 2nd version of MuffinEC. The beta version is already available online. The changes are listed in the VERSION_HISTORY file. Please report any problem you may encounter at the email address specified in the README file. We really appreciate your help. -
3
ExSTraCS
Extended Supervised Tracking and Classifying System
...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. ExSTraCS was primarily developed to address problems in epidemiological data mining to identify complex patterns relating predictive attributes in noisy datasets to disease phenotypes of interest. ExSTraCS combines a number of recent advancements into a single algorithmic platform. It can flexibly handle (1) discrete or continuous attributes, (2) missing data, (3) balanced or imbalanced datasets, and (4) binary or many classes. ... -
4
adLIMS
adLIMS: a Laboratory Information Management System with ADempiere
Many biological laboratories dealing with genomic samples are facing the problem of sample tracking, both for pure laboratory management and efficiency, and for internal policies, such as Good Laboratory Practices (GLP). Our laboratory exploits PCR techniques and next-generation sequencing (NGS) methods, to perform high-throughput integration site monitoring in different clinical trials and scientific projects, based on the delivery of therapeutic genes by viral vectors integrating into the genome of target cells. ... -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
5
cmotif
A method for mining conditional phosphorylation motifs
...The discovery of phosphorylation motifs is a very valuable work in bioinformatics. 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. -
6
ARDEN
Specificity Control for Read Alignments Using an Artificial Reference
...It allows the computation of error rates specifically for a dataset and the construction of a ROC-curve. Thereby, it can be used to optimize parameters for read mappers, to select read mappers for a specific problem or also to filter alignments based on quality estimation. -
7
...The first module in the project was the "ePrescribing application"; certified by RxHub and SureScripts back in 2007. New implementation needs to "re-certify" with SureScripts (which should not be much of a problem) Work on eLabs (using ELINCS, LOINC etc.) is being considered as participants join the project become available. The HL7 RIM allows for eImaging applications, eConsults applications, eReferrals applications, etc. Applications work independently, but through HIE, results come back to the provider to see it in its "CPOE Section or Module" Requires licensing of the MediSpan Drug Database for ePrescrib
-
8
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
...The algorithms included in TreeLiker are unique in that, in principle, they are able to search given sets of relational patterns exhaustively, thus guaranteeing that if some good pattern capturing an important feature of the problem exists, it will be found. In experiments with real-life data, the algorithms were shown to be able to construct complete non-redundant sets of patterns for chemical datasets involving several thousands of molecules as well as for comparably large datasets from genomics or proteomics. The included relational learning algorithms are tailored towards so-called tree-like features for which some otherwise very hard sub-problems (NP-hard) become tractable. -
9
Javamony
A Student's Approach to the Phylogenetic Problem
Based on the not-so-successful Pysimony (https://sourceforge.net/projects/pysimony/), the same determined student takes another go at the phylogenetic problem. Javamony is invoked as follows: java -jar Javamony.jar [input.fasta] [random / stepwise (starting tree)] [# of bootstraps] [outgroup taxon #1] [outgroup taxon #2] ... Not meant as a competitive phylogenetic inference program, Javamony is an opportunity for me to acquire the Java language while learning to address and solve fundamental problems in phylogenetics. ... -
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
10
Pysimony
A Pythonic Implementation of Parsimony Inference of Phylogeny
...An unlikely-to-be-the-most-parsimonious tree is printed upon completion in basic Newick tree format. As all parts of the program are the original work of a beginner programmer, this may represent one of the worst approaches to solving the phylogenetic problem. I have clearly avoided object-oriented programming. Nevertheless, I distribute this imagining it might someday be slightly educational or at least provide a laugh at the pathetic attempt it makes to reinvent the wheel -
11
It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.
-
12
Set of Java packages to apply Genetic Algorithms to any kind of problem. Various genetic operators are implemented and an example shows of how the system could be applied to digital circuit evolution.
-
13
MooN is a free software tool that provides a fast heuristic and problem implementation framework in form of plugins.
-
14
For interactive clustering and visualization, Cluster and TreeView by Mike Eisen are great. XCluster by Gavin Sherlock solves the problem of clustering large numbers of files. Now slcview allows you to script generation of cluster and tree images.
-
15
jrgp is a strong-typed Genetic Programming system, which features a graphical interface (gool) to setup and run GP-problems and a tool (fs-d) that greatly simplifies the definition of a GP-problem.
- Previous
- You're on page 1
- Next
