From: Suffix tree searcher: exploration of common substrings in large DNA sequence sets
 | Setting | Explanation |
---|---|---|
Traversal settings | LCS occurrences | Gather LCSs occurring for n = 2, … up to the number specified by this setting |
 | LCS inputs | Gather the single LCS in k = 2, … input sequences up to the number specified by this setting |
 | Number of occurrences | For each number n specified, fetch the p longest LCSs occurring exactly n times, regardless of input sequence |
 | Number of inputs | For each number n specified, fetch the p longest LCSs occurring at least once |
 | Sets | Fetch the p best results for each set of input sequences as specified by this setting. Sets are specified with braces. e.g. {2}{2,3}{2,3,4}{2,4}{5,6} |
 | All singles | Gather a separate result set for each input sequence. |
 | All pairs | Gather a separate result set for each possible pair of input sequences |
Traversal results display | Threshold length | Common substrings must be of at least this length to show up in result sets |
 | Display length | Display LCSs only up to and including this length in the result sets |
 | Max results | For the non-standard result sets, restrict table size to this many rows |
 | Reference genome | Gather result sets only for queries involving this input sequence |