Skip to main content

Table 7 Algorithm for amino acid subalphabets searching

From: Protein subcellular localization prediction for Gram-negative bacteria using amino acid subalphabets and a combination of multiple support vector machines

1

current_node ← the initial group assignment by dividing the 20 amino acids into Ng groups.

2

REPEAT

   3

best_node ← current_node

   4

REPEAT

5

current_node ← best_node

6

generate all child nodes of the current node in the search tree.

7

best_node ← the child node with the highest h-value among all child nodes of the current node.

   8

UNTIL h(best_node) <h(current_node)

   9

IF h(current_node) < Tc THEN

10

current_node ← randomly re-generate initial group assignment

   11

ENDIF

12

UNTIL h(current_node) ≥ Tc