No description, website, or topics provided.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
win
.gitignore
Makefile
README.md
benchmark
benchmark-results
blumer-blumer.cpp
dawg.hpp
generate-data.cpp
memory.hpp
nodes.hpp

README.md

blumer-blumer-dawg

This is an implementation of the algorithm described in the paper "THE SMALLEST AUTOMATON RECOGNIZING THE SUBWORDS OF A TEXT" from 1985 by A. Blumer, J. Blumer, A. Ehrenfeueht, D. Haussler, M. T. Chen, J. Seiferas.

This serves as the final project for the course "Fast Algorithms on Data Structures" in the Faculty of Mathematics and Informatics at Sofia University, school year 2013-14.

Usage

On Windows/VS2013 - open win\blumer-blumer.sln

On Linux - run make; then ./blumer-blumer some-input-file

License

Released under the MIT License: http://www.opensource.org/licenses/mit-license.php