https://github.com/thsutton/arborism

Some tree algorithms.
https://github.com/thsutton/arborism

Last synced: over 1 year ago
JSON representation

Some tree algorithms.

• Host: GitHub
• URL: https://github.com/thsutton/arborism
• Owner: thsutton
• License: bsd-3-clause
• Created: 2016-05-10T11:30:12.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2017-10-27T02:22:26.000Z (over 8 years ago)
• Last Synced: 2025-02-01T12:25:56.794Z (over 1 year ago)
• Language: Haskell
• Size: 158 KB
• Stars: 2
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
Arborism

========

[![Build status][1]][2]

Arborism is an implementation of tree different algorithms described

in the following papers.

> Zhang and Shasha. 1989. Simple fast algorithms for the editing

> distance between trees and related problems. *SIAM Journal on

> Computing*, Vol. 18, No. 6. https://doi.org/10.1137/0218082

> Dulucq and Touzet. 2003. Analysis of tree edit distance

> algorithms. In: Baeza-Yates R., Chávez E., Crochemore M. (eds)

> *Combinatorial Pattern Matching*. Lecture Notes in Computer Science,

> vol 2676. https://doi.org/10.1007/3-540-44888-8_7

> Demaine, Mozes, Rossman, and Weimann. 2009. An Optimal Decomposition

> Algorithm for Tree Edit Distance. *ACM Transactions on Algorithms*,

> Vol. 6, No. 1. https://doi.org/10.1145/1644015.1644017

[1]: https://travis-ci.org/thsutton/arborism.svg?branch=master

[2]: https://travis-ci.org/thsutton/arborism