BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
Simple UI to test the effectiveness of a heuristic algorithm against the brute force method for path finding among an arbitrary number of arbitrarily placed points on a grid. This is an educational project, don't expect new and better methods.
Ex-Crawler is divided into 3 subprojects (Crawler Daemon, distributed gui Client, (web) search engine) which together provide a flexible and powerful search engine supporting distributed computing. More informations: http://ex-crawler.sourceforge.net
Build gen AI apps with an all-in-one modern database: MongoDB Atlas
MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
CEGA is a highly extendable layout plugin for Cytoscape based on an Evolutionary Algorithm. In contrast to other layout algorithms, CEGA lets users decide which features are important for the visualization of their graphs.
D-finder is a bioinformatic search algorithm for the identification of D-sites in JNK interacting proteins. The algorithm is a combination of pattern matching and a hidden markov model (HMM) based on a training set of known JNK D-sites.
Optex Analyzer is a software to analyze and compare algorithms to solve approximately optimization problems. It has a GUI that allows select a set of input files containing raw algorithm results. The analysis is shown with tables and charts.
This is the extended euclidean algorithm implemented in haskell.
It will put every single step of the algorithm in a file and show the actual result and everything in between.
Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
TaxonFinder is an application that annotates taxon found in literature. The application harnesses a hybrid algorithm that is necessarily a combination of morphological analysis, dictionary lookup and Levenstein Distance algorithm.
Maui is a multi-purpose automatic topic indexing algorithm. Given a document, Maui automatically identifies its topics. Depending on the task topics are tags, keywords, keyphrases, vocabulary terms, descriptors or Wikipedia titles.
This is a reference implementation of snoBAC, a Bayesian Classifier designed to predict box H/ACA snoRNAs in Caenorhabditis nematode genomes. For details of algorithm and data, see Wang and Ruvinsky (2009) RNA in press.
ConTextKit is a Java-based implementation of Wendy Chapman's ConText algorithm for annotating the context of medical documents, specifically the negation, temporality, and experiencer.
AlViz is a research prototype for visual ontology alignment implemented as multiple-view plug-in for Protege using J-Trees and Graphs. Based on similarity measures of an ontology matching algorithm AlViz helps to assess and optimize the alignment results
Vijner 974 E-Sys (2048 bits and unlimited encryption). Enables easy (un-)encryption from text input or .txt file, and to (un-)encrypt raw files, with Vigenère Algorithm + unlimited encryption keys. Simple and powerful. Adapt to fit your needs.
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
MCS is a tool that exploits the Monte Carlo method and, with a complex algorithm based on the PERT (Program Evaluation and Review Technique), it estimates a project's time.
MCS is a opensource project and it was devolped by Java Programming Language.
Shape is a molecular conformation prediction program. It uses a genetic algorithm to efficiently search the conformational space of a biomolecule and then clusters the results. It is very simple to use.
Java GUI to analyze one (or more, in batch mode) datasets with several feature selection methods at the same time and also performing an "ensemble" analysis. It can be easily extended to include any feature selection algorithm.
C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.