### Table 9 Results of the docking algorithm for the full ligand and receptor surfaces. receptor ligand best no. of best time

"... In PAGE 23: ... In these cases, the RMS criterion cannot be used to select the correct solution. Table9 lists the results obtained in the docking experiments. The RMS of the highest ranking solution, which is still below 1.... In PAGE 23: ...eptor. These are subsequently ranked by the surface contact score. The third column shows the rank of the solution whose RMS is listed in the rst column. Table9 demonstrates that the docked solution that is closest to the crystal- lographically determined one ranks at the very top for the complexes. The RMSD in all cases is below 2.... ..."

### Table 4. Scores for human progesterone receptor

2006

"... In PAGE 8: ...ean APs. ParAlign and BLAST are third and fourth, followed by Paracel and Biofacet. The ROC and mean AP scores give a clearer view of the differences between the algorithms than the FFP or NTP scores, because they take into account the ranking of all hits instead of just the first false positive or just the true positives. Human progesterone receptor Table4 shows our analysis of ASTRAL SCOP entry d1a28a_, using again the PDB095 set. The structural family a.... ..."

### Table 10 Results of the docking algorithm for the full ligand and active site receptor surface. receptor ligand best no. of best time

"... In PAGE 24: ... This is motivated by the fact that sometimes we can estimate the location of the active site in advance. Table10 shows the results for this easier case. 7 Further Developments and Future Tasks We have discussed two methods for rigid molecule docking which are based only on geometric complementarity search.... ..."

### Table 2 General information for the studied single- nucleotide polymorphisms of low-density lipoprotein receptor-related protein 5

2006

### Table 3 Single single-nucleotide polymorphism association results for low-density lipoprotein receptor- related protein 5 polymorphisms

2006

### Table 2. Quantum Densities on the

1997

"... In PAGE 9: ...5 times that for the rods at the same retinal locus. Table2 shows a difference between rods and cones that Retina and at the Receptora Rods, 507 nm mean (mn 2 sd) (mn 1 sd) mean 0.64 0.... In PAGE 9: ...(2.4.4) of the second edition, Tl should be Tl8 and that the units for l are centimeters in the first edition and meters in the second.] The best estimate of the losses in the ocular media are given in Table2 , with the estimated effects on retinal illuminance and receptor excitation. The estimates of the losses within the ocular media fol- low Kraats et al.... ..."

Cited by 2

### Table 5 Sex-specific association results for low-density lipoprotein receptor-related protein 5 block 2 polymorphisms, including empirical global p values for each tag single-nucleotide polymorphism (SNP4, SNP6) and the entire block 2

2006

### Table 1: Table of ve normal densities used to approximate the logistic density

"... In PAGE 17: ... Figure 8 shows that the mixture of normals provides an excellent approximation to (s) and that t8 is a much poorer approximation. Table1 and Figure 8 about here As in section 2, g is estimated by its posterior mean using the Gibbs sampler. Because the algorithms require a Gaussian state space model, it is necessary to introduce the sequence of... In PAGE 18: ... The Ji are independent a priori because the ei are independent. From Table1 , p(Ji = k) = k for k = 1; : : :; 5. 7.... ..."

### Table 1. The boosting-based algorithm for conditional density es- timation.

2002

"... In PAGE 4: ... The result is a new machine-learning algorithm for solving conditional density estimation problems, described in detail in the remainder of this section. Table1 shows pseudo-code for the entire algorithm. Abstractly, we are given pairs #28x 1;y 1#29;:::;#28x m ;y m #29 where each x i belongs to a space X and each y i is in R.... ..."

Cited by 24

### Table 1. Computational results in the sequen- tial algorithm(# of vertices = 200, density =

"... In PAGE 4: ...For all performance evaluations in the following subsec- tions, ten random problem instances with 200 vertices and edge density of 90% are used. Table1 shows the computing time of these problem instances in the sequential branch- and-bound algorithm. 3.... ..."