Package | Description |
---|---|
de.citec.tcs.alignment |
This module defines the interface for AlignmentAlgorithms as well as some helper classes.
|
de.citec.tcs.alignment.trees |
This package contains an implementation of the Tree Edit Distance according to Zhang & Shasha (1989).
|
de.citec.tcs.alignment.visualization |
This module contains means to visualize Alignments.
|
Constructor and Description |
---|
Operation(Operation<X,Y> copy)
A copy constructor.
|
Constructor and Description |
---|
Alignment(List<Operation<X,Y>> operations,
Comparator<X,Y> comparator,
List<X> left,
List<Y> right,
double distance) |
Modifier and Type | Method and Description |
---|---|
static List<Operation<Integer,Integer>> |
TreeEditFullAlgorithm.treeEditAlignment(double[][] rep,
double[] del,
double[] ins,
int[] X_r,
int[] Y_r,
int[] X_kr,
int[] Y_kr)
Computes the Alignment between two trees which corresponds to the tree edit distance
given pairwise replacement costs between all nodes in both trees, the given deletion costs
for all nodes in the left tree, the insertion costs for all nodes in the right tree, the
outermost right descendant indices for both trees and the key root indices for both trees.
|
Modifier and Type | Method and Description |
---|---|
String |
AbstractHTMLColumn.getHTML(Operation<X,Y> op) |
String |
HTMLColumn.getHTML(Operation<X,Y> op)
This method should return one or multiple td-tags (corresponding to
the return value of getNumColumns()) containing the additional
information for the given alignment Operation.
|
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/