Sequences

Exact and pattern search

Find a sequence letter for letter, or a pattern with variable positions, in every stored sequence. Every sequence is read, so the counts are complete.

What it does

Exact text finds the query as written. Pattern finds a PROSITE pattern or a regular expression. You choose the syntax, and Sequences never guesses, since brackets and parentheses mean different things in the two.

Both compare DNA with DNA or protein with protein, and a DNA search covers both strands unless you clear Search both strands. Each row is one stored sequence on one strand. Occurrences counts every place the text or pattern fits, and First positions lists up to 20 of them.

When to use it

  • To learn whether a peptide, a primer or a CDR appears anywhere in the patent sets, with a complete count.
  • To find a motif with fixed and variable positions, such as two restriction sites a few bases apart.

Example

The SIINFEKL sample ran an Exact text search of Patent proteins for these 8 letters, from UniProt P01012, residues 258 to 265. In the snapshot of November 5, 2026, it found them in 771 stored sequences. One is in US 5747269-A, Determination of peptide motifs on MHC molecules, published 1998-05-05, at positions 1 to 8.

A pattern works the same way. AAGCTT-x(2,6)-GGATCC finds a HindIII site, 2 to 6 letters, then a BamHI site, and the regular expression AAGCTT.{2,6}GGATCC finds the same.

Limits

A pattern takes at most 100 parts, 4 ranges such as x(2,6), repeat counts up to 1,000 and 20,000 characters. The list stops at 1,000,000 rows, and the totals still count every match.

Learn more