Evaluation of the docking algorithm based on tensor train global optimization
From MaRDI portal
Publication:2806471
Recommendations
- Random drift particle swarm optimisation algorithm for highly flexible protein-ligand docking
- Global optimization of protein-peptide docking by a filling function method
- Docking of atomic clusters through nonlinear optimization
- scientific article; zbMATH DE number 2040776
- Protein-ligand docking based on beta-shape
Cites work
- A Limited Memory Algorithm for Bound Constrained Optimization
- A theory of pseudoskeleton approximations
- Algorithm 778: L-BFGS-B
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- How to find a good submatrix
- Incomplete cross approximation in the mosaic-skeleton method
- TT-cross approximation for multidimensional arrays
- Tensor-train decomposition
- The maximal-volume concept in approximation by low-rank matrices
Cited in
(6)- Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology
- Global optimization based on TT-decomposition
- Protein-ligand docking based on beta-shape
- scientific article; zbMATH DE number 1945163 (Why is no real title available?)
- CBSF: a new empirical scoring function for docking parameterized by weights of neural network
- Random drift particle swarm optimisation algorithm for highly flexible protein-ligand docking
This page was built for publication: Evaluation of the docking algorithm based on tensor train global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806471)
