A generic sequence algorithm is a generic algorithm that takes one or more linear sequences as inputs. Thus for example generic divide-and-conquer sequence algorithms are a refinement of the generic divide-and-conquer algorithm concept, in which the inputs are linear sequences (as opposed, say, to sets).
Other important examples of classification of algorithms according to their input types include generic matrix algorithms, generic tree algorithms, generic graph algorithms, etc.