What:
This would be a function that would print the quartets in common for the input trees. The idea is similar to finding the bipartitions needed to compute a strict consensus tree, but instead we're looking for the quartets.
Title:
shared_quartets (could use a better name?)
Input/Output:
It would take a treeset (or pair of trees) and return (via print) the quartets in common for all the trees in the set.
Implementation ideas:
The brute force option is to get the quartets for the first tree, then search for those quartets in the next trees. Remove any quartet from that's not found from the set. The resulting set should be the quartets shared by all the trees.
Possible Variations:
This could work for just two trees or a whole treeset. Both should probably an option.
What: This would be a function that would print the quartets in common for the input trees. The idea is similar to finding the bipartitions needed to compute a strict consensus tree, but instead we're looking for the quartets.
Title: shared_quartets (could use a better name?)
Input/Output: It would take a treeset (or pair of trees) and return (via print) the quartets in common for all the trees in the set.
Implementation ideas: The brute force option is to get the quartets for the first tree, then search for those quartets in the next trees. Remove any quartet from that's not found from the set. The resulting set should be the quartets shared by all the trees.
Possible Variations: This could work for just two trees or a whole treeset. Both should probably an option.