Graph Theory Notes of New York
Evidence is presented that certain sequences of Pokémon cards are determined by selecting consecutive elements from a longer sequence. We then consider the problem of recovering the shortest common superstring (SCS), i.e., the shortest string that contains each of the Pokémon card sequences as a consecutive substring. The SCS problem arises in many applications, most notably in DNA sequencing.
Mark Stamp and Austin Stamp. "Pokémon® Cards and the Shortest Common Superstring" Graph Theory Notes of New York (2004): 19-24.
This article was published in Graph Theory Notes of New York, volume 47, 2004. It is included here with the journal's permission.