As I hinted previously, here is some code I wrote to simplify a Newick tree before parsing it. Given a list of terminal node IDs to keep, this code will process all cherries and recursively remove the terminal nodes that are not needed.
I tried some more complex, more thorough code before, but it was quite slow. However, processing only the cherries is very satisfactory in terms of performance. For example, given 200 input node IDs the large Greengenes tree that never finished parsing was simplified to ~900 nodes. The entire process took less than 1.5 minutes.
Hi Rutger,
As I hinted previously, here is some code I wrote to simplify a Newick tree before parsing it. Given a list of terminal node IDs to keep, this code will process all cherries and recursively remove the terminal nodes that are not needed.
I tried some more complex, more thorough code before, but it was quite slow. However, processing only the cherries is very satisfactory in terms of performance. For example, given 200 input node IDs the large Greengenes tree that never finished parsing was simplified to ~900 nodes. The entire process took less than 1.5 minutes.
Cheers,
Florent