-
Notifications
You must be signed in to change notification settings - Fork 24
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
results produced by ilp_solver #188
Comments
Hi @ask-more-questions -- Can you please provide a small reproducible example? I'd be happy to look into this. -Matt |
Hi Matt, -- Qin |
Hi @ask-more-questions , I have taken a look at your code example and am unable to reproduce the error here. My ILP run was successful, and I could output a newick tree that looks like this (without duplicate leaves, by the look of it):
However, one thing I did notice is that you are passing in
|
Hi Matt Yes, this problem occurs occasionally and i may give the wrong example. I have tried what you suggested. The ilp_solver works all right before and now. The problem is the function cassiopeia_tree.get_newick(). For the updated example this time. sometimes I have the error "Recursion Error: maximum recursion depth exceeded". When this problem happened, i inspected the output cassiopeia tree structure and i found there are some problem in the edge structure which is abnormal for a tree. If you are interested, for this example i give below, please run the code several times without changing anything. the output is not consistent each time. |
Hi Matt, |
Hi,
I used ilp Solver on around 20 taxa dataset. The output from ilp Solver is a Digragh. When i try to export it into a newick fomat. Sometimes it will succeed and sometimes not. I wonder why would this happen?
Another question is , when i have the output as a newick, some subtree/groups of taxa will appear more than once. the itol view will display them randomly. However, how should choose the best tree.
Thank you for your answer.
The text was updated successfully, but these errors were encountered: