Аннотация:Let s = s 1 .. s n be a text (or sequence) on a finite alphabet Σ. A fingerprint in s is the set of distinct characters contained in one of its substrings. Fingerprinting a text consists in computing the set F of all fingerprints of all its substrings. A fingerprint, f∈F , admits a number of maximal locations 〈i,j 〉 in S, that is the alphabet of s i .. s j is f and s i − 1, s j + 1, if defined, are not in f. The set of maximal locations is L,|L|≤n|Σ|. Two maximal locations 〈i,j 〉 and 〈k,l 〉 such that s i ..s j = s k ..s l are named copies and the quotient of L according to the copy relation is named LC . The faster algorithm to compute all fingerprints in s runs in O(n+|L|log|Σ|) time. We present an O((n+|LC|)log|Σ|) worst case time algorithm.