Generalized tree alignment
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
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.
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1274650450 under CC BY-SA 4.0; modifications have been made.