{"id":17335749,"url":"https://github.com/thsutton/arborism","last_synced_at":"2025-03-27T07:23:02.296Z","repository":{"id":66890024,"uuid":"58455759","full_name":"thsutton/arborism","owner":"thsutton","description":"Some tree algorithms.","archived":false,"fork":false,"pushed_at":"2017-10-27T02:22:26.000Z","size":162,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-01T12:25:56.794Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/thsutton.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-05-10T11:30:12.000Z","updated_at":"2022-06-13T14:18:38.000Z","dependencies_parsed_at":"2023-05-28T07:00:29.333Z","dependency_job_id":null,"html_url":"https://github.com/thsutton/arborism","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thsutton%2Farborism","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thsutton%2Farborism/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thsutton%2Farborism/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thsutton%2Farborism/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thsutton","download_url":"https://codeload.github.com/thsutton/arborism/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245798754,"owners_count":20674017,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-15T15:12:02.508Z","updated_at":"2025-03-27T07:23:02.290Z","avatar_url":"https://github.com/thsutton.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"Arborism\n========\n\n[![Build status][1]][2]\n\nArborism is an implementation of tree different algorithms described\nin the following papers.\n\n\u003e Zhang and Shasha. 1989. Simple fast algorithms for the editing\n\u003e distance between trees and related problems. *SIAM Journal on\n\u003e Computing*, Vol. 18, No. 6. https://doi.org/10.1137/0218082\n\n\u003e Dulucq and Touzet. 2003. Analysis of tree edit distance\n\u003e algorithms. In: Baeza-Yates R., Chávez E., Crochemore M. (eds)\n\u003e *Combinatorial Pattern Matching*. Lecture Notes in Computer Science,\n\u003e vol 2676. https://doi.org/10.1007/3-540-44888-8_7\n\n\u003e Demaine, Mozes, Rossman, and Weimann. 2009. An Optimal Decomposition\n\u003e Algorithm for Tree Edit Distance. *ACM Transactions on Algorithms*,\n\u003e Vol. 6, No. 1. https://doi.org/10.1145/1644015.1644017\n\n[1]: https://travis-ci.org/thsutton/arborism.svg?branch=master\n[2]: https://travis-ci.org/thsutton/arborism\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthsutton%2Farborism","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthsutton%2Farborism","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthsutton%2Farborism/lists"}