Open Source Algorithms - Page 8

The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. This Java implementation implements our ESM algorithm. See README file: https://sourceforge.net/projects/esmalgorithm/files/ If you use our ESM implementation to support academic research, please cite the following paper: Haibin Liu, Vlado Keselj, and Christian Blouin. Exploring a Subgraph Matching Approach for Extracting Biological Events from Literature. Computational Intelligence, 2013.

Libface is a cross platform framework for developing face recognition algorithms and testing its performance.

Foreval is compiler of mathematical expressions (formulas) (directly to x86-32 CPU/FPU/SSE instructions) given as string at run-time. Present as "dll" library and Delphi sources. Can be compiled in FPC (Lazarus). Can be direct connection to the program (without dll). Сurrent version ( v. 9.1.1.395B): Examples for Delphi, Lazarus , GCC (Codeblock), MSVC. Demo: Fractals Julia; Visualizing of functions of complex variable - complex domain coloring , graph plotting & finding roots F(x), Fourier series. Old version (v.8.4.17.250): Examples for Delphi, FPC, Builder, MSVC , GCC (Codeblock) , VB6, FreeBasic. Download files: Foreval_all.7z (Foreval v9 + Foreval v8 + ForevalZ + all examples + doc) - recommend ForevalG9.7z (Foreval v9 + examples v9+ doc) (math parser, math expression parser, evaluate formula, evaluator, symbolic, differentiation, derivative , complex)

Gemi, an automated, fast, and easy-to-use bioinformatics tool with a user-friendly interface to design primers and probes for polymerase chain reaction (PCR). Gemi accepts multiple aligned and long DNA and RNA sequences with degenerate nucleotide (non-A/C/G/T bases). Gemi can be used for quantitative, real-time and conventional PCR (qPCR, rt-PCR, etc.), and Sanger sequencing. Gemi can parse large dataset of sequences efficiently. Python source code is available upon request. Milestone: The tool reached about 3000 downloads sine 2012. Article Gemi: PCR primers prediction from multiple alignments. Comparative and functional genomics 2012 PMID: https://www.ncbi.nlm.nih.gov/pubmed/23316117 A great review on designing primer, Gemi, and other tools: Designing degenerate primers: Overview, challenges, and computational methods. Methods in Microbiology. Vol 57, 2025, Pages 73-89; DOI: 10.1016/bs.mim.2025.01.002

Java Machine Learning Library is a library of machine learning algorithms and related datasets. Machine learning techniques include: clustering, classification, feature selection, regression, data pre-processing, ensemble learning, voting, ...

This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.

OpenDiscreteDynamicProgrammingTemplate : founds optimal constrainted parameters of a discrete controls with second order optimization template replacing Hessian with directional derivatives and backpropagation for digital filter(as neural network)

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?

Rupantor- Bijoy to Unicode converter. It converts Bengali texts written in Bijoy fonts to UNICODE. রূপান্তর- বিজয় থেকে ইউনিকোড এ পরিবর্তন করার সফটওয়ার। এটি à

in here will be all codes of my games made in simple j and you can use it freely just put my name on the credits

A GUI sorting visualizer desktop application that helps to visualize various sorting algorithms interactively. Visualizer the sorting algorithms like Bubble sort, Insertion sort, Selection sort, Gnome sort, Shaker sort and Odd even sort. Change the bar color and background by customizing. Increase or decrease speed of animation to visualize the sorting process. Download now!

Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.

Pascal libraries and components. Library for: Matrix, Matrix Math, Math & statistic, CSV, URL, Counters, dir/file scanning, file/string/… utils, progress bar, … Components: DataList, Line oriented reports, Gauge, Syllable (Italian), …

This is a commandline-terminal sokoban solver written in Ada. It is "generic" in the sense that it contains no domain specific strategies. It also provides a demonstration of the incredible power of the Hungarian Algorithm. The proper command to extract the archive and maintain the directory structure is "7z x filename".

jpaul is a Java implementation of several algorithms widely used in program analysis. It emphasizes flexibility and ease-of-use and is independent of any specific compiler infrastructure project. BSD Licence.

This project has moved to github at http://lmwtree.devries.ninja.

A slightly reduced strength bulk encryption. In exchange for the reduced strength, you get the ability to rsync the encrypted files, so that local changes in the plaintext file will result in (relatively) local changes to the cyphertext file.

sdf4j is a Java framework to manipulate Static Dataflow graphs (SDF).

User AES-128 bit encryption in counter mode of operation. supports interactive mode of operation and command line mode of operation.

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib

Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.

Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming. · Solvexo provides a solution with the graphic method for problems with tow variables. · This updated version includes two languages English and French. If you have any questions, feel free to contact me: romdhani.mohamed.ali@gmail.com. Any comments and suggestions would be helpful!

A very well optimized coherent noise-generating library for C++ under BSD-style license

Threading Building Blocks offers a rich and complete approach to expressing parallelism in a C++ program. It is a library that helps you leverage multi-core processors for performance and scalability without having to be a threading expert.

ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.