Optimal distance-based clustering for one-dimensional data This package contains a function to cluster one-dimensional data optimally using dynamic programming to minimize the sum of squares of within cluster distances. It provides an alternative to the heuristic k-means algorithm which does not guarantee optimality. Software Depends: R (>= 2.10.0) Haizhou Wang<hwang@cs.nmsu.edu> Joe Song <joemsong@cs.nmsu.edu> and Haizhou Wang <hwang@cs.nmsu.edu> LGPL (>= 3) 2011-06-18 application/tgz http://CRAN.R-project.org/package=Ckmeans.1d.dp