Skip to main content

A python module to read and write the Newick format

Project description

python-newick

Build Status codecov.io PyPI

python package to read and write the Newick format.

Reading Newick

Since Newick specifies a format for a set of trees, all functions to read Newick return a list of newick.Node objects.

  • Reading from a string:

    >>> from newick import loads
    >>> trees = loads('(A,B,(C,D)E)F;')
    >>> trees[0].name
    'F'
    >>> [n.name for n in trees[0].descendants]
    ['A', 'B', 'E']
    
  • Reading from a file-like object:

>>> import io
>>> from newick import load
>>> with io.open('fname', encoding='utf8') as fp:
...     trees = load(fp)
  • Reading from a path:
>>> from newick import read
>>> trees = read('fname')
>>> import pathlib
>>> trees = read(pathlib.Path('fname'))

Writing Newick

In parallel to the read operations there are three functions to serialize a single Node object or a list of Node objects to Newick format:

  • dumps(trees) -> str
  • dump(trees, fp)
  • write(trees, 'fname')

A tree may be assembled using the factory methods of the Node class:

  • Node.__init__
  • Node.create
  • Node.add_descendant

Manipulating trees

  • Diyplaying tree topology in the terminal:
    >>> import newick
    >>> tree = newick.loads('(b,(c,(d,(e,(f,g))h)i)a)')[0]
    >>> print(tree.ascii_art())
        ┌─b
    ────┤
           ┌─c
        └─a─┤
               ┌─d
            └─i─┤
                   ┌─e
                └─h─┤
                       ┌─f
                    └───┤
                        └─g
    
  • Pruning trees: The example below prunes the tree such that b, c and i are the only remaining leafs.
    >>> tree.prune_by_names(['b', 'c', 'i'], inverse=True)
    >>> print(tree.ascii_art())
        ┌─b
    ────┤
           ┌─c
        └─a─┤
            └─i
    
  • Running a callable on a filtered set of nodes:
    >>> tree.visit(lambda n: setattr(n, 'name', n.name.upper()), lambda n: n.name in ['a', 'b'])
    >>> print(tree.ascii_art())
        ┌─B
    ────┤
           ┌─c
        └─A─┤
            └─i
    
  • Removing (topologically) redundant internal nodes:
    >>> tree.prune_by_names(['B', 'c'], inverse=True)
    >>> print(tree.ascii_art())
        ┌─B
    ────┤
        └─A ──c
    >>> tree.remove_redundant_nodes(keep_leaf_name=True)
    >>> print(tree.ascii_art())
        ┌─B
    ────┤
        └─c
    

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

newick-1.2.0.tar.gz (11.7 kB view hashes)

Uploaded Source

Built Distribution

newick-1.2.0-py2.py3-none-any.whl (11.2 kB view hashes)

Uploaded Python 2 Python 3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page