This command-line Java program allows users to ‘pare’ down their tree by either removing unwanted leaves (tip-nodes), removing bootstrap information from the tree, or removing branch lengths from the tree – or any combination. Both of these functions can be accomplished in languages like R or Perl, but Java allows very large trees to be pared down quickly, efficiently, and easily!
The program takes Nexus/Newick-style phylogenetic tree code as input that may or may not include bootstraps, and outputs Newick-style trees with the requested nodes and/or bootstrap values removed.
You can read more about the program below ('Program Details') and in the manual ('Program Links').
Remember: Deleting nodes from phylogenies is risky business! See 'Program Details' for more.
Bug? Question? Comments? Feedback form
PLEASE NOTE: I cannot be held responsible for any incorrect behaviour of this program.
Though I try to thoroughly test all my programs, I cannot test them in every conceivable
situation, and so cannot guarantee that it will behave correctly or as predicted at
every execution.
Download Jar File
User Manual
It is worth mentioning that the total root-to-tip distance is kept the same for every leaf after other leaves are deleted. (Non-deleted nodes will have the same total distance to the root as they did before. See the end of the manual for more details.)
Updates Since v1.0.1: (List of previous updates at the bottom of the page)
Reminder:
Deleting nodes from phylogenies is risky business! Deleting nodes is unlikely to give you
the same phylogeny as re-running the tree with the corresponding sequences removed. You could
easily misrepresent your data to yourself and to others by deleting nodes to make a ‘prettier’
picture. Thus, I implore the user to run this program carefully and I do not condone it being
used to intentionally misrepresent data!
Here are a few (safer) situations where this program might be useful:
If you publish or present work that has been processed using this program, please
cite Emma Hodcroft and the website where this program can be downloaded
(http://emmahodcroft.com/PareTree.html).
(I'd also be very interested to hear about what you've used the program for, so feel free to send me a link to your paper/research!)
Bug? Question? Comments? Feedback form
“To iterate is human, to recurse divine.”