Answer to MG4 comments.

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/gudhi_stat@2314 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: e59312ce2c58d4ac19f2e9d46b7ca4dd29ed8e6e

1 files changed, 1 insertions, 1 deletions

diff --git a/src/Gudhi_stat/doc/gudhi_stat_doc.h b/src/Gudhi_stat/doc/gudhi_stat_doc.h
index 3eb4dff1..cbff56d6 100644
--- a/src/Gudhi_stat/doc/gudhi_stat_doc.h
+++ b/src/Gudhi_stat/doc/gudhi_stat_doc.h
@@ -43,7 +43,7 @@ namespace Gudhi_stat {
  * are different by performing a permutation test.
  *First of all, we compute averages of those two collections: C average of \f$ c_1,\ldots,c_n \f$ and D average of \f$d_1,\ldots,d_n\f$. Note that both C and D are of a type A. Then we compute \f$d(C,D)\f$, 
  * a distance between C and D.
- *Later we put the two collections into one bin:\
+ *Later we put the two collections into one bin:
  *\f[B = \{ c_1,...,c_n,d_1,...,d_n \}\f]
  *Then we shuffle B, and we divide the shuffled version of B into two classes: \f$B_1\f$ and \f$B_2\f$ (in this case, of the same cardinality). Then we compute averages \f$\hat{B_1}\f$ and \f$\hat{B_2}\f$ 
  * of elements in \f$B_1\f$ and \f$B_2\f$. Note that again, \f$\hat{B_1}\f$ and \f$\hat{B_2}\f$ are of a type A.