Frecpo is a program mining frequent closed partial orders from string databases. 
The algorithm of Frecpo is described in the following paper.

J. Pei, H. Wang, J. Liu, K. Wang, J. Wang, and P. S. Yu. "Discovering Frequent 
Closed Partial Orders from Strings". IEEE Transactions on Knowledge and Data 
Engineering, Volume 18, Number 11, pages 1467-1481, November, 2006, IEEE Computer 
Society.

Please cite the above paper if the program is useful for you.

The program was implemented by Jian Liu using Microsoft Visual C++ 6.0 in November, 
2004. All rights of the implementation are reserved by the authors. Permission to
use the executable code is granted here without fee for academic, education, 
and/or personal uses only.

The program is released as the way it is, and should be regarded as "freeware", 
for which the authors do not hold any responsibility. Emails soliciting explanation 
may be ignored.

The program should be run as follows.

frecpo spec_file min_sup

The spec_file should contain four lines of text as follows.

  line 1: the name of the string database file to be mined
  line 2: the maximum item id in the string database
  line 3: the maximum length of a string in the database
  line 4: the total number of strings in the database

Each item in the string database should be coded as a non-negative integer. The 
string database should be coded as one string a line. Each line should be in the
following format:

  the-length-of-the-string item-1 item-2 ...

In the command line, min_sup is the absolute support threshold (i.e., not in 
percentage).

An example of spec_file and the corresponding data file are also provided in this 
package.

Any comments and suggestions should be directed to the first author of the above
paper.