An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes

zbMath0529.92001MaRDI QIDQ787893

Neal L. Oden, Kwang-Tsao Shao

Publication date: 1984

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

zbMATH Keywords

labeled terminal nodesunlabeled interior nodes

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08) Other natural sciences (mathematical treatment) (92F05) Software, source code, etc. for problems pertaining to biology (92-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (5)

Nodal distances for rooted phylogenetic trees ⋮ Fast random generation of binary, t-ary and other types of trees ⋮ Generating random binary trees -- a survey ⋮ An algebraic metric for phylogenetic trees ⋮ The generation of random, binary unordered trees

This page was built for publication: An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes