/usr/include/Bpp/Phyl/Distance/NeighborJoining.h is in libbpp-phyl-dev 2.1.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 | //
// File: NeighborJoining.h
// Created by: Julien Dutheil
// Vincent Ranwez
// Created on: Thu jun 23 10:39 2005
//
/*
Copyright or © or Copr. Bio++ Development Team, (November 16, 2004)
This software is a computer program whose purpose is to provide classes
for phylogenetic data analysis.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
#ifndef _NEIGHBORJOINING_H_
#define _NEIGHBORJOINING_H_
#include "AbstractAgglomerativeDistanceMethod.h"
namespace bpp
{
/**
* @brief The neighbor joining distance method.
*
* Reference:
* N Saitou and M Nei (1987), _Molecular Biology and Evolution_ 4(4) 406-25.
*/
class NeighborJoining :
public AbstractAgglomerativeDistanceMethod
{
protected:
std::vector<double> sumDist_;
bool positiveLengths_;
public:
/**
* @brief Create a new NeighborJoining object instance, without performing any computation.
*
* @param rooted Tell if the output tree should be rooted.
* @param positiveLengths Tell if negative lengths should be avoided.
* @param verbose Allow to display extra information, like progress bars.
*/
NeighborJoining(bool rooted = false, bool positiveLengths = false, bool verbose = true) :
AbstractAgglomerativeDistanceMethod(verbose, rooted),
sumDist_(),
positiveLengths_(false)
{}
/**
* @brief Create a new NeighborJoining object instance and compute a tree from a distance matrix.
*
* @param matrix Input distance matrix.
* @param rooted Tell if the output tree should be rooted.
* @param positiveLengths Tell if negative lengths should be avoided.
* @param verbose Allow to display extra information, like progress bars.
*/
NeighborJoining(const DistanceMatrix& matrix, bool rooted = false, bool positiveLengths = false, bool verbose = true) throw (Exception) :
AbstractAgglomerativeDistanceMethod(matrix, verbose, rooted),
sumDist_(),
positiveLengths_(positiveLengths)
{
sumDist_.resize(matrix.size());
computeTree();
}
virtual ~NeighborJoining() {}
NeighborJoining* clone() const { return new NeighborJoining(*this); }
public:
std::string getName() const { return "NJ"; }
virtual void setDistanceMatrix(const DistanceMatrix& matrix)
{
AbstractAgglomerativeDistanceMethod::setDistanceMatrix(matrix);
sumDist_.resize(matrix.size());
}
virtual void outputPositiveLengths(bool yn) { positiveLengths_ = yn; }
protected:
std::vector<size_t> getBestPair() throw (Exception);
std::vector<double> computeBranchLengthsForPair(const std::vector<size_t>& pair);
double computeDistancesFromPair(const std::vector<size_t>& pair, const std::vector<double>& branchLengths, size_t pos);
void finalStep(int idRoot);
};
} //end of namespace bpp.
#endif //_NEIGHBORJOINING_H_
|