Nov 132013
 

CPD r136

:: DESCRIPTION

CPD is a program that solves the generalized color set size problem in linear time.

::DEVELOPER

Hideo Bannai 

:: REQUIREMENTS

  • Linux/MacOsX
  • C++ Compiler

:: DOWNLOAD

  CPD

:: MORE INFORMATION

Citation

Hideo Bannai, Heikki Hyyrö , Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano,
Finding Optimal Pairs of Patterns“,
In Proceedings of the 4th International Workshop on Algorithms in Bioinformatics (WABI 2004), LNBI 3240:450-462, (2004).

13 views

Sorry, the comment form is closed at this time.