Package | Description |
---|---|
de.citec.tcs.alignment.forests |
This package contains tree edit distance algorithms for forests.
|
de.citec.tcs.alignment.trees |
This package contains an implementation of the Tree Edit Distance according to Zhang & Shasha (1989).
|
Modifier and Type | Method and Description |
---|---|
CooptimalMatrix<Tree<X>,Tree<Y>> |
UnorderedForestCooptimalAlgorithm.transformToResult(double[][] rep,
double[] del,
double[] ins,
List<Tree<X>> X,
List<Tree<Y>> Y) |
CooptimalMatrix<Tree<X>,Tree<Y>> |
OrderedForestCooptimalAlgorithm.transformToResult(double[][] rep,
double[] del,
double[] ins,
List<Tree<X>> X,
List<Tree<Y>> Y) |
CooptimalMatrix<Tree<X>,Tree<Y>> |
OrderedForestSoftAlgorithm.transformToResult(double[][] rep,
double[] del,
double[] ins,
List<Tree<X>> X,
List<Tree<Y>> Y) |
CooptimalMatrix<Tree<X>,Tree<Y>> |
UnorderedForestSoftAlgorithm.transformToResult(double[][] rep,
double[] del,
double[] ins,
List<Tree<X>> X,
List<Tree<Y>> Y) |
Modifier and Type | Method and Description |
---|---|
Class<CooptimalMatrix> |
UnorderedForestCooptimalAlgorithm.getResultClass() |
Class<CooptimalMatrix> |
OrderedForestCooptimalAlgorithm.getResultClass() |
Class<CooptimalMatrix> |
OrderedForestSoftAlgorithm.getResultClass() |
Class<CooptimalMatrix> |
UnorderedForestSoftAlgorithm.getResultClass() |
Modifier and Type | Method and Description |
---|---|
CooptimalMatrix<Tree<X>,Tree<Y>> |
TreeEditSoftAlgorithm.calculateAlignment(Tree<X> X,
Tree<Y> Y) |
CooptimalMatrix<Tree<X>,Tree<Y>> |
TreeEditCooptimalAlgorithm.calculateAlignment(Tree<X> X,
Tree<Y> Y) |
static <X,Y> CooptimalMatrix<X,Y> |
CooptimalMatrix.fromAlignment(Alignment<X,Y> alignment)
Generates a CooptimalMatrix from a given alignment.
|
static CooptimalMatrix<Integer,Integer> |
TreeEditCooptimalAlgorithm.treeEditCooptimalMatrix(double[][] rep,
double[] del,
double[] ins,
int[] X_r,
int[] Y_r,
int[] X_kr,
int[] Y_kr,
boolean preventTrivialAlignments)
Computes the CooptimalMatrix for the given input trees in their index representation.
|
static CooptimalMatrix<Integer,Integer> |
TreeEditSoftAlgorithm.treeEditSoftMatrix(double[][] rep,
double[] del,
double[] ins,
int[] X_r,
int[] Y_r,
int[] X_kr,
int[] Y_kr,
boolean preventTrivialAlignments,
double crispness)
Computes the CooptimalMatrix for the given input trees in their index representation.
|
Modifier and Type | Method and Description |
---|---|
Class<CooptimalMatrix> |
TreeEditSoftAlgorithm.getResultClass() |
Class<CooptimalMatrix> |
TreeEditCooptimalAlgorithm.getResultClass() |
Copyright (C) 2016-2018 Benjamin Paaßen, AG Theoretical Computer Science, Centre of Excellence Cognitive Interaction Technology (CITEC), University of Bielefeld, licensed under the AGPL v. 3: http://openresearch.cit-ec.de/projects/tcs . This documentation is licensed under the conditions of CC-BY-SA 4.0: https://creativecommons.org/licenses/by-sa/4.0/