Motivation: The presence of repeated sequences is a well-known feature of bacterial genomes and interpretation and classification of those repeats is an actual problem. Results: We described a method for computing multiple repeats, that is sequences that have multiple (two or more) occurrences in a genome. In order to identify multiple repeats in bacteria genomes, we apply the YASS software (Noe et Kucherov) and developed a novel algorithm for multiple repeat clusterization. Exhaustive computation and analysis of those clusters of repeated sequences in bacteria is the subject of the present work.