To begin our line of reasoning, proteins that occur in the normal tissue are placed in a list labeled A . The goal is to discover and compare those proteins that are unique to each list and the relative quantities of their expression. DNA contains the manufacturing keys to protein synthesis. It is sought to recursively subdivide both normal and tumor DNA, using restriction enzymes, eliminating identical parts of the DNA apparatus to reduce the scope of the search to just those proteins that differ between lists A and B. Divide and conquer is a commonly applied computational technique, where a large problem is divided into multiple smaller problems, for example list sorting as in qsort . These smaller problems are then themselves attacked by the same divide and conquer technique until a special termination condition is reached.
Every cell requires growth signaling.
Broken growth signaling may occur, not as the Boolean of an OFF or ON, but rather as the Continuous or Intermittent Over or Under expression of a signaling substance. If this is the case then n , the number of proteins made by normal DNA will equal m , the number of proteins made by tumor DNA and a Boolean approach will fail. Further the entries in each list will be identical. If unique proteins arise, such as in myeloma this is ideal since we would like to associate particular substances with the pathological state. A and B does not mean that the SAME proteins are present.