rename_nodes

graph

A list of new names, given in the form <code>list(old = "new")</code>. Nodes not listed will keep
their old name, unless no list is given at all, in which case the leaves keep their old
names while the inner nodes get new standardised names.

newnames


Changes the names of the nodes of a graph.
Capable of giving new standard names to the inner nodes in a way that only depends on the graph topology
(without the root) and the leaf names. This is necessary when detecting when graphs are identical up to inner
node and admixture proportion names, see <code><a rd-options="" href="/link/canonise_graph?package=admixturegraph&version=1.0.2" data-mini-rdoc="admixturegraph::canonise_graph">canonise_graph</a></code> and <code><a rd-options="" href="/link/remove_duplicates?package=admixturegraph&version=1.0.2" data-mini-rdoc="admixturegraph::remove_duplicates">remove_duplicates</a></code>.


Implements tools for building and visualising admixture graphs
and for extracting equations from them. These equations can be compared to f-
statistics obtained from data to test the consistency of a graph against data --
for example by comparing the sign of f_4-statistics with the signs predicted by
the graph -- and graph parameters (edge lengths and admixture proportions) can
be fitted to observed statistics.

Thomas Mailund

admixturegraph

Admixture Graph Manipulation and Fitting

rename_nodes function


Changes the names of the nodes of a graph.
Capable of giving new standard names to the inner nodes in a way that only depends on the graph topology
(without the root) and the leaf names. This is necessary when detecting when graphs are identical up to inner
node and admixture proportion names, see <code><a rd-options='' href='canonise_graph'>canonise_graph</a></code> and <code><a rd-options='' href='remove_duplicates'>remove_duplicates</a></code>.


rename_nodes: Rename nodes.

Description

Usage

Arguments

Value