Difference between revisions of "SPR Supertrees version history"
From Bioinformatics Software
Jump to navigationJump to search (New page: __NOTOC__ ==1.00== * initial program version. * Computes rooted supertrees that minimize the rooted SPR distance using exact calculations or varying levels of approximation. * Optionally...) |
|||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
__NOTOC__ | __NOTOC__ | ||
| + | ==1.2.1== | ||
| + | * Bugfix release | ||
| + | * fixed crash bug that affected some systems/configurations | ||
| − | ==1. | + | ==1.2.0== |
| + | * Faster SPR distance calculations | ||
| + | * LGT analysis options | ||
| + | * Outgroup rooting | ||
| + | * Bipartition Clustering quickly ignores many SPR permutations | ||
| + | * Option to break SPR distance ties with the RF distance | ||
| + | |||
| + | ==1.1.1== | ||
| + | * Bugfix release | ||
| + | * Fixed a coding error that occasionally computed one more than the SPR distance between two trees | ||
| + | |||
| + | ==1.1.0== | ||
| + | * Trees can be multifurcating with -allow_multi option | ||
| + | * Much faster SPR distance calculations | ||
| + | * Many new options including collapsing unsupported bipartitions, fast consideration of unrooted trees with -simple_unrooted option, starting from a specified tree with -initial_tree option, limiting the radius of considered SPR permutations with -r option (-r 1 uses NNI permutations) | ||
| + | |||
| + | ==1.0.0== | ||
* initial program version. | * initial program version. | ||
* Computes rooted supertrees that minimize the rooted SPR distance using exact calculations or varying levels of approximation. | * Computes rooted supertrees that minimize the rooted SPR distance using exact calculations or varying levels of approximation. | ||
* Optionally computes rooted supertrees that minimize the SPR distance to any rooting of a list of unrooted input trees. | * Optionally computes rooted supertrees that minimize the SPR distance to any rooting of a list of unrooted input trees. | ||
* Version used in ''"Subtree Prune-and-Regraft Supertrees."'' | * Version used in ''"Subtree Prune-and-Regraft Supertrees."'' | ||
Latest revision as of 21:50, 3 March 2014
1.2.1
- Bugfix release
- fixed crash bug that affected some systems/configurations
1.2.0
- Faster SPR distance calculations
- LGT analysis options
- Outgroup rooting
- Bipartition Clustering quickly ignores many SPR permutations
- Option to break SPR distance ties with the RF distance
1.1.1
- Bugfix release
- Fixed a coding error that occasionally computed one more than the SPR distance between two trees
1.1.0
- Trees can be multifurcating with -allow_multi option
- Much faster SPR distance calculations
- Many new options including collapsing unsupported bipartitions, fast consideration of unrooted trees with -simple_unrooted option, starting from a specified tree with -initial_tree option, limiting the radius of considered SPR permutations with -r option (-r 1 uses NNI permutations)
1.0.0
- initial program version.
- Computes rooted supertrees that minimize the rooted SPR distance using exact calculations or varying levels of approximation.
- Optionally computes rooted supertrees that minimize the SPR distance to any rooting of a list of unrooted input trees.
- Version used in "Subtree Prune-and-Regraft Supertrees."
