<commit_before># suffix-tree #

A C++ implementation of Ukkonen's algorithm for linear-time suffix tree
construction compiled for JavaScript using Emscripten.

## Prerequisites ##

Compiling for JavaScript requires Emscripten.

## Build ##

To build everything simply run `make`.

## Demo ##

The file `demo.html` opens the compiled `suffix_tree.js` file from the build
step and outputs a suffix tree for `hello_world$` to the console.<commit_msg>Update README.md (formatting) with link to paper<commit_after># suffix-tree #

A C++ implementation of [Ukkonen's algorithm for linear-time suffix tree
construction](https://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf) compiled for JavaScript using Emscripten.

## Prerequisites ##

Compiling for JavaScript requires Emscripten.

## Build ##

To build everything simply run `make`.

## Demo ##

The file `demo.html` opens the compiled `suffix_tree.js` file from the build
step and outputs a suffix tree for `hello_world$` to the console.

## License ##

MIT
{'fraction_non_alphanumeric': 0.09405940594059406, 'fraction_numerical': 0.0009900990099009901, 'mean_word_length': 4.84393063583815, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 1, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5052991', 'n_tokens_mistral': 301, 'n_tokens_neox': 294, 'n_words': 115}