Evolutionary algorithms in the optimization of dynamic molecular alignment
✍ Scribed by Ch. Siedschlag; O.M. Shir; Th. Bäck; M.J.J. Vrakking
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 373 KB
- Volume
- 264
- Category
- Article
- ISSN
- 0030-4018
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Automatic identi"cation of sub-structures in multi-aligned sequences is of great importance for e!ective and objective structural/functional domain annotation, phylogenetic treeing and other molecular analyses. We present a segmentation algorithm that optimally partitions a given multi-alignment int
LLOYD ALLISON Department of Computer Science, Monash University, Australia 3168 (Received on 15 December 1992, Accepted in revised form on 10 March 1993) Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting alg
tasks, which results in considerable CPU time savings. This method is based on selectively limiting the calculation of A method of optimizing molecular dynamics calculations is presented. The method employs multiple time steps across the computhe forces and the neighbor list updating, according to t
3D-QSAR uses statistical techniques to correlate calculated structural properties with target properties like biological activity. The comparison of calculated structural properties is dependent upon the relative orientations of molecules in a given data set. Typically molecules are aligned by perfo