Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Distance matrix
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===== Additive tree reconstruction ===== Additive tree reconstruction is based on additive and ultrametric distance matrices. These matrices have a special characteristic: Consider an additive matrix {{Math|M}}. For any three species {{Math|i, j, k,}} the corresponding tree is unique.<ref name=":0" /> Every ultrametric distance matrix is an additive matrix. We can observe this property for the tree below, which consists on the species {{Math|i, j, k}}. [[File:Unique_tree_additive_matrix.png|center|frameless|Phylogenetic tree from 3 species]] The additive tree reconstruction technique starts with this tree. And then adds one more species each time, based on the distance matrix combined with the property mentioned above. For example, consider an additive matrix {{Math|M}} and 5 species {{Math|''a'', ''b'', ''c'', ''d''}} and {{Math|''e''}}. First we form an additive tree for two species {{Math|''a''}} and {{Math|''b''}}. Then we chose a third one, let's say {{Math|''c''}} and attach it to a point {{Math|''x''}} on the edge between {{Math|''a''}} and {{Math|''b''}}. The edge weights are computed with the property above. Next we add the fourth species {{Math|''d''}} to any of the edges. If we apply the property then we identify that {{Math|''d''}} should be attached to only one specific edge. Finally, we add {{Math|''e''}} following the same procedure as before.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)