@hackage / adp-multi-monadiccp

Subword construction in adp-multi using monadiccp

Latest0.2.1

About

Metadata

  • Last updated , by MaikRiechert
  • License BSD-3-Clause
  • Categories Algorithms, Data Structures, Bioinformatics

  • Maintained by: Maik Riechert

  • Lottery factor: 0

Links

Installation

Package Flags

Use the -f option with cabal commands to enable flags

    buildbenchmark (off by default)

    Build benchmark executable

Readme

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.