In this paper, we show a clustering method supported on evolutionary algorithms with the paradigm of linear genetic programming. "The Straight-Line Programs (slp)", which uses a data structure which will be useful to represent collections of documents. This data structure can be seen as a linear representation of programs, as well as representations in the form of graphs. It has been used as a theoretical model in Computer Algebra, and our purpose is to reuse it in a completely different context. In this case, we apply it to the field of grouping library collections through evolutionary algorithms. We show its efficiency with experimental data we got from traditional library collections.