double averageTreeErrorDistance = 0.0; for (int row = 0; row < numSequences - 1; row++) { String nodeName1 = matrix.getIdentifier(row); PhylogenyNode node1 = externalNodesHashMap.get(nodeName1); markPathToRoot(node1, path); for (int col = row + 1; col < numSequences; col++) { count++; String nodeName2 = matrix.getIdentifier(col); PhylogenyNode node2 = externalNodesHashMap.get(nodeName2); double distance = matrix.getValue(col, row);
double averageTreeErrorDistance = 0.0; for (int row = 0; row < numSequences - 1; row++) { String nodeName1 = matrix.getIdentifier(row); PhylogenyNode node1 = externalNodesHashMap.get(nodeName1); markPathToRoot(node1, path); for (int col = row + 1; col < numSequences; col++) { count++; String nodeName2 = matrix.getIdentifier(col); PhylogenyNode node2 = externalNodesHashMap.get(nodeName2); double distance = matrix.getValue(col, row);
double averageTreeErrorDistance = 0.0; for (int row = 0; row < numSequences - 1; row++) { String nodeName1 = matrix.getIdentifier(row); PhylogenyNode node1 = externalNodesHashMap.get(nodeName1); markPathToRoot(node1, path); for (int col = row + 1; col < numSequences; col++) { count++; String nodeName2 = matrix.getIdentifier(col); PhylogenyNode node2 = externalNodesHashMap.get(nodeName2); double distance = matrix.getValue(col, row);
matrix_0.setValue( 3, 1, 5.0 ); matrix_0.setValue( 2, 3, 6.0 ); if ( !matrix_0.getIdentifier( 0 ).equals( "A" ) ) { return false; if ( !matrix_0.getIdentifier( 1 ).equals( "B" ) ) { return false; if ( !matrix_0.getIdentifier( 2 ).equals( "C" ) ) { return false; if ( !matrix_0.getIdentifier( 3 ).equals( "0123456789012" ) ) { return false;