This algorithm takes in a Sequence and a SeqTag and returns a list of possible sub sequences

A Sequence might look something like this:

A B C D E F G H I J B C K L M N O P B C Q R S T

A SeqTag might look like: B C

There are three instances of the SeqTag (BC) in the Sequence. 1 is after A, 2 is after J and 3 is after P.

A list of possible sub sequences might look like:

[[B C D E],[I J B C K],[O P B C]]

note: all of the sub sequences have the SeqTag present, also the sum of masses all equal each other ie. B.mass + C.mass + D.mass + E.mass = I.mass + J.mass + B.mass + C.mass + K.mass = O.mass + P.mass + B.mass + C.mass

note2: these are hypothetical examples and the letters do not correspond to an actual amino acid

-- KevinDrew - 20 Jan 2005

• ComputePossibleSubSequences: original document