Document Type

Article

Publication Date

2004

Publication Title

Graph Theory Notes of New York

Volume

XLVII (47)

First Page

19

Last Page

24

Abstract

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.

Comments

This article was published in Graph Theory Notes of New York, volume 47, 2004. It is included here with the journal's permission.

Download

Share

COinS