https://github.com/adamserafini/suffix-tree

C++ implementation of Ukkonen's algorithm.
https://github.com/adamserafini/suffix-tree

c-plus-plus graphviz suffix-tree ukkonen-algorithm

Last synced: 16 days ago
JSON representation

C++ implementation of Ukkonen's algorithm.

• Host: GitHub
• URL: https://github.com/adamserafini/suffix-tree
• Owner: adamserafini
• License: mit
• Created: 2012-07-21T11:43:59.000Z (over 12 years ago)
• Default Branch: master
• Last Pushed: 2018-03-05T09:06:53.000Z (almost 7 years ago)
• Last Synced: 2024-12-27T11:54:20.815Z (22 days ago)
• Topics: c-plus-plus, graphviz, suffix-tree, ukkonen-algorithm
• Language: C++
• Homepage:
• Size: 18.8 MB
• Stars: 14
• Watchers: 1
• Forks: 3
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

        
# suffix-tree #

A C++ implementation of [Ukkonen's algorithm for linear-time suffix tree

construction](https://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf).

![Suffix Tree for xabxa$](xabxa$.jpg?raw=true "Suffix Tree for xabxa$")

## Build ##

To build everything simply run `make`.

## Test ##

Tests are written with [bats](https://github.com/sstephenson/bats):

    bats test/tests.bats

## Using ##

The compiled program `suffixtree` takes a single string parameter and outputs

a DOT language (Graphviz) representation of the tree to STDOUT. With

ImageMagick and Graphviz installed you should see a `.jpg` like the above:

    ./suffixtree xabxa$ | dot -Tjpg | display

## License ##

MIT