Open Source Algorithms - Page 57

Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files

This is a review summary project about preparing for front-end interviews that I have summarized, and the project is updated from time to time. This is not only a strategy for job interviews, but also a collection of front-end ers to examine themselves and achieve breakthroughs. I hope that through this guide, everyone can open up their own lines of Ren and Du, and go further on the road to the front. This warehouse uses a large number of diagrams to convey knowledge. The so-called picture is worth a thousand words. I hope that this kind of graphic expression will make it easier for you to remember some abstract and incomprehensible concepts. "Graphic Front End" is my subtitle to it. Interviewing is a very subjective and difficult thing. Just because you don't pass the interview doesn't mean you're unqualified, just like passing the interview doesn't mean you're qualified. As a candidate, you are usually given 45 minutes to demonstrate your skills.

Fugu is a small C++ library of generic components for computer graphics applications. It's written on top of boost.

fxSTL is a C++ container library. fxSTL stands for the Fixed Standard Template Library. fxSTL is not a replacement for the STL, but is rather an extension of the STL that provides implementations of fixed size containers.

gacap is a C++ template library about `Generating All Combinations and Permutations'. It refers to std::next_permutation().

GDTTLA aims to be a comprehensive yet easy to use, stable IDE for the TLA+ tools.

Gearbox provides a collection of usable peer-reviewed robotics-related libraries. Gearbox is not an integration framework. Rather, it provides a set of implementations, without insisting on a standard API, for use by any number of existing frameworks.

Application to automatically merge gedcom files. It provides either a user or another program the ability to merge gedcom files with as little human interaction as possible and with high quality of matching results.

To identify cancer-related genes

A .net implementation of a framework for genetic algorithms. This tool enables programmers to write the "core" of their problem and have a genetic algorithm immediately setup for solving it.

Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

http://code.google.com/p/geometry/

Attempt to create a PHP-framework: component-oriented; with global DI-container; for micro-services and also for big module-builded projects; with its own ORM. Little demo: http://complex.php.gi.igor-gilman.de.

Programmer's library for random numbers. Also random number generator testing code. Intended for simulation, games and "Monte-Carlo" algorithms.

GLARE is a library and a software for product based optimization of reagent lists in the context of a chemical combinatorial library design. Large virtual combinatorial libraries containing 10^12 products have been optimized within a second.

glint is a tool facilitating you in development of state-oriented control entities which supposed to be used in very broad areas of programming (e.g. state-oriented network protocols). glint saves you from pondering how your finite state machine should be organized, how many states it should have and what they should mean. You just tell glint how you would like your control entity to operate and glint returns to you the synthesised magic black box which implements the desired logic. Also glint can tell you in regexp style which event sequences your FSM can handle and which are forbidden for it.

go-algorithms is an open-source educational repository that provides implementations of common algorithms and data structures written in the Go programming language. The project is designed primarily as a learning resource to help developers understand how fundamental computer science concepts can be implemented idiomatically in Go. It includes a wide range of classic sorting, searching, and numerical algorithms alongside basic collection structures such as stacks, queues, linked lists, and binary trees. The repository is organized into clear directories by topic, making it easy for learners to explore specific categories of algorithms. Because the code focuses on clarity over heavy abstraction, it is especially useful for students and developers studying algorithmic fundamentals. Overall, go-algorithms serves as a practical reference and study companion for Go programmers building a strong foundation in data structures and algorithm design.

libGo is a C++ class library containing all kinds of things that proved useful to me. Included are: - Linear algebra, using LAPACK and CBLAS - V4L(1) image grabber - Multithreading - Image containers (up to 3D) - Some simple optimisation code - Python embedding helper - Matlab interface - .. and other things, have a look at the HTML documentation! golib grew over many years, things I had use for have been added now and then. Some parts are better taken care of than others. If you find anything spectacularly wrong or badly documented, and need assistance, please drop me a line.

An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.

A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.

Porting of the core simulation portions of smoldyn to the GPU, using CUDA

Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...

GraphSmart is a collection of graph data structures and algorithms utilizing generics and the Microsoft .NET 2.0 Framework. Included items are commonly used in software engineering but not included in the .NET 2.0 Framework class library.

This library is a common implementation of both the Open Grid Forum GridRPC API _and_ GridRPC API Data Management standards. It is completely modular and already supports middleware modules for DIET and Ninf, as well as data manager modules for iRods, OwnCloud, rsync, scp. The installation is made easy with cmake and testing examples can be launched in a one line command.