2 // FORESTER -- software libraries and applications
3 // for evolutionary biology research and applications.
5 // Copyright (C) 2014 Christian M. Zmasek
8 // This library is free software; you can redistribute it and/or
9 // modify it under the terms of the GNU Lesser General Public
10 // License as published by the Free Software Foundation; either
11 // version 2.1 of the License, or (at your option) any later version.
13 // This library is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 // Lesser General Public License for more details.
18 // You should have received a copy of the GNU Lesser General Public
19 // License along with this library; if not, write to the Free Software
20 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
22 // Contact: phylosoft @ gmail . com
23 // WWW: https://sites.google.com/site/cmzmasek/home/software/forester
25 package org.forester.evoinference.distance;
27 import java.math.RoundingMode;
28 import java.text.DecimalFormat;
29 import java.util.ArrayList;
30 import java.util.List;
31 import java.util.Map.Entry;
32 import java.util.SortedSet;
34 import org.forester.evoinference.matrix.distance.BasicSymmetricalDistanceMatrix;
35 import org.forester.phylogeny.Phylogeny;
36 import org.forester.phylogeny.PhylogenyNode;
37 import org.forester.util.ForesterUtil;
39 public final class NeighborJoiningR {
41 private final static DecimalFormat DF = new DecimalFormat( "0.00" );
42 private BasicSymmetricalDistanceMatrix _d;
43 private double[][] _d_values;
44 private final DecimalFormat _df;
45 private PhylogenyNode[] _external_nodes;
46 private int[] _mappings;
49 private final boolean _verbose;
53 private double _d_min; //TODO remove me
55 private NeighborJoiningR() {
60 private NeighborJoiningR( final boolean verbose, final int maximum_fraction_digits_for_distances ) {
61 if ( ( maximum_fraction_digits_for_distances < 1 ) || ( maximum_fraction_digits_for_distances > 9 ) ) {
62 throw new IllegalArgumentException( "maximum fraction digits for distances is out of range: "
63 + maximum_fraction_digits_for_distances );
66 _df = new DecimalFormat();
67 _df.setMaximumFractionDigits( maximum_fraction_digits_for_distances );
68 _df.setRoundingMode( RoundingMode.HALF_UP );
71 public final Phylogeny execute( final BasicSymmetricalDistanceMatrix distance ) {
73 final Phylogeny phylogeny = new Phylogeny();
75 System.out.println( "N=" + _n );
77 // Calculates the minimal distance.
78 // If more than one minimal distances, always the first found is used
79 final double m = updateM();
80 final int otu1 = _min_i;
81 final int otu2 = _min_j;
82 System.out.println( _min_i + " " + _min_j + " => " + DF.format( m ) + " (" + DF.format( _d_min ) + ")" );
83 // It is a condition that otu1 < otu2.
84 //for( int j = 0; j < _s.size(); ++j ) {
85 _s.removePairing( _d_min, _min_i, 1 );
87 final PhylogenyNode node = new PhylogenyNode();
88 final double d = getDvalue( otu1, otu2 );
89 final double d1 = ( d / 2 ) + ( ( _r[ otu1 ] - _r[ otu2 ] ) / ( 2 * ( _n - 2 ) ) );
90 final double d2 = d - d1;
92 getExternalPhylogenyNode( otu1 ).setDistanceToParent( d1 );
93 getExternalPhylogenyNode( otu2 ).setDistanceToParent( d2 );
96 // yes, yes, slow but only grows with n (and not n^2 or worse)...
97 getExternalPhylogenyNode( otu1 ).setDistanceToParent( Double.parseDouble( _df.format( d1 ) ) );
98 getExternalPhylogenyNode( otu2 ).setDistanceToParent( Double.parseDouble( _df.format( d2 ) ) );
100 node.addAsChild( getExternalPhylogenyNode( otu1 ) );
101 node.addAsChild( getExternalPhylogenyNode( otu2 ) );
103 printProgress( otu1, otu2 );
105 calculateDistancesFromNewNode( otu1, otu2, d );
106 _external_nodes[ _mappings[ otu1 ] ] = node;
107 updateMappings( otu2 );
109 System.out.println( "-------------------------------------------------------------" );
110 System.out.println( "" );
112 final double d = getDvalue( 0, 1 ) / 2;
114 getExternalPhylogenyNode( 0 ).setDistanceToParent( d );
115 getExternalPhylogenyNode( 1 ).setDistanceToParent( d );
118 final double dd = Double.parseDouble( _df.format( d ) );
119 getExternalPhylogenyNode( 0 ).setDistanceToParent( dd );
120 getExternalPhylogenyNode( 1 ).setDistanceToParent( dd );
122 final PhylogenyNode root = new PhylogenyNode();
123 root.addAsChild( getExternalPhylogenyNode( 0 ) );
124 root.addAsChild( getExternalPhylogenyNode( 1 ) );
126 printProgress( 0, 1 );
128 phylogeny.setRoot( root );
129 phylogeny.setRooted( false );
133 public final List<Phylogeny> execute( final List<BasicSymmetricalDistanceMatrix> distances_list ) {
134 final List<Phylogeny> pl = new ArrayList<Phylogeny>();
135 for( final BasicSymmetricalDistanceMatrix distances : distances_list ) {
136 pl.add( execute( distances ) );
141 private final void calculateDistancesFromNewNode( final int otu1, final int otu2, final double d ) {
142 for( int i = 0; i < _n; ++i ) {
143 if ( ( i == otu1 ) || ( i == otu2 ) ) {
146 updateDvalue( otu1, otu2, i, d );
150 private final void updateDvalue( final int otu1, final int otu2, final int i, final double d ) {
151 final double new_d = ( getDvalue( otu1, i ) + getDvalue( i, otu2 ) - d ) / 2;
152 _s.addPairing( new_d, otu1, i );
153 setDvalue( otu1, i, new_d );
156 private void setDvalue( final int i, final int j, final double d ) {
158 _d_values[ _mappings[ i ] ][ _mappings[ j ] ] = d;
160 _d_values[ _mappings[ j ] ][ _mappings[ i ] ] = d;
163 private double getDvalue( final int i, final int j ) {
165 return _d_values[ _mappings[ i ] ][ _mappings[ j ] ];
167 return _d_values[ _mappings[ j ] ][ _mappings[ i ] ];
170 private double getDvalueUnmapped( final int i, final int j ) {
172 return _d_values[ i ][ j ];
174 return _d_values[ j ][ i ];
177 private final void calculateNetDivergences() {
178 for( int i = 0; i < _n; ++i ) {
179 _r[ i ] = calculateNetDivergence( i );
183 private double calculateNetDivergence( final int i ) {
185 for( int n = 0; n < _n; ++n ) {
187 d += getDvalue( n, i );
193 private final PhylogenyNode getExternalPhylogenyNode( final int i ) {
194 return _external_nodes[ _mappings[ i ] ];
197 private final void initExternalNodes() {
198 _external_nodes = new PhylogenyNode[ _n ];
200 for( int i = 0; i < _n; ++i ) {
201 _external_nodes[ i ] = new PhylogenyNode();
202 id = _d.getIdentifier( i );
204 _external_nodes[ i ].setName( id );
207 _external_nodes[ i ].setName( Integer.toString( i ) );
213 private final void printProgress( final int otu1, final int otu2 ) {
214 System.out.println( "Node " + printProgressNodeToString( getExternalPhylogenyNode( otu1 ) ) + " joins "
215 + ( printProgressNodeToString( getExternalPhylogenyNode( otu2 ) ) ) );
218 private final String printProgressNodeToString( final PhylogenyNode n ) {
219 if ( n.isExternal() ) {
220 if ( ForesterUtil.isEmpty( n.getName() ) ) {
221 return Long.toString( n.getId() );
227 + ( ForesterUtil.isEmpty( n.getChildNode1().getName() ) ? n.getChildNode1().getId() : n.getChildNode1()
230 + ( ForesterUtil.isEmpty( n.getChildNode2().getName() ) ? n.getChildNode2().getId() : n.getChildNode2()
234 // only the values in the lower triangle are used.
235 // !matrix values will be changed!
236 private final void reset( final BasicSymmetricalDistanceMatrix distances ) {
237 _n = distances.getSize();
239 _r = new double[ _n ];
240 _mappings = new int[ _n ];
241 _d_values = _d.getValues();
243 _s.initialize( distances );
248 final private void printM() {
249 for( int j = 1; j < _n; ++j ) {
250 for( int i = 0; i < _n; ++i ) {
251 System.out.print( DF.format( _d_values[ _mappings[ i ] ][ _mappings[ j ] ] ) );
252 System.out.print( " " );
254 System.out.print( " " );
255 for( final Entry<Integer, SortedSet<Integer>> entry : _s.getSentrySet( _mappings[ j ] ) ) {
256 final double key = entry.getKey();
257 final SortedSet<Integer> value = entry.getValue();
258 System.out.print( DF.format( key / S.FACTOR ) + "=" );
259 boolean first = true;
260 for( final Integer v : value ) {
262 System.out.print( "," );
265 System.out.print( v );
267 System.out.print( " " );
269 System.out.println();
273 private final double updateM() {
275 calculateNetDivergences();
276 Double min = Double.MAX_VALUE;
279 final int n_minus_2 = _n - 2;
280 for( int j = 1; j < _n; ++j ) {
281 final double r_j = _r[ j ];
282 final int m_j = _mappings[ j ];
285 for( final Entry<Integer, SortedSet<Integer>> entry : _s.getSentrySet( m_j ) ) {
286 for( final int sorted_i : entry.getValue() ) {
287 //if ( counter_all >= j ) {
290 if ( _mappings[ counter ] == counter_all ) {
291 System.out.print( sorted_i + " " );
292 System.out.print( "(" + DF.format( getDvalue( sorted_i, j ) ) + ") " );
293 final double m = getDvalue( sorted_i, j ) - ( ( _r[ sorted_i ] + r_j ) / n_minus_2 );
294 if ( ( m < min ) && ( sorted_i != j ) ) {
295 _d_min = getDvalue( sorted_i, j );
305 System.out.println();
307 for( int i = 0; i < j; ++i ) {
308 final double m = getDvalue( i, j ) - ( ( _r[ i ] + r_j ) / n_minus_2 );
311 _d_min = getDvalue( i, j );
317 System.out.println();
321 // otu2 will, in effect, be "deleted" from the matrix.
322 private final void updateMappings( final int otu2 ) {
323 for( int i = otu2; i < ( _mappings.length - 1 ); ++i ) {
324 _mappings[ i ] = _mappings[ i + 1 ];
328 public final static NeighborJoiningR createInstance() {
329 return new NeighborJoiningR();
332 public final static NeighborJoiningR createInstance( final boolean verbose,
333 final int maximum_fraction_digits_for_distances ) {
334 return new NeighborJoiningR( verbose, maximum_fraction_digits_for_distances );