Version 1 (modified by endres, 18 years ago) (diff) |
---|
AlignmentGenerator: PhaseTab Algorithm
Developers: Björn Endres and Malte Kiesel
Description
The PhaseTab algorithm is a generic algorithm that employs an arbitrary number of SimilarityMeasures to generate an alignment. The algorithm was originally developed by Malte Kiesel and Ludger van Elst and has been presented in the paper referenced here. It was then adapted for the PhaseLibs project.
The basic principle of the algorithm is the iterative confirmation of the best ranked relation proposals. This approach makes use of a feature of some SimilarityMeasures, especially the SimilarityFlooding, which increase their precision when given higher confidences on correct relations.
In order to archieve a robust and fair ranking, a BordaCount alogrithm is used to identify the (n) best rated realtion of all SimilarityMeasures involved.
An iteration cycle consists of three phases:
Characteristics
Evaluation/Performance
Specification
Intitialisation
Parameters
none
Dependencies
none
License Issues
TODO