You are viewing an old version of this page. View the current version.

Compare with Current View Page History

Version 1 Next »

Description

Computes the number of coalescent scenarios that can explain the incongruence observed between two trees. The trees must be specified int the rich newick format.

Usage

countcoal network_ident1 network_ident2 [result output file]

network_ident1

The name of the first network.

mandatory

network_ident2

The name of the second network.

mandatory

result output file

Optional file destination for command output.

optional

Examples

#NEXUS

BEGIN NETWORKS;

Network net1 = ((a,b),(c,(d,(e,(f,g)))));
Network net2 = ((f,b),(c,(d,(a,(e,g)))));

END;


BEGIN PHYLONET;

countCoal net1 net2;

END;

See Also

  • No labels