In the first place, we wish to acknowledge
the contribution to our project of
which allowed to speed up the development of the
atom typing code; thanks to all
developers and in particular to
who merged in real time our changes and additions to the
Next we wish to thank the authors of the two pieces of software that Open3DALIGN
uses to carry out conformational searches and molecular alignment, that is
So, big thanks to
Prof. Jay Ponder
for his kind and prompt feedback and for allowing us to include four programs of the
optimize) in Open3DALIGN.
Thanks also to all
developers at Silicos
and particularly to Gert Thijs with whom we had some nice discussions.
Finally, we wish to cite the authors of some algorithms which either inspired those implemented
or were implemented exactly as in their original formulation
- M. Petitjean for his description of the combined SDM/RMS algorithm
- N. J. Richmond, P. Willett, R. D. Clark for the description of their LAMDA algorithm
- D. E. Stewart and Z. Leyk, for providing inspiration with their
library about how to code an efficient quicksort
- R. Jonker and A. Volgenant for their "Shortest Augmenting Path Algorithm
for Dense and Sparse Linear Assignment Problems" 
Program testing has been carried out taking advantage of the
ShareGrid distributed platform
- Petitjean, M.
- Richmond, N. J.; Willett, P.; Clark, R. D.
J. Mol. Graph. Model.
- Stewart, D. E.; Leyk, Z.
- Matsumoto, M.; Nishimura, T.
ACM Trans. Model. Comput. Simul.
- Jonker, R.; Volgenant, A.
- Anglano, C.; Canonico, M.; Guazzone, M.;
Botta, M.; Rabellino, S.; Arena, S.; Girardi, G.
Proceedings of CCGRID'08,
Lyon (France), IEEE Press.