In this paper we propose a segmentation of finite support sequences based on the even/odd decomposition of a signal. The objective is to ind a more compact representation of information. To this aim, the paper starts to generalize the even/odd decomposition by concentrating the energy on either the even or the odd part by optimally placing the centre of symmetry. Local symmetry intervals are thus located. The sequence segmentation is further processed by applying an iterative growth on the candidate segments to remove any overlapping portions. Experimental results show that the set of segments can be more eficiently compressed with respect to the DCT transformation of the entire sequence, which corresponds to the near optimal KLT transform of the data chosen for the experiment.