Sentence examples for enumerating candidates from inspiring English sources

Previously, we have proposed a method for enumerating candidates for mutations intended to transfer the functionality of one protein into another related protein based on the spatial and electrostatic properties of the active site residues (DECAAF).

The algorithm assumes parenthetical expressions to introduce abbreviation definitions in the following format: (1) For each inner expression of a parenthetical expression, the algorithm enumerates candidates of expanded forms that begin with any non-function word (e.g., a, and, of) and end with any word immediately before the parenthetical expression.

Our strategy is very simple and is as follows: Our algorithm first divides the query into 3 k + 2 parts, and then enumerates candidates of the matches by filtering out text substructures without enough substructures seeming to be similar to the divided query substructures.

For example, in case we want to search for textual strings with k indels, we can efficiently enumerate candidates of the matches by dividing the query into k + 1 substrings and finding the exact matches of these divided substrings, as at least one of the divided substrings must exactly match somewhere in the text.

The method gradually improves upper and lower bounds of the objective function by solving linear programs and systematically enumerates candidate solutions in branches of a tree with the full set of candidate solutions at the root by checking against the upper and lower bounds.

Since the number of such candidate windows is still very large, a heuristic method is designed for enumerating the candidate effective multi-segment sliding windows.

Algorithms such as SLIDE, NSMAP or others that explicitly enumerate the candidates and minimize the parameter in the candidate space also return one of several solutions.

This algorithm reduces the computation time for setting up a multicast traffic request by enumerating a set of candidate p-cycles based on the PC score.

Let N' denote the number of candidates enumerated in step 1 of our algorithm.

The experimental results show that our tools are competitive in enumerating spaces of structured motif candidates.

After evaluating the 4 measurements used for enumerating the domain architecture, the candidate with the highest priority {SSF54814} is obtained.