Generalized tree alignment

From Wikipedia, the free encyclopedia

You have new messages (last change).
There are very few or no other articles that link to this one.
Please help introduce links in articles on related topics. After links have been created, remove this message.
This article has been tagged since September 2006.

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 S and an edit distance function d between sequences,

Output: A tree T leaf-labeled by S and labeled with sequences at the internal nodes, such that \Sigma_{e \in T} d(e) is minimized, where d(e) is the edit distance between the endpoints of e.

Note that this is in contrast to tree alignment, where the tree is provided as input.


This bioinformatics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "http://en.wikipedia.org../../../g/e/n/Generalized_tree_alignment.html"