2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2011,2012,2013,2014,2015, by the GROMACS development team, led by
5 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
6 * and including many others, as listed in the AUTHORS file in the
7 * top-level source directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
39 #include <gromacs/trajectoryanalysis.h>
40 #include <gromacs/math/do_fit.h>
41 #include <gromacs/utility/smalloc.h>
42 #include "gromacs/selection/selection.h"
43 #include "gromacs/selection/selectionoption.h"
47 struct kernel_maxima {
50 std::vector< RVec > krnl;
53 long double Fx (long double x0, long double y0, long double z0, long double p1, long double p2, long double p3, std::vector< RVec > x) {
55 for (int i = 0; i < x.size(); i++) {
57 sqrt ( pow (p2 * (x[i][2] - z0) - p3 * (x[i][1] - y0), 2) +
58 pow (p3 * (x[i][0] - x0) - p1 * (x[i][2] - z0), 2) +
59 pow (p1 * (x[i][1] - y0) - p2 * (x[i][0] - x0), 2)) /
60 sqrt (p1 * p1 + p2 * p2 + p3 * p3);
65 long double fx0 (long double x0, long double y0, long double z0, long double p1, long double p2, long double p3, std::vector< RVec > x) {
67 for (int i = 0; i < x.size(); i++) {
69 (2 * p2 * (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1])) + 2 * p3 * (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]))) /
70 (2 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
71 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
72 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2)) *
73 sqrt (p1 * p1 + p2 * p2 + p3 * p3));
78 long double fy0 (long double x0, long double y0, long double z0, long double p1, long double p2, long double p3, std::vector< RVec > x) {
80 for (int i = 0; i < x.size(); i++) {
82 -(2 * p1 * (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1])) - 2 * p3 * (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]))) /
83 (2 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
84 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
85 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2)) *
86 sqrt (p1 * p1 + p2 * p2 + p3 * p3));
91 long double fz0 (long double x0, long double y0, long double z0, long double p1, long double p2, long double p3, std::vector< RVec > x) {
93 for (int i = 0; i < x.size(); i++) {
95 -(2 * p1 * (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2])) + 2 * p2 * (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]))) /
96 (2 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
97 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
98 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2)) *
99 sqrt (p1 * p1 + p2 * p2 + p3 * p3));
104 long double fp1 (long double x0, long double y0, long double z0, long double p1, long double p2, long double p3, std::vector< RVec > x) {
106 for (int i = 0; i < x.size(); i++) {
108 -(2 * (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1])) * (y0 - x[i][1]) + 2 * (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2])) * (z0 - x[i][2])) /
109 (2 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
110 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
111 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2)) *
112 sqrt (p1 * p1 + p2 * p2 + p3 * p3)) -
113 (p1 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
114 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
115 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2))) /
116 pow (p1 * p1 + p2 * p2 + p3 * p3, 1.5);
121 long double fp2 (long double x0, long double y0, long double z0, long double p1, long double p2, long double p3, std::vector< RVec > x) {
123 for (int i = 0; i < x.size(); i++) {
125 (2 * (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1])) * (x0 - x[i][0]) - 2 * (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2])) * (z0 - x[i][2])) /
126 (2 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
127 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
128 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2)) *
129 sqrt (p1 * p1 + p2 * p2 + p3 * p3)) -
130 (p2 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
131 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
132 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2))) /
133 pow (p1 * p1 + p2 * p2 + p3 * p3, 1.5);
138 long double fp3 (long double x0, long double y0, long double z0, long double p1, long double p2, long double p3, std::vector< RVec > x) {
140 for (int i = 0; i < x.size(); i++) {
142 (2 * (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2])) * (x0 - x[i][0]) + 2 * (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2])) * (y0 - x[i][1])) /
143 (2 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
144 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
145 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2)) *
146 sqrt (p1 * p1 + p2 * p2 + p3 * p3)) -
147 (p3 * sqrt ( pow (p2 * (x0 - x[i][0]) - p1 * (y0 - x[i][1]), 2) +
148 pow (p3 * (x0 - x[i][0]) - p1 * (z0 - x[i][2]), 2) +
149 pow (p3 * (y0 - x[i][1]) - p2 * (z0 - x[i][2]), 2))) /
150 pow (p1 * p1 + p2 * p2 + p3 * p3, 1.5);
155 void linear_kernel_search (long double &x0, long double &y0, long double &z0, long double &p1, long double &p2, long double &p3, std::vector< RVec > x, long double epsi) {
156 long double FX = 0, FX0 = 0, FY0 = 0, FZ0 = 0, FP1 = 0, FP2 = 0, FP3 = 0;
157 long double L1, L2, L3, L4, L5, L6;
160 FX = Fx(x0, y0, z0, p1, p2, p3, x);
161 FX0 = fx0(x0, y0, z0, p1, p2, p3, x);
162 FY0 = fy0(x0, y0, z0, p1, p2, p3, x);
163 FZ0 = fz0(x0, y0, z0, p1, p2, p3, x);
164 FP1 = fp1(x0, y0, z0, p1, p2, p3, x);
165 FP2 = fp2(x0, y0, z0, p1, p2, p3, x);
166 FP3 = fp3(x0, y0, z0, p1, p2, p3, x);
169 while (Fx(x0 - L1 * FX0, y0, z0, p1, p2, p3, x) - FX > 0) {
171 if (x0 - L1 * FX0 < epsi) {
176 while (Fx(x0, y0 - L2 * FY0, z0, p1, p2, p3, x) - FX > 0) {
178 if (y0 - L2 * FY0 < epsi) {
183 while (Fx(x0, y0, z0 - L3 * FZ0, p1, p2, p3, x) - FX > 0) {
185 if (z0 - L3 * FZ0 < epsi) {
190 while (Fx(x0, y0, z0, p1 - L4 * FP1, p2, p3, x) - FX > 0) {
192 if (p1 - L4 * FP1 < epsi) {
197 while (Fx(x0, y0, z0, p1, p2 - L5 * FP2, p3, x) - FX > 0) {
199 if (p2 - L5 * FP2 < epsi) {
204 while (Fx(x0, y0, z0, p1, p2, p3 - L6 * FP3, x) - FX > 0) {
206 if (p3 - L6 * FP3 < epsi) {
210 std::cout << FX - Fx(x0 - L1 * FX0, y0 - L2 * FY0, z0 - L3 * FZ0, p1 - L4 * FP1, p2 - L5 * FP2, p3 - L6 * FP3, x) << " ";
211 if (FX - Fx(x0 - L1 * FX0, y0 - L2 * FY0, z0 - L3 * FZ0, p1 - L4 * FP1, p2 - L5 * FP2, p3 - L6 * FP3, x) > epsi) {
224 //std::cout << count << "\n";
227 RVec kernel_pro (double x0, double y0, double z0, double p1, double p2, double p3, RVec x) {
228 double lambda = (p1 * (x[0] - x0) + p2 * (x[1] - y0) + p3 * (x[2] - z0)) / (p1 * p1 + p2 * p2 + p3 * p3);
230 pro[0] = x0 + p1 * lambda;
231 pro[1] = y0 + p2 * lambda;
232 pro[2] = z0 + p3 * lambda;
236 double left_right_turn (RVec a, RVec b, RVec c) {
237 return a[0] * b[1] * c[2] + a[1] * b[2] * c[0] + b[0] * c[1] * a[2] -
238 (a[2] * b[1] * c[0] + a[0] * b[2] * c[1] + a[1] * b[0] * c[2]);
242 * Template class to serve as a basis for user analysis tools.
244 class Spirals : public TrajectoryAnalysisModule
249 virtual void initOptions(IOptionsContainer *options,
250 TrajectoryAnalysisSettings *settings);
251 virtual void initAnalysis(const TrajectoryAnalysisSettings &settings,
252 const TopologyInformation &top);
254 virtual void analyzeFrame(int frnr, const t_trxframe &fr, t_pbc *pbc,
255 TrajectoryAnalysisModuleData *pdata);
257 virtual void finishAnalysis(int nframes);
258 virtual void writeOutput();
267 AnalysisNeighborhood nb_;
270 AnalysisDataAverageModulePointer avem_;
274 double epsi = 0.00001;
276 std::vector< std::vector< RVec > > monomers;
277 std::vector< kernel_maxima > kernel;
278 std::vector< std::vector< std::vector< int > > > circles;
284 registerAnalysisDataset(&data_, "avedist");
288 Spirals::initOptions(IOptionsContainer *options,
289 TrajectoryAnalysisSettings *settings)
291 static const char *const desc[] = {
292 "Analysis tool for finding molecular core."
295 // Add the descriptive text (program help text) to the options
296 settings->setHelpText(desc);
297 // Add option for output file name
298 options->addOption(FileNameOption("on").filetype(eftIndex).outputFile()
299 .store(&fnNdx_).defaultBasename("rcore")
300 .description("Index file from the rcore"));
301 // Add option for selection list
302 options->addOption(SelectionOption("select").storeVector(&sel_)
303 .required().dynamicMask().multiValue()
304 .description("Position to calculate distances for"));
307 // -s '/home/toluk/Develop/samples/reca_rd/reca_rd.mono.tpr' -f '/home/toluk/Develop/samples/reca_rd/reca_rd.mono.xtc' -n '/home/toluk/Develop/samples/reca_rd/test.ndx' -on '/home/toluk/Develop/samples/reca_rd/core.ndx'
310 Spirals::initAnalysis(const TrajectoryAnalysisSettings &settings,
311 const TopologyInformation & /*top*/)
319 Spirals::analyzeFrame(int frnr, const t_trxframe &fr, t_pbc *pbc,
320 TrajectoryAnalysisModuleData *pdata)
322 const SelectionList &sel = pdata->parallelSelections(sel_);
323 std::vector< RVec > temp;
324 temp.resize(sel_.size());
325 for (int i = 0; i < sel.size(); i++) {
326 copy_rvec(sel[i].position(0).x(), temp[i]);
329 monomers.resize(monomers.size() + 1);
330 for (int i = 0; i < sel.size(); i++) {
331 monomers.back().push_back(temp[i]);
344 for (int i = 0; i < sel.size(); i++) {
345 rvec_inc(temp[i], mid);
347 mid[0] /= sel.size();
348 mid[1] /= sel.size();
349 mid[2] /= sel.size();
350 rvec_sub(temp.back(), temp.front(), arrow);
352 long double t1, t2, t3, t4, t5, t6;
360 //linear_kernel_search(mid[0], mid[1], mid[2], arrow[0], arrow[1], arrow[2], temp, epsi); //изменить формат функции для изменения значений переменных
361 linear_kernel_search(t1, t2, t3, t4, t5, t6, temp, epsi);
363 //std::cout << t1 << " " << t2 << " " << t3 << " " << t4 << " " << t5 << " " << t6 << "\n";
372 kernel.resize(kernel.size() + 1);
373 kernel.back().x = mid;
374 kernel.back().p = arrow;
375 for (int i = 0; i < sel.size(); i++) {
376 kernel.back().krnl.push_back(kernel_pro(mid[0], mid[1], mid[2], arrow[0], arrow[1], arrow[2], temp[i]));
379 /*circles.resize(circles.size() + 1);
381 int prev_sign = -9999, change = 0;
383 rvec_sub(temp[0], kernel.back().krnl.front(), a);
384 rvec_sub(kernel.back().krnl.front(), kernel.back().krnl.back(), b);
385 for (int i = 1; i < sel.size(); i++) {
386 rvec_sub(temp[i], kernel.back().krnl[i], c);
387 if (std::signbit(left_right_turn(a, b, c)) != prev_sign) {
389 prev_sign == std::signbit(left_right_turn(a, b, c));
392 if (circles.back().size() == 0) {
393 circles.back().resize(1);
395 circles.back().back().push_back(i);
397 circles.back().resize(circles.back().size() + 1);
398 circles.back().back().push_back(i);
407 Spirals::finishAnalysis(int /*nframes*/)
413 file = std::fopen("linear_kernel.txt", "w+");
414 for (int i = 0; i < kernel.size(); i++) {
415 for (int j = 0; j < monomers[i].size(); j++) {
416 std::fprintf(file, "%3.2f %3.2f %3.2f\n", monomers[i][j][0], monomers[i][j][1], monomers[i][j][2]);
418 for (int j = 0; j < kernel[i].krnl.size(); j++) {
419 std::fprintf(file, "%3.2f %3.2f %3.2f\n", kernel[i].krnl[j][0], kernel[i].krnl[j][1], kernel[i].krnl[j][2]);
421 std::fprintf(file, "\n");
429 file = std::fopen("spiral_dist.txt", "w+");
430 for (int i = 0; i < spiral_dist.size(); i++) {
431 for (int j = 0; j < spiral_dist[i].size(); j++) {
432 std::fprintf(file, "%3.2Lf\n", spiral_dist[i][j]);
434 std::fprintf(file, "\n");
440 Spirals::writeOutput()
446 * The main function for the analysis template.
449 main(int argc, char *argv[])
451 return gmx::TrajectoryAnalysisCommandLineRunner::runAsMain<Spirals>(argc, argv);