English: Algorithm to reconstruct ancestral sequences (explaining ASR_phylogeny.png).
The ancestral sequence of sequence 1 can be reconstructed from B and C, as well as at least one outgroup, e.g. D or E. For example, sequences B and CC are different in position 4, but since sequences D and E have a C in that position, sequence 1 most likely had a C as well. Ancestral sequences can be reconstructed as long as at least one closely related outgroup sequence is available.
I, the copyright holder of this work, hereby publish it under the following licenses:
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
{{subst:Upload marker added by en.wp UW}} {{Information |Description = {{en|Algorithm to reconstruct ancestral sequences (explaining ASR_phylogeny.png). The ancestral sequence of sequence 1 can be reconstructed from B and C, as well as at least one outgroup, e.g. D or E. For example, sequences B and CC are different in position 4, but since sequences D and E have a C in that position, sequence 1 most likely had a C as well. Ancestral sequences can be reconstructed as long as at least one clo...