✦ LIBER ✦

A memory-efficient fast Fourier transformation algorithm for crystallographic refinement on supercomputers

✍ Scribed by Brünger, A. T.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new least-squares refinement technique

✍ Agarwal, R. C. 📂 Article 📅 1980 🏛 International Union of Crystallography ⚖ 70 KB

A method for the extension and refinemen

✍ Barrett, A. N. ;Zwick, M. 📂 Article 📅 1971 🏛 International Union of Crystallography ⚖ 834 KB

Program construction for macromolecule a

✍ Lunin, V. Yu. ;Urzhumtsev, A. G. 📂 Article 📅 1985 🏛 International Union of Crystallography 🌐 English ⚖ 722 KB

Program construction for macromolecule a

✍ Lunin, V. Yu. ;Urzhumstev, A. G. 📂 Article 📅 1986 🏛 International Union of Crystallography 🌐 English ⚖ 118 KB

A fast algorithm for nonequispaced Fouri

✍ Daniel Potts; Jürgen Prestin; Antje Vollrath 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 536 KB

A fast algorithm for three-dimensional e

✍ E. T. Ong; K. H. Lee; K. M. Lim 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB