Résumé
Sequential patterns have been studied for the last fifteen years and are now well-recognized as a key method for extracting relevant knowledge from large databases. They have been extended to handle quantitative attributes, both in the crisp and fuzzy context. However, they still fail to catch one of the key information often hidden in the data, i.e. graduality. In this paper, we identify two kinds of gradualness that can be combined with the ordering notion of sequential patterns. For instance, gradualness can be seen as a {\bf temporal evolution} or as a {\bf values evolution} from one object to another one. We then propose an efficient algorithm to handle the first kind of gradual sequential pattern. We also provide the necessary theoretical material.