BSD-3-Clause licensed by Christian Hoener zu Siederdissen
Maintained by [email protected]

Module documentation for

This version can be pinned in stack with:[email protected]:4006ede0492b50cf0ab8ec49166e0ca3553891e61a86841feabc35c914cc2bb5,3315

Build Status


This is a simple parser for Newick trees. The parser returns a rose tree. Each node is labelled with the node name (or an empty string for anonymous nodes) and a distance (0 if not given).

Newick trees can be ex- and imported into the Newick tree format. We also have serialization to the usual serializers.

This package was written mostly to complement a course a Univ. Leipzig. There is a more comprehensive package written by R. Newton which you might want instead.


Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
[email protected]


  • removed most upper bounds

  • initial creation
  • travis-ci integration
  • simple test framework
  • depends on ForestStructures for conversion into efficient static forest