2 // FORESTER -- software libraries and applications
3 // for evolutionary biology research and applications.
5 // Copyright (C) 2008-2009 Christian M. Zmasek
6 // Copyright (C) 2008-2009 Burnham Institute for Medical Research
9 // This library is free software; you can redistribute it and/or
10 // modify it under the terms of the GNU Lesser General Public
11 // License as published by the Free Software Foundation; either
12 // version 2.1 of the License, or (at your option) any later version.
14 // This library 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 this library; if not, write to the Free Software
21 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
23 // Contact: phylosoft @ gmail . com
24 // WWW: https://sites.google.com/site/cmzmasek/home/software/forester
26 package org.forester.evoinference.distance;
28 import java.math.RoundingMode;
29 import java.text.DecimalFormat;
30 import java.util.ArrayList;
31 import java.util.List;
33 import org.forester.evoinference.matrix.distance.BasicSymmetricalDistanceMatrix;
34 import org.forester.phylogeny.Phylogeny;
35 import org.forester.phylogeny.PhylogenyNode;
36 import org.forester.util.ForesterUtil;
38 public final class NeighborJoiningX {
40 private BasicSymmetricalDistanceMatrix _d;
41 private double[][] _d_values;
42 private final DecimalFormat _df;
43 private PhylogenyNode[] _external_nodes;
44 private double[][] _m_values;
45 private int[] _mappings;
48 private final boolean _verbose;
50 private NeighborJoiningX() {
55 private NeighborJoiningX( final boolean verbose, final int maximum_fraction_digits_for_distances ) {
56 if ( ( maximum_fraction_digits_for_distances < 1 ) || ( maximum_fraction_digits_for_distances > 9 ) ) {
57 throw new IllegalArgumentException( "maximum fraction digits for distances is out of range: "
58 + maximum_fraction_digits_for_distances );
61 _df = new DecimalFormat();
62 _df.setMaximumFractionDigits( maximum_fraction_digits_for_distances );
63 _df.setRoundingMode( RoundingMode.HALF_UP );
66 public final Phylogeny execute( final BasicSymmetricalDistanceMatrix distance ) {
68 final Phylogeny phylogeny = new Phylogeny();
71 // Calculates the minimal distance.
72 // If more than one minimal distances, always the first found is used
73 // could randomize this, so that any would be returned in a randomized fashion...
74 double minimum = _m_values[ 0 ][ 1 ];
77 for( int j = 1; j < _n; ++j ) {
78 for( int i = 0; i < j; ++i ) {
79 if ( _m_values[ i ][ j ] < minimum ) {
80 minimum = _m_values[ i ][ j ];
86 // It is a condition that otu1 < otu2.
87 final PhylogenyNode node = new PhylogenyNode();
88 final double d = getValueFromD( 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 );
110 final double d = getValueFromD( 0, 1 ) / 2;
112 getExternalPhylogenyNode( 0 ).setDistanceToParent( d );
113 getExternalPhylogenyNode( 1 ).setDistanceToParent( d );
116 final double dd = Double.parseDouble( _df.format( d ) );
117 getExternalPhylogenyNode( 0 ).setDistanceToParent( dd );
118 getExternalPhylogenyNode( 1 ).setDistanceToParent( dd );
120 final PhylogenyNode root = new PhylogenyNode();
121 root.addAsChild( getExternalPhylogenyNode( 0 ) );
122 root.addAsChild( getExternalPhylogenyNode( 1 ) );
124 printProgress( 0, 1 );
126 phylogeny.setRoot( root );
127 phylogeny.setRooted( false );
131 public final List<Phylogeny> execute( final List<BasicSymmetricalDistanceMatrix> distances_list ) {
132 final List<Phylogeny> pl = new ArrayList<Phylogeny>();
133 for( final BasicSymmetricalDistanceMatrix distances : distances_list ) {
134 pl.add( execute( distances ) );
139 private final void calculateDistancesFromNewNode( final int otu1, final int otu2, final double d ) {
140 for( int i = 0; i < _n; ++i ) {
141 if ( ( i == otu1 ) || ( i == otu2 ) ) {
145 _d_values[ _mappings[ otu1 ] ][ _mappings[ i ] ] = ( getValueFromD( otu1, i ) + getValueFromD( i, otu2 ) - d ) / 2;
148 _d_values[ _mappings[ i ] ][ _mappings[ otu1 ] ] = ( getValueFromD( otu1, i ) + getValueFromD( i, otu2 ) - d ) / 2;
153 private final void calculateNetDivergences() {
155 for( int i = 0; i < _n; ++i ) {
157 for( int n = 0; n < _n; ++n ) {
159 d += getValueFromD( i, n );
166 private final PhylogenyNode getExternalPhylogenyNode( final int i ) {
167 return _external_nodes[ _mappings[ i ] ];
170 private final double getValueFromD( final int otu1, final int otu2 ) {
172 return _d_values[ _mappings[ otu2 ] ][ _mappings[ otu1 ] ];
174 return _d_values[ _mappings[ otu1 ] ][ _mappings[ otu2 ] ];
177 private final void initExternalNodes() {
178 _external_nodes = new PhylogenyNode[ _n ];
180 for( int i = 0; i < _n; ++i ) {
181 _external_nodes[ i ] = new PhylogenyNode();
182 id = _d.getIdentifier( i );
184 _external_nodes[ i ].setName( id );
187 _external_nodes[ i ].setName( "" + i );
193 private final void printProgress( final int otu1, final int otu2 ) {
194 final PhylogenyNode n1 = getExternalPhylogenyNode( otu1 );
195 final PhylogenyNode n2 = getExternalPhylogenyNode( otu2 );
196 System.out.println( "Node " + ( ForesterUtil.isEmpty( n1.getName() ) ? n1.getId() : n1.getName() ) + " joins "
197 + ( ForesterUtil.isEmpty( n2.getName() ) ? n2.getId() : n2.getName() ) );
200 // only the values in the lower triangle are used.
201 // !matrix values will be changed!
202 private final void reset( final BasicSymmetricalDistanceMatrix distances ) {
203 _n = distances.getSize();
205 _r = new double[ _n ];
206 _mappings = new int[ _n ];
207 _d_values = _d.getValues();
208 _m_values = new double[ _n ][ _n ];
212 private final void updateM() {
213 calculateNetDivergences();
214 for( int j = 1; j < _n; ++j ) {
215 for( int i = 0; i < j; ++i ) {
216 _m_values[ i ][ j ] = getValueFromD( i, j ) - ( ( _r[ i ] + _r[ j ] ) / ( _n - 2 ) );
221 // otu2 will, in effect, be "deleted" from the matrix.
222 private final void updateMappings( final int otu2 ) {
223 for( int i = otu2; i < ( _mappings.length - 1 ); ++i ) {
224 _mappings[ i ] = _mappings[ i + 1 ];
228 public final static NeighborJoiningX createInstance() {
229 return new NeighborJoiningX();
232 public final static NeighborJoiningX createInstance( final boolean verbose,
233 final int maximum_fraction_digits_for_distances ) {
234 return new NeighborJoiningX( verbose, maximum_fraction_digits_for_distances );