F4F4-invariant algorithm for computing SAGBI-Gröbner bases

This paper introduces a new algorithm for computing SAGBI-Gröbner bases for ideals of invariant rings of permutation groups. This algorithm is based on F4F4 algorithm. A first implementation of this algorithm has been made in SAGE and MAPLE computer algebra systems and has been successfully tried on a number of examples.