fr.orsay.lri.varna.models.treealign
Interface TreeAlignLabelDistanceAsymmetric<ValueType1,ValueType2>

All Known Subinterfaces:

TreeAlignLabelDistanceSymmetric<ValueType>

All Known Implementing Classes:

ExampleDistance2, ExampleDistance3, RNANodeValue2TemplateDistance

public interface TreeAlignLabelDistanceAsymmetric<ValueType1,ValueType2>

Method Summary

double

f(ValueType1 x, ValueType2 y) Returns the substitution cost between v1 and v2.

Method Detail

f

double f(ValueType1 x,
         ValueType2 y)

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)