{"id":21562072,"url":"https://github.com/adamserafini/suffix-tree","last_synced_at":"2025-04-10T12:07:16.770Z","repository":{"id":4032551,"uuid":"5133220","full_name":"adamserafini/suffix-tree","owner":"adamserafini","description":"C++ implementation of Ukkonen's algorithm.","archived":false,"fork":false,"pushed_at":"2018-03-05T09:06:53.000Z","size":19697,"stargazers_count":14,"open_issues_count":0,"forks_count":3,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-04T14:32:50.024Z","etag":null,"topics":["c-plus-plus","graphviz","suffix-tree","ukkonen-algorithm"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/adamserafini.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2012-07-21T11:43:59.000Z","updated_at":"2024-08-31T21:38:50.000Z","dependencies_parsed_at":"2022-09-16T20:20:23.887Z","dependency_job_id":null,"html_url":"https://github.com/adamserafini/suffix-tree","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/adamserafini%2Fsuffix-tree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adamserafini%2Fsuffix-tree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adamserafini%2Fsuffix-tree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adamserafini%2Fsuffix-tree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/adamserafini","download_url":"https://codeload.github.com/adamserafini/suffix-tree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248217076,"owners_count":21066633,"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":["c-plus-plus","graphviz","suffix-tree","ukkonen-algorithm"],"created_at":"2024-11-24T09:30:08.578Z","updated_at":"2025-04-10T12:07:16.751Z","avatar_url":"https://github.com/adamserafini.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# suffix-tree #\n\nA C++ implementation of [Ukkonen's algorithm for linear-time suffix tree\nconstruction](https://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf).\n\n![Suffix Tree for xabxa$](xabxa$.jpg?raw=true \"Suffix Tree for xabxa$\")\n\n## Build ##\n\nTo build everything simply run `make`.\n\n## Test ##\n\nTests are written with [bats](https://github.com/sstephenson/bats):\n\n    bats test/tests.bats\n\n## Using ##\n\nThe compiled program `suffixtree` takes a single string parameter and outputs\na DOT language (Graphviz) representation of the tree to STDOUT. With\nImageMagick and Graphviz installed you should see a `.jpg` like the above:\n\n    ./suffixtree xabxa$ | dot -Tjpg | display\n\n## License ##\n\nMIT\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadamserafini%2Fsuffix-tree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fadamserafini%2Fsuffix-tree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadamserafini%2Fsuffix-tree/lists"}