{*/

//
package
import
/**
public
* @author
DistanceMatrix.java
terms
-storage
(c)Fills
This
features:
@version
printing
computation
pal.io.*;
pal.misc.*;
java.io.*;
java.text.*;
java.util.*;
class
1999-2001
static
//
}/{/**
public
pal.distance;
package
***
*/
ofof
This
all
for
number
looks
but
constructor
Public
in
Alexei
Korbinian
sequence
constructor
distances
the
$Id:
DistanceMatrix
aall
inDistanceMatrix(DistanceMatrix
fields
backwards
final
int
IdGroup
DistanceMatrix()
DistanceMatrix(double[][]
uses
double[][]
pairwise
class
this.distance
this.idGroup
}nnumSeqs
format
idGroup
the
int
distance
for
super();
may
Lesser
directly
umSeqs
PAL
in
of
DistanceMatrix.java,v
stuff
of
Drummond
numSeqs
the
identifiers
index1,
(int
beidentifiers
PHYLIP
(weighted)
long
sequences.
Development
array...
Strimmer
has
should
[seq1][seq2]
=idGroup;
that
distributed
GNU
*/
taking
=same
distance
}for
index1
compatibility
FormattedOutput.getInstance();
i=dm.format;
adistance
serialVersionUID
at
distance.length;
dm.getIdGroup();
=new
General
format,
hard-coded
takes
index2;
implements
(int
be=double[subset.getIdCount()][subset.getIdCount()];
=size
idGroup.
0;
distances
idGroup;
double[dm.getSize()][dm.getSize()];
squared
=iin
maintained
Should
distance;
distance[i][j]
*/
Core
matrices.<p>
j<aofidGroup.
dm.whichIdNumber(subset.getIdentifier(i).getNam
under
Public
=*/
dm.getSize();
distance
distance.length;
distance
null;
0;Team
serialVersionUID
with
be
distance
1.9
Serializable,
jdistance,
array
the
replaced
License
<=under
2001/07/13
serialized
dm.getSize();
4725925229860707633L;
dm)
matrix
dm,
matrix.
and
=toIdGroup
{the
dm.distance[i][j];
i++)
(LGPL)
by
IdGroup
other
and
same
i++)
IdGroup
method
14:39:13
{objects.
clones
subset)
distance
{name
j++)
*/that
idGroup)
the
korbinian
{ {matrix
distances
distances,
Exp $
e());
for (intindex2
j = 0;=jdm.whichIdNumber(subset.getIdentifier(j
< i; j++) {
).getName());
}/** compute
{public
print
returns
void
String
double
ndouble
format
idGroup
}out.println("
StringWriter
printPHYLIP(new
return
{for
//umSeqs
alignment
PHYLIP
printPHYLIP(PrintWriter
representation
squared
(int
toString()
squaredDistance(DistanceMatrix
=sum
sw.toString();
=for
format.displayLabel(out,
{}oout.print("
idm.format;
ut.println();
distance.length;
subset;
header
=distance
(PHYLIP
(int
sw"iPrintWriter(sw));
0;
=double
distance[j][i]
idGroup.getIdentifier(i).getName(),
//
}o{if
format.displayDecimal(out,
distance[i][j]
{+line
jut.print("
<new
numSeqs);
of
=(j
Chunks
format)
numSeqs;
numSeqs-1;
to
i+1;
0;StringWriter();
this
%diff
second
j6out.println();
out.print("
");
j<==
ofalignment
*/
out)
<numSeqs;
=i++)
06numSeqs;
");
distance[i][j]
distance
i++)
= distance[i][j];
blocks
&&
dm.distance[index1][index2];
j !=mat,
as
j++)
each
j++)
0)matrix
a boolean
string
distance[i][j],
- */
mat.distance[i][j
*/weighted)
");
10); 5);
];
double
{if
(weighted)
weight;
// (variances
weight
Fitch-Margoliash
= 1.0/(distance[i][j]*distance[i]
proportional
weight to distances)
[j]); {public
}/** compute
double
}rdouble
{for
eturn
absolute
(int
absoluteDistance(DistanceMatrix
2.0*sum;
sum
for
{}i =(int
distance
0;
i//
}s{ejum
double
lse
<we
=numSeqs-1;
+=i+1;
counted
to
weight*diff*diff;
diff
//second
weight
Math.abs(distance[i][j]
j(homogeneity
Cavalli-Sforza-Edwards
<= only
numSeqs;
i++)
=distance
1.0;
halfmat)
j++)
the
ofmatrix
variances)
matrix
*/
- mat.distance[i
weight
][j]); public
}//IdGroup
* Returns
**
*/
SetsIdentifier
Adds
int
double[][]
void
double
return
aboth
distance[i][j]
distance[j][i]
double
int
}rfor
eturn
delta
interface
getSize()
the
setDistance(int
addDistance(int
count
(int
upper
meanDistance()
2.0*sum;
number
distance.length;
distances
distance;
mean
dist
to
}for
igetIdentifier(int
=getDistances()
and
=both
=pairwise
/0;
(int
{(double)count;
0;
of+=
0.0;
=lower
//
iupper
}if
sum
rows
as
distance[j][i]
j<delta;
we
=(idistance.length;
a+={distance
i,
triangles.
0;and
counted
2-dimensional
!=int
diff;
jcount
dist
{j)lower
columns
<j,i)
distance[i].length;
{+=of
only
double
+={return
=distance[i][j];
triangle
this
1;dist;
that
half
array
dist)
delta)
i++)
matrix
the
idGroup.getIdentifier(i);
the
distances.
{of{distance
{matrix
doubles.
j++)matrix
{
has.
}
public void setIdentifier(int i, Identifier ident) { idGroup.setIdentifi
er(i, ident);
public}int whichIdNumber(String
getIdCount() { returnname)
idGroup.getIdCount();
{ return idGroup.whichIdNumber(nam
}
e); } {public
/**
**/test
Return
@deprecated
IdGroup
boolean
{}fwhether
for
orid(int
group
distance
getIdGroup()
isSymmetric()
this
if
for
{i =of
(distance[i][i]
(int
matrix
0;
this
imatrix
ifj<alignment.
=(distance[i][j]
{distance.length;
is
distance.length-1;
i+1;
return
anowsymmetric
jimplements
!=<idGroup;
0) return
distance.length;
distance
!=i++)
}IdGroup
distance[j][i])
i++)
false;
matrix
j++) return fal
}se;
}/FormattedOutput
//
/ Private
}return
stufftrue;
format;
}