Skip to content
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

Performance of Zhang Tree Edit Distance #59

Closed
4 tasks done
stefanhahmann opened this issue Nov 27, 2023 · 1 comment · Fixed by #102
Closed
4 tasks done

Performance of Zhang Tree Edit Distance #59

stefanhahmann opened this issue Nov 27, 2023 · 1 comment · Fixed by #102
Assignees

Comments

@stefanhahmann
Copy link
Collaborator

stefanhahmann commented Nov 27, 2023

The computation of the Zhang Edit Distance of the trees 2aba and 1bab between timepoints 30 and 350 takes:

  • with the BranchSpotTree implementation ~60.000ms
  • with the SimpleTree implementation ~25.000ms
    both is too long.
    The purpose of this ticket is to improve this performance.

Mastodon file containing the two trees (amongst other):

Tasks

  • Add the optimization for building the flow network in case of binary trees
  • Do further profiling
  • Add further optimization if possible
  • Find reason, why BranchSpotTree so much slower than SimpleTree implementation
@stefanhahmann
Copy link
Collaborator Author

stefanhahmann commented Apr 17, 2024

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.

20240417_223430

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
1 participant