adp-multi-monadiccp: Subword construction in adp-multi using monadiccp

[ algorithms, bioinformatics, bsd3, data-structures, library ] [ Propose Tags ]

This is an experimental subword construction algorithm for the adp-multi package. It uses the constraint programming framework monadiccp with the constraint solver OvertonFD. It is slower than the built-in algorithm in adp-multi and serves research purposes. Use it by importing ADP.Multi.Constraint.All instead of ADP.Multi.Rewriting.All in your grammar files.

Versions [faq] 0.1, 0.2.0, 0.2.1
Dependencies adp-multi (==0.2.*), base (==4.*), containers (>=0.4 && <0.6), monadiccp (==0.7.*) [details]
License BSD-3-Clause
Copyright Maik Riechert, 2013
Author Maik Riechert
Maintainer Maik Riechert
Category Algorithms, Data Structures, Bioinformatics
Home page http://adp-multi.ruhoh.com
Bug tracker https://github.com/adp-multi/adp-multi-monadiccp/issues
Source repo head: git clone git://github.com/adp-multi/adp-multi-monadiccp.git
Uploaded by MaikRiechert at Sat May 18 16:04:29 UTC 2013
Distributions NixOS:0.2.1
Downloads 2124 total (108 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees