Résumé en anglais

This article considers the problem of storing all the paths generated by a particle filter. It provides a theoretical result bounding the expected memory cost and an efficient algorithm to realise this. The theoretical result and the algorithm are illustrated with numerical experiments.