You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Many of the trees used with the tree edit distance implementation inside Mastodon are binary trees. For these trees the max flow min cost algorithm can be simplified.
The computation of the Zhang Edit Distance of the trees 2aba and 1bab between timepoints 30 and 350 takes:
both is too long.
The purpose of this ticket is to improve this performance.
Mastodon file containing the two trees (amongst other):
flatSim2_be_2.zip
The SimpleTree implementation is contained in this code example:
https://github.com/mastodon-sc/mastodon-deep-lineage/blob/master/src/test/java/org/mastodon/mamut/treesimilarity/tree/DenseSimpleTreeExamples.java
Tasks
The text was updated successfully, but these errors were encountered: