Description
This page documents the API for the historydag
package.
The fundamental data structure implemented here is the HistoryDag
.
This data structure provides efficient storage for collections of trees with
internal node labels. In this package, we refer to such a tree as a history.
A history can be represented as a tree-shaped HistoryDag
object.
This package provides functions for:
creating histories from tree data,
merging histories together to create history DAGs,
doing efficient computation on collections of histories stored in history DAGs, and
accessing histories contained in a history DAG, and exporting them to other tree formats.
Classes
Top level classes, promoted from the dag
module.
|
An object to represent a collection of internally labeled trees. |
|
A recursive representation of a history DAG object. |
Functions
Top level functions, promoted from the dag
module.
|
Build a tree-shaped |
|
Return a HistoryDagNode with the given label and clades, with no children. |
|
Make a history DAG using a newick string. |
|
Build a history DAG from a list of newick strings. |
|
Deprecated name for |
|
Build a history DAG from a list of history DAGs which are histories. |
Modules
A module providing the class HistoryDag, and supporting functions. |
|
This module allows the loading and manipulation of Larch mutation annotated DAG protobuf files. |
|
Utility functions and classes for working with HistoryDag objects. |
|
A module implementing Sankoff Algorithm. |
|
This module provides tools for describing and computing parsimony and weighted parsimony, and for describing allowed characters and ambiguity codes. |
|
This module provides a CompactGenome class, intended as a convenient and compact representation of a nucleotide sequence as a collection of mutations relative to a reference sequence. |
|
Functions for manipulating |