: This package includes the C++ code of the POSeqSel algorithm  for the sequence selection problem (i.e., maximizing functions defined on sequences) with a length constraint. This is an extension of our previous POSS algorithm  for the subset selection problem (i.e., maximizing functions defined on subsets) with a size constraint. POSeqSel uses a randomized iterative procedure to solve the bi-objective reformulation of the original problem: maximizing the objective function and minimizing the sequence length. A Readme file and two example files are included in the package.
:  Chao Qian, Chao Feng, and Ke Tang. Sequence Selection by Pareto Optimization. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI'18), Stockholm, Sweden, 2018.
 Chao Qian, Yang Yu, and Zhi-Hua Zhou. Subset Selection by Pareto Optimization. In: Advances in Neural Information Processing Systems 28 (NIPS'15), Montreal, Canada, 2015.
: This package is free for academic usage. You can run it at your own risk. For other purposes, please contact Dr. Chao Qian (email@example.com).
: The package was developed with C++.
: This package was developed by Mr. Chao Feng (firstname.lastname@example.org). For any problem concerning the code, please feel free to contact him.