Algorithms comparisons

Natsoulis G, El Ghaoui L, Lanckriet GR, Tolley AM, Leroy F, Dunlea S, et al. Classification of a large microarray data set algorithm comparison and analysis of drug signatures. Genome Res 2005 15 724-36. 

Before proceeding further, it is useful to introduce a simple but powerful notation for integrals and their nth-derivatives. All of the modem integral algorithms can be easily represented within this notation and, of course, uniform descriptions greatly facilitate any algorithmic comparisons which we may make. 

Software has contributed enormously to make static and kinematic positioning more accurate. Long baselines of several thousand kilometers can be determined today with an accuracy of 0.01 ppm and better. In pure kinematic applications the carrier phase ambiguities can be resolved successfully in post-processing algorithms. Comparisons have shown that it is possible to determine relative positions of moving platforms with centimeter accuracy for baselines of tens of kilometers (Baustert et al. 1989). 

Podofillini, L. Zio, E., 2008. Designing a risk-informed balanced system by genetic algorithms Comparison of different balancing criteria. Reliability Engineering and System Safety 2008 93 1842-1852. 

Tompos, A., Margitfalvi, J.L., Tfirst, E. and Vegvdri, L. (2006). Evaluation of catalyst library optimization algorithms Comparison of the holographic research strategy... 

C. I. Pearson, S. Tugendreich, and K. Jarnagin, Genome Res., 15, 724—736 (2005). Classification of a Large Microarray Data Set Algorithm Comparison and Analysis of Drug Signatures. 

A. Rougee, K.M. Hanson, and D. Saint-Felix Comparison of 3D Tomographic Algorithms for Vascular Reconstruction. SPIE Vol. 914 Medical Imaging II, 1988, pp. 397-405. 

The comparison of curve 1 and 2 in Fig. 3 yields, that the convergence with respect to the number of projections k is not strongly influenced by noise because of the properties of the reconstruction algorithm. Nevertheless, the noise increases the asymptotic value of o(n)/0 ... 

Comparison of the measurements with the microdensitometers and the algorithms of calculation inclusive the filter function and the accuracy of measurement of all project partners. 

Esselink, K. A comparison of algorithms for long-range interactions. Comput. Phys. Comm. 87 (1995) 375-395. 

Wisdom, J. The Origin of the Kirkwood Gaps A Mapping for Asteroidal Motion Near the 3/1 Commensurability. Astron. J. 87 (1982) 577-593 Tuckerman, M., Martyna, G. J., Berne, J. Reversible Multiple Time Scale Molecular Dynamics. J. Chem. Phys. 97 (1992) 1990-2001 Tuckerman, M., Berne, J. Vibrational Relaxation in Simple Fluids Comparison of Theory and Simulation. J. Chem. Phys. 98 (1993) 7301-7318 Humphreys, D. D., Friesner, R. A., Berne, B. J. A Multiple-Time Step Molecular Dynamics Algorithm for Macromolecules. J. Chem. Phys. 98 (1994) 6885-6892... 

The comparison For identity of chemical structures is peiTormed on the basis of a hashcode algorithm, Hashcode are unique integer numbers which can be calculated for each chemical structure within the WODCA system [55], Further exam-... 

Figure 10.3-16. The principle of similarity searches. The query (target, precursor) as well as the catalog compound are transformed by the criterion maximum oxidation state". Since the transformation for both compounds results in the samie transformed structure, the catalog compound is presented to the user as a suitable starting material. The comparison of the structure is performed by a hashcode algorithm.

A comparison of fine different conformational searching algorithms. (Data from [Saunders et at 1990].)... 

Snarey M, N K Terrett, P Willett and D J Wilton 1997. Comparison of Algorithms for Dissimilaritj based Compound Selection. Journal of Molecular Graphics and Modelling 15 372-385. 

With the availability of computerized data acquisition and storage it is possible to build database libraries of standard reference spectra. When a spectrum of an unknown compound is obtained, its identity can often be determined by searching through a library of reference spectra. This process is known as spectral searching. Comparisons are made by an algorithm that calculates the cumulative difference between the absorbances of the sample and reference spectra. For example, one simple algorithm uses the following equation... 

A numerical algorithm for the solution of the system of Eqs. (15), (19) and (51) consists of the expansion of the two-particle functions into a Fourier-Bessel series. We omit all the details of the numerical method they can be found in Refs. 55-58, 85, 86. In Fig. 3 we show a comparison of the total... 

---