Skip to main content

Table 1 An example of implicit signatures.

From: A parallel and incremental algorithm for efficient unique signature discovery on DNA databases

(A) A DNA database.

CCCTAATG

TTAATAAT

ATAATGCG

(B) All 5-patterns in the database.

CCCTA, CCTAA, CTAAT, TAATG, TTAAT, TAATA

AATAA, ATAAT, ATAAT, TAATG, AATGC, ATGCG

(C) Some unique signatures in the database.

Ω5,1

CCCTA, CCTAA, AATAA, AATGC, ATGCG

Ω5,2

ATGCG

Ω4,1

CCCT, CCTA, ATGC, TGCG

Ω4,2

TGCG

  1. Let Ωl, ddenote the set of the unique signatures of length l and mismatch tolerance d. The result shows that all of the patterns in Ω5,2, Ω4,1 and Ω4,2 are implicit in Ω5,1.