A Generic Implementation of the Pruned Dynamic Programing Algorithm

We present in this paper a generic implementation of the Pruned Dynamic Programing Algorithm. We discuss the performance of this algorithm compared to that of several algorithms (PELT, CART) - also programed in C++ to allow a fair comparison. The program was written in a full template way, thus allowing a large range of applications and a convenient way of adding extensions.