whbrewer / parsimony-spc

This is a basic brute-force algorithm for computing the most parsimonious tree

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

This is a brute force method for computing the most parsimonious tree.

It's based on Section 12.3 of the book:

Deonier, Richard C., Simon Tavaré, and Michael Waterman. Computational genome analysis: an introduction. Springer Science & Business Media, 2005.

About

This is a basic brute-force algorithm for computing the most parsimonious tree


Languages

Language:Python 85.2%Language:Smarty 14.8%