Gieseking manifold: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
removed incorrect comma
 
en>Café Bene
No edit summary
Line 1: Line 1:
The '''Robinson–Foulds metric''' is a way to measure the distance between unrooted [[phylogenetic trees]]. It is defined as (A + B) where A is the number of partitions of data implied by the first tree but not the second tree and B is the number of partitions of data implied by the second tree but not the first tree.  It is also known as the symmetric difference metric.


==Explanation==


The main advantage of using the blog is that anyone can use the Word - Press blog and customize the elements in the theme regardless to limited knowledge about internet and website development. Thus, it is important to keep pace with this highly advanced age and have a regular interaction with your audience to keep a strong hold in the business market. The effect is to promote older posts by moving them back onto the front page and into the rss feed. If you're using Wordpress and want to make your blog a "dofollow" blog, meaning that links from your blog pass on the benefits of Google pagerank, you can install one of the many dofollow plugins available. If you are happy with your new look then click "Activate 'New Theme'" in the top right corner. <br><br>Luckily, for Word - Press users, WP Touch plugin transforms your site into an IPhone style theme. You may either choose to link only to the top-level category pages or the ones that contain information about your products and services. You are able to set them within your theme options and so they aid the search engine to get a suitable title and description for the pages that get indexed by Google. Furthermore, with the launch of Windows 7 Phone is the smart phone market nascent App. W3C compliant HTML and a good open source powered by Word - Press CMS site is regarded as the prime minister. <br><br>Saying that, despite the launch of Wordpress Express many months ago, there has still been no sign of a Wordpress video tutorial on offer UNTIL NOW. Note:  at a first glance WP Mobile Pro  themes do not appear to be glamorous or fancy. You've got invested a great cope of time developing and producing up the topic substance. These frequent updates have created menace in the task of optimization. Premium vs Customised Word - Press Themes - Premium themes are a lot like customised themes but without the customised price and without the wait. <br><br>You can add keywords but it is best to leave this alone. Russell HR Consulting provides expert knowledge in the practical application of employment law as well as providing employment law training and HR support services. However, you may not be able to find a theme that is in sync with your business. It supports backup scheduling and allows you to either download the backup file or email it to you. OSDI, a Wordpress Development Company  based on ahmedabad, India. <br><br>Internet is not only the source for information, it is also one of the source for passive income. As a website owner, you can easily manage CMS-based website in a pretty easy and convenient style. In simple words, this step can be interpreted as the planning phase of entire PSD to wordpress conversion process. It is a fact that Smartphone using online customers do not waste much of their time in struggling with drop down menus. As with a terminology, there are many methods to understand how to use the terminology In case you have any concerns regarding wherever as well as the way to work with [http://ref.so/p872y wordpress backup], you can e-mail us with our site. .
Given two unrooted trees of nodes and a set of labels (i.e., [[taxa]]) for each node (which could be empty, but only nodes with degree greater than or equal to three can be labeled by an empty set) the Robinson–Foulds metric finds the number of <math>\alpha</math> and <math>\alpha^{-1}</math> operations to convert one into the other. The number of operations defines their distance. The authors define two trees to be the same if they are isomorphic and the isomorphism preserves the labeling. The construction of the proof is based on a function called <math>\alpha</math>, which contracts an edge (combining the nodes, creating a union of their sets). Conversely, <math>\alpha^{-1}</math> expands an edge (decontraction), where the set can be split in any fashion.
 
The <math>\alpha</math> function removes all edges from <math>T_1</math> that are not in <math>T_2</math>, creating <math>T_1 \wedge T_2</math>, and then <math>\alpha^{-1}</math> is used to create edges in <math>T_1 \wedge T_2</math> to build <math>T_2</math>. The number of operations in each of these procedures is equivalent to the number of edges in <math>T_1</math> that are not in <math>T_2</math> plus the number of edges in <math>T_2</math> that are not in <math>T_1</math>. The sum of the operations is equivalent to a transformation from <math>T_1</math> to <math>T_2</math>, or vice versa.
 
==Properties==
 
In their 1981 paper Robinson and Foulds proved that the distance is in fact a [[metric (mathematics)|metric]].
 
===Algorithms for computing the metric===
 
In 1985 Day gave an algorithm based on perfect hashing that computes this distance that has only a linear complexity in the number of nodes in the trees. A randomized algorithm that uses hash tables that are not necessarily perfect has been shown to approximate the Robinson-Foulds distance with a bounded error in sublinear time.
 
===Specific applications===
 
In [[phylogenetics]], the metric is often used to compute a distance between two trees. The treedist program in the [[PHYLIP]] suite offers this function, as does the RAxML_standard package and the DendroPy Python library (under the name "symmetric difference metric"). For comparing groups of trees, the fastest implementations include HashRF and MrsRF.
 
The Robinson–Foulds metric has also been [[Quantitative_comparative_linguistics#Metrics|used in quantitative comparative linguistics]] to compute distances between trees that represent how languages are related to each other.
 
==Further reading==
 
* M. Bourque, Arbres de Steiner et reseaux dont certains sommets sont a localisation variable. PhD thesis, University de Montreal, Montreal, Quebec, 1978 http://www.worldcat.org/title/arbres-de-steiner-et-reseaux-dont-certains-sommets-sont-a-localisation-variable/oclc/053538946
* D. R. Robinson and L. R. Foulds, "Comparison of phylogenetic trees", ''Mathematical Biosciences'', 1981, volume 53, pages 131-147. http://dx.doi.org/10.1016/0025-5564(81)90043-2
* William H. E. Day, "Optimal algorithms for comparing trees with labeled leaves", ''Journal of Classification'', Number 1, December 1985. http://www.springerlink.com/content/q5906x80g44p44k8/
* Nicholas D. Pattengale, Eric J. Gottlieb, Bernard M.E. Moret, "Efficiently Computing the Robinson–Foulds Metric", ''Journal of Computational Biology'', July 2007, 14(6): 724-735. {{doi|10.1089/cmb.2007.R012}}. http://www.liebertonline.com/doi/abs/10.1089/cmb.2007.R012
* J. Sukumaran and Mark T. Holder, "DendroPy: A Python library for phylogenetic computing".  Bioinformatics 26: 1569-1571, 2010.
 
{{DEFAULTSORT:Robinson-Foulds metric}}
[[Category:Computational phylogenetics]]
[[Category:Bioinformatics algorithms]]
[[Category:Taxonomic articles needing attention]]

Revision as of 10:15, 2 February 2014

The Robinson–Foulds metric is a way to measure the distance between unrooted phylogenetic trees. It is defined as (A + B) where A is the number of partitions of data implied by the first tree but not the second tree and B is the number of partitions of data implied by the second tree but not the first tree. It is also known as the symmetric difference metric.

Explanation

Given two unrooted trees of nodes and a set of labels (i.e., taxa) for each node (which could be empty, but only nodes with degree greater than or equal to three can be labeled by an empty set) the Robinson–Foulds metric finds the number of α and α1 operations to convert one into the other. The number of operations defines their distance. The authors define two trees to be the same if they are isomorphic and the isomorphism preserves the labeling. The construction of the proof is based on a function called α, which contracts an edge (combining the nodes, creating a union of their sets). Conversely, α1 expands an edge (decontraction), where the set can be split in any fashion.

The α function removes all edges from T1 that are not in T2, creating T1T2, and then α1 is used to create edges in T1T2 to build T2. The number of operations in each of these procedures is equivalent to the number of edges in T1 that are not in T2 plus the number of edges in T2 that are not in T1. The sum of the operations is equivalent to a transformation from T1 to T2, or vice versa.

Properties

In their 1981 paper Robinson and Foulds proved that the distance is in fact a metric.

Algorithms for computing the metric

In 1985 Day gave an algorithm based on perfect hashing that computes this distance that has only a linear complexity in the number of nodes in the trees. A randomized algorithm that uses hash tables that are not necessarily perfect has been shown to approximate the Robinson-Foulds distance with a bounded error in sublinear time.

Specific applications

In phylogenetics, the metric is often used to compute a distance between two trees. The treedist program in the PHYLIP suite offers this function, as does the RAxML_standard package and the DendroPy Python library (under the name "symmetric difference metric"). For comparing groups of trees, the fastest implementations include HashRF and MrsRF.

The Robinson–Foulds metric has also been used in quantitative comparative linguistics to compute distances between trees that represent how languages are related to each other.

Further reading