Sentence examples for matching a substring from inspiring English sources

To do so, we first calculate for each position i in S1 the length s 1 (i ) of the longest common substring starting at i matching a substring of S2, as is done in ACS.

To find the length of the longest substring starting at SA[ i] in one sequence, matching a substring of the other sequence, and its occurrences there, we need to look up the largest integer p 1 (i ) with p 1 (i ) < i, such that SA [ p 1 (i ) ] belongs to the other sequence.

Consider, e.g. position i = 2 in the first sequence of the above example: Here, the substring AT starting at position 2 in S1 is the longest substring starting at this position and matching a substring of S2 but this substring occurs at positions 1, 5 and 10 in S2.

Formally, the length of the longest substring starting at a position SA[ i] and matching a substring of the respective other sequence is given as follows: (4) s (S A [ i ] ) = m a x (min ⁡ p 1 (i ) < x ≤ i L C P [ x ], min ⁡ i < y ≤ p 2 (i ) L C P [ y ] ) with p1 and p2 defined as above.

For a single sequence S and a position SA[ i] in S, the enhanced suffix array of S can be used to find the length of the longest substring in S starting at a different position in S and matching a substring starting at SA[ i].

To find possible additional matching positions, we consider all indices p ≤ p 1 (i ) in descending order, as long as one has the following inequality: L C P [ p + 1 ] ≤ min p 1 (i ) < x ≤ i L C P [ x ] For all such p that belong to the other sequence, the positions SA[ p] are occurrences of longest substrings matching a substring starting at i.

For i = 6, we want to find the longest common substring starting at S A [ 6 ] = 10 (marked by an arrow) that exactly matches a substring starting at some position in the other sequence.

In the prefix phase, a pair of reads is reported if the prefix of one of the reads exactly matches a substring of the other read at the given seed length.

In the example below, for position i = 4 in S1 and with k = 2 mismatches, our approach would return the following k-mismatch common substring, starting at position j = 2 in S2: To obtain this k-mismatch common substring, our program would first determine the longest common substring for position i = 4 in S1 that exactly matches a substring in S2.

Nonetheless, applying the Z-best strategy requires to know the top-scoring reference nodes matching a query substring without finishing the dynamic programming and thus only works when the reference is traversed in the inner loop.

The substring-search command can find objects with frame IDs that exactly match the search string which match to a substring of any "name" slot.