This small collection contains tools that solve NP-complete string problems based on antichains. So far, there are solutions for

• Longest Common Substring
• Hitting String
  For a definition, see no. 49 on this annotated list of selected NP-complete problems.

The current versions are beta release only. No warranty can be given. Source code can be downloaded here. It is distributed under the BSD license.
The programs are written in OCaml. You will therefore need an OCaml compiler to produce the executables. We recommend version ≥ 3.09, but smaller versions may also suffice. You will also need the ExtLib extension of the OCaml standard libraries.

• Longest Common Substring source code, gzipped tar archive
  If you want to be notified whenever a newer version is available please provide your details. Otherwise leave the fields blank.

  Name:
  Email:
  Affiliation:

  For installation instructions see the included README file.
  Once installed type lcs --help for a short usage guide.

• Hitting String source code, gzipped tar archive
  If you want to be notified whenever a newer version is available please provide your details. Otherwise leave the fields blank.

  Name:
  Email:
  Affiliation:

  For installation instructions see the included README file.
  Once installed type hitstr --help for a short usage guide.

The input to these algorithms is given as a linebreak-separated list of ASCII strings.