Skip to content

v4.0.0

Compare
Choose a tag to compare
@wsdewitt wsdewitt released this 01 Mar 03:23
b7d7993

Summary

  • A major enhancement for parsimony tree search is the use of a history DAG to expand the set of trees found by dnapars, often by orders of magnitude. h/t @willdumm
  • Tree ranking can now use a linear combination of branching process likelihood, isotype parsimony, and mutability parsimony (e.g. from a 5mer context model) to score trees.

Backwards-incompatible changes

  • The CollapsedForest class no longer has a trees attribute, as the collection of trees is now represented as a history DAG.
  • The gctree CLI can now accept pickled parsimony forests from the current gctree version, but not from older versions.
  • Only the unique optimal tree is output by gctree infer, if it exists. If more than one tree is optimal, up to 10 will be output arbitrarily, and their numerical rankings will be arbitrary (rather than based on likelihood as before).

Pull requests

Full Changelog: v3.3.0...v4.0.0