X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src2%2Ffr%2Forsay%2Flri%2Fvarna%2Fmodels%2Ftreealign%2FTreeAlignLabelDistanceAsymmetric.java;fp=src2%2Ffr%2Forsay%2Flri%2Fvarna%2Fmodels%2Ftreealign%2FTreeAlignLabelDistanceAsymmetric.java;h=0000000000000000000000000000000000000000;hb=a1225b9392dc7657d5cef12907385b07527d6122;hp=91aff2f96d19362af05205b3d04350f2f29bbf34;hpb=b513684c725997c77341f30ce4e584cf9f7cdfed;p=jalview.git

diff --git a/src2/fr/orsay/lri/varna/models/treealign/TreeAlignLabelDistanceAsymmetric.java b/src2/fr/orsay/lri/varna/models/treealign/TreeAlignLabelDistanceAsymmetric.java
deleted file mode 100644
index 91aff2f..0000000
--- a/src2/fr/orsay/lri/varna/models/treealign/TreeAlignLabelDistanceAsymmetric.java
+++ /dev/null
@@ -1,18 +0,0 @@
-package fr.orsay.lri.varna.models.treealign;
-
-public interface TreeAlignLabelDistanceAsymmetric<ValueType1, ValueType2> {
-	/** 
-	 * Returns the substitution cost between v1 and v2.
-	 * We use the convention that a null reference is a blank,
-	 * ie. f(x, null) is the cost of deleting x
-	 * and f(null, x) is the cost of inserting x.
-	 * We won't use f(null, null).
-	 * We suppose f is such that:
-	 * f(x,x) = 0
-	 * 0 <= f(x,y) < +infinity
-	 * You may also want to have the triangle inequality,
-	 * although the alignment algorithm does not require it:
-	 * f(x,z) <= f(x,y) + f(y,z)
-	 */
-	public double f(ValueType1 x, ValueType2 y);
-}