Let S =  {s₁, s₂, .... , s_k} denote a set of k genomes. The problem of fingerprinting is the task of identifying a shortest possible substring α_i from each string si such that α_i is unique to s_i - i.e., no other genome in the set S has α_i. Such an α_i will be called a fingerprint of si. (Note that it is OK for i to be present more than once within si.) Give an algorithm to enumerate a fingerprint for each input genome, if one exists. Assume that no two input genomes are identical.