Lesson plan

Generalized tree alignment

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.

Back to article

Article summary

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.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.