In computational phylogenetics, generalized tree alignment is the problem of producing a multiple sequence alignment and a phylogenetic tree on a set of sequences simultaneously, as opposed to separately.
Formally, Generalized tree alignment is the following optimization problem.
Input: A set formula_1 and an edit distance function formula_2 between sequences,
Output: A tree formula_3 leaf-labeled by formula_1 and labeled with sequences at the internal nodes, such that formula_5 is minimized, where formula_6 is the edit distance between the endpoints of formula_7.
Note that this is in contrast to tree alignment, where the tree is provided as input.
References.
 ;templatestyles src="Reflist/styles.css" / ;