unrooted tree
Смотреть что такое "unrooted tree" в других словарях:
Unrooted tree path lengths — In computer science, the problem of unrooted tree path lengths is that of finding the number of paths of each length in a tree.It is known that no algorithm can solve it in less than O( n 2) asymptotic time.Fact|date=February 2008 … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Tree bog — A Treebog is a form of compost toilet which has willows, nettles and other nutrient hungry plants planted around it. The faeces are held in a chamber open to the air which allows it to decompose rapidly, feeding the trees around it. Unlike a… … Wikipedia
Phylogenetic tree — ptree redirects here. For Patricia tree, see Radix tree … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
PQ tree — A PQ tree is a tree based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and George S. Lueker in 1976. It is a rooted, labeled tree, in which each element is represented by… … Wikipedia
Computational phylogenetics — is the application of computational algorithms, methods and programs to phylogenetic analyses. The goal is to assemble a phylogenetic tree representing a hypothesis about the evolutionary ancestry of a set of genes, species, or other taxa. For… … Wikipedia
Newick format — In mathematics, Newick tree format (or Newick notation or New Hampshire tree format) is a way to represent graph theoretical trees with edge lengths using parentheses and commas. It was adopted by James Archie, William H. E. Day, Joseph… … Wikipedia
Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… … Wikipedia
Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… … Wikipedia
Neighbor joining — This genetic distance map made in 2002 is an estimate of 18 world human groups by a neighbour joining method based on 23 kinds of genetic information. It was made by Saitou Naruya (斎藤成也? … Wikipedia
