ADPfusionSet alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view ADPfusionSet alternatives based on common mentions on social networks and blogs.
-
arithmoi
Number theory: primes, arithmetic functions, modular computations, special sequences -
imj-animation
Monorepo for a multi-player game engine, and game examples -
presburger
Decision procedures for Presburger arithmetic in Haskell -
text-metrics
Calculate various string metrics efficiently in Haskell -
search-algorithms
Haskell library containing common graph search algorithms -
lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing -
-
treeviz
Haskell library for visualizing algorithmic decomposition of computations. -
incremental-sat-solver
Simple, Incremental SAT Solving as a Haskell Library -
integer-logarithms
Integer logarithms, originally split from arithmoi package -
GraphSCC
Tarjan's algorithm for computing strongly connected components -
nonlinear-optimization-ad
Wrapper of nonlinear-optimization package for using with ad and backprop packages -
edit-distance-vector
Calculate edit scripts and distances between Vectors. -
infinite-search
An implementation of Martin Escardo's exhaustively searchable sets in Haskell. -
-
graph-generators
A Haskell library for creating random Data.Graph instances using several pop -
adp-multi
Prototype of ADP for MCFL (multiple context-free languages) -
primesieve
A collection of packages related to math, algorithms and science, in Haskell. -
epanet-haskell
Call the EPANET toolkit via Haskell's Foreign Function Interface -
MIP
Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell -
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++)
Access the most powerful time series database as a service
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of ADPfusionSet or a related project?
|
Static code analysis for 29 languages.
sponsored
www.sonarqube.org
|
Popular Comparisons
-
ADPfusionSetvsersatz
-
ADPfusionSetvsTrieMap
-
ADPfusionSetvsedit-distance-vector
-
ADPfusionSetvsspacefill
-
ADPfusionSetvstwentyseven
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
ADPfusionSet
generalized Algebraic Dynamic Programming Homepage
Ideas implemented here are described in a couple of papers:
- Christian Hoener zu Siederdissen
Sneaking Around ConcatMap: Efficient Combinators for Dynamic Programming
2012, Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
paper preprint - Andrew Farmer, Christian Höner zu Siederdissen, and Andy Gill.
The HERMIT in the stream: fusing stream fusion’s concatMap
2014, Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation.
paper - Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler.
Product Grammars for Alignment and Folding
2014, IEEE/ACM Transactions on Computational Biology and Bioinformatics. 99
paper - Christian Höner zu Siederdissen, Sonja J. Prohaska, and Peter F. Stadler
Algebraic Dynamic Programming over General Data Structures
2015, BMC Bioinformatics
preprint - Maik Riechert, Christian Höner zu Siederdissen, and Peter F. Stadler
Algebraic dynamic programming for multiple context-free languages
2015, submitted
preprint
Introduction
ADPfusionSet extends ADPfusion with index structures suitable for sets. Included are sets, and sets with one and two boundaries. The classical example for DP on sets with a single boundary is the travelling salesman problem. Here, the set denotes the set of cities already visited, while the boundary is the last city that was visited.
Installation
Follow the gADP examples.
Contact
Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
[email protected]
http://www.bioinf.uni-leipzig.de/~choener/