RepeatingSequences

RepeatingSequences[sequence,k]⟹sequences

this function takes a sequence and returns a list of subsequences of length k from the entire sequence that are repeated.

RepeatingSequences[sequence,k,Span[m,n]]⟹sequences

this function takes a sequence and returns a list of subsequences of length k from the position m to positon n in the sequence that are repeated.

RepeatingSequences[sequence]⟹sequences

this function takes a sequence and returns a list of subsequences from length spesified by the MinLevel option to the largest repeat length present from the entire sequence that are repeated.

RepeatingSequences[sequence,Span[m,n]]⟹sequences

this function takes a sequence and returns a list of subsequences from length spesified by the MinLevel option to the largest repeat length present from the position m to positon n in the sequence that are repeated.

Details

When spans are provided returns any sequences of length k which inclusively contact the provided region.

Input

Output

General Options

Attributes

Listable

Examples

Basic Examples (3)

Find all 6-mer repeating subsequences:

Find all repeating subsequences whose length is between 4 and 6:

Analyze multiple sequences at once:

Options (4)

Consolidate (1)

If no length 'k' is provided counts only the largest occurance of a subsequence (e.g. if a folding subsequence of length 6 exists, and consolidate is true, does not return the composite 5,4,3,2,1-mer folds that exist entirely within the 6mer fold):

Degeneracy (1)

Can turn on degeneracy:

MinLevel (1)

Can turn on MinLevel:

Polymer (1)

Can specify polymer type:

Attributes (1)

Listable (1)

Function is listable: