Search Results for "problem a"

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

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

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

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

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

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

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

This tool is designed to solve generalized pattern matching problem, by which we only find a set of sub-patterns, ignoring the gaps in between the sub-patterns. This tool is extremely fast and also has good tolerance to errors.

FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.

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.

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.

MooN is a free software tool that provides a fast heuristic and problem implementation framework in form of plugins.

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.

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.