{"id":30177535,"url":"https://github.com/feldroop/sais-drum","last_synced_at":"2025-08-12T04:15:08.458Z","repository":{"id":307668298,"uuid":"914038914","full_name":"feldroop/sais-drum","owner":"feldroop","description":"The SAIS suffix array construction algorithm in Rust","archived":false,"fork":false,"pushed_at":"2025-08-08T14:10:57.000Z","size":77,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-08-08T16:09:16.085Z","etag":null,"topics":["algortihm","suffix-array"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/feldroop.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-01-08T20:39:11.000Z","updated_at":"2025-08-08T14:11:01.000Z","dependencies_parsed_at":"2025-08-01T14:39:15.477Z","dependency_job_id":"b858d975-f26d-4108-909e-2dd76bc087ea","html_url":"https://github.com/feldroop/sais-drum","commit_stats":null,"previous_names":["feldroop/sais-drum"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/feldroop/sais-drum","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/feldroop%2Fsais-drum","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/feldroop%2Fsais-drum/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/feldroop%2Fsais-drum/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/feldroop%2Fsais-drum/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/feldroop","download_url":"https://codeload.github.com/feldroop/sais-drum/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/feldroop%2Fsais-drum/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269999608,"owners_count":24509983,"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","status":"online","status_checked_at":"2025-08-12T02:00:09.011Z","response_time":80,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algortihm","suffix-array"],"created_at":"2025-08-12T04:15:05.947Z","updated_at":"2025-08-12T04:15:08.452Z","avatar_url":"https://github.com/feldroop.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🥁 SAIS-drum 🥁\n\nA Rust implementation of the Suffix Array Induced Sort (SAIS) algorithm for [suffix array](https://en.wikipedia.org/wiki/Suffix_array) construction. Inspired by Ilya Grebnov's [`libsais`](https://github.com/IlyaGrebnov/libsais) and based on the following paper:\n\n\u003e G. Nong, S. Zhang and W. H. Chan: _Two Efficient Algorithms for Linear Time Suffix Array Construction_ (2011) DOI: [10.1109/TC.2010.188](https://www.doi.org/10.1109/TC.2010.188)\n\n## State of the implementation\n\nThe algorithm is implemented and tested using [`proptest`](https://github.com/proptest-rs/proptest), but not yet fully optimized. I highly recommend using (bindings to) `libsais` instead. Other Rust solutions include Amos Wenger's port of [`divsufsort`](https://github.com/fasterthanlime/stringsearch/tree/master/crates/divsufsort) and Andrew Gallant's [`suffix`](https://github.com/BurntSushi/suffix) crate.\n\nIn the future, the following optimizations could be added:\n\n- Algorithmic improvements laid out in this paper:\n\n  \u003e N. Timoshevskaya and W. -c. Feng: _SAIS-OPT: On the characterization and optimization of the SA-IS algorithm for suffix array construction_ (2014) DOI: [10.1109/ICCABS.2014.6863917](https://www.doi.org/10.1109/ICCABS.2014.6863917)\n\n- Multithreading, based on this paper:\n\n  \u003e Lao, B., Nong, G., Chan, W.H. et al. : _Fast induced sorting suffixes on a multicore machine_ (2018) DOI: [10.1007/s11227-018-2395-5](https://doi.org/10.1007/s11227-018-2395-5)\n\n- Implementation techniques laid out by Ilya Grebnov in the README of libsais\n- General optimizations such as writing vectorization-friendly code\n- Some of my own ideas that leverage Rust-specific features such as the easy creation of generic code compared to C\n\n## Why drum?\n\nWho doesn't like drums? Also, it's a pretty funny wordplay in German.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffeldroop%2Fsais-drum","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffeldroop%2Fsais-drum","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffeldroop%2Fsais-drum/lists"}