Tree search options

You can use the tree in the left pane to narrow the search to the portion of the database in which the part is likely to be located. In the screen capture above, I have selected the 1C portion of the database. I have selected the Contains option because it is usually very hard to pick a part number exactly. Like any search engine, it will take some experience with the engine before you can search for parts efficiently. Click the Go button when you have entered the information above ... 

The first major step toward managing any search system in so large a potential search space is the reduction of bulky molecular information to numbers. The numerical convention must retain the significant information, consolidate trivial distinctions such as minor functionality variants, and also serve to define the problem and its options sharply. This is the intent of Section 2. The tree, however, will still be very large and we must look further for criteria to apply... 

Figure 20 The backtracking trees presented here represent the interaction of four amino acid residues. In (a) the top of the tree is the first residue side chain that possess two possible rotameric states, thus two branches. Residue 2 is on the next level and has three rotamers. The third residue has five possible rotamers, and Residue 4 has two possible rotamer states. The tree in (a) is not efficient because of the number of rotamer options for Residue 3. The same set of residues are evaluated in (b), but the order in which they are examined is changed. Residue 1 is still first, but that is now followed by Residue 4, then Residue 2, and finally Residue 3. Residues having the fewest possible rotamers are evaluated first, thus increasing the speed of the search for the GMEC. A total of 60 possible side-chain interactions exist in this example with the most favorable denoted with a circle [1, 2, 5, 1]. The arrows denote the path of the most favorable rotamer combination. This image was adapted from Canutescu et al. ...

---