{"id":20380398,"url":"https://github.com/gagniuc/dynamic-block-allocation-algorithm","last_synced_at":"2026-02-27T11:34:19.124Z","repository":{"id":151549581,"uuid":"424249332","full_name":"Gagniuc/Dynamic-Block-Allocation-algorithm","owner":"Gagniuc","description":"The Dynamic Block Allocation algorithm (DBA) represents a flexible method for partitioning string sequences into data blocks taking into account different rules imposed by a function. Two versions of this algorithm are presented, namely DBFA (Double Brute Force Algorithm) and MBFA (Multi Brute Force Algorithm).","archived":false,"fork":false,"pushed_at":"2023-04-03T01:15:20.000Z","size":5953,"stargazers_count":6,"open_issues_count":0,"forks_count":3,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-04T22:25:20.620Z","etag":null,"topics":["algorithm","allocator","block","dynamic","partition","sequences","vb6"],"latest_commit_sha":null,"homepage":"","language":"Visual Basic 6.0","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/Gagniuc.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE.md","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},"funding":{"github":"Gagniuc"}},"created_at":"2021-11-03T14:08:05.000Z","updated_at":"2024-04-28T04:04:25.000Z","dependencies_parsed_at":null,"dependency_job_id":"d8947b20-0f0a-4e92-93f3-6404527d5b89","html_url":"https://github.com/Gagniuc/Dynamic-Block-Allocation-algorithm","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/Gagniuc/Dynamic-Block-Allocation-algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gagniuc%2FDynamic-Block-Allocation-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gagniuc%2FDynamic-Block-Allocation-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gagniuc%2FDynamic-Block-Allocation-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gagniuc%2FDynamic-Block-Allocation-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Gagniuc","download_url":"https://codeload.github.com/Gagniuc/Dynamic-Block-Allocation-algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gagniuc%2FDynamic-Block-Allocation-algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29892152,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-27T09:48:51.284Z","status":"ssl_error","status_checked_at":"2026-02-27T09:48:43.992Z","response_time":57,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithm","allocator","block","dynamic","partition","sequences","vb6"],"created_at":"2024-11-15T02:07:12.800Z","updated_at":"2026-02-27T11:34:19.091Z","avatar_url":"https://github.com/Gagniuc.png","language":"Visual Basic 6.0","readme":"# Dynamic Block Allocation (DBA) algorithm\n\nDynamic Block Allocation Algorithm [\u003ckbd\u003eDouble Brute Force (DBFA)\u003c/kbd\u003e and \u003ckbd\u003eMulti Brute Force (MBFA)\u003c/kbd\u003e]. The \u003ckbd\u003eDynamic Block Allocation (DBA)\u003c/kbd\u003e algorithm represents a flexible method for partitioning string sequences into data blocks taking into account different rules imposed by a function. Two versions of this algorithm are presented, namely \u003ckbd\u003eDBFA\u003c/kbd\u003e (Double Brute Force Algorithm) and \u003ckbd\u003eMBFA\u003c/kbd\u003e (Multi Brute Force Algorithm). These algorithms are originally written in \u003ckbd\u003eVisual Basic 6.0\u003c/kbd\u003e. The ZIP package contains four applications. These applications cover both the experiments performed with this algorithm and a small implementation.\n\n# Screenshot\n\n![screenshot](https://github.com/Gagniuc/Dynamic-Block-Allocation-algorithm/blob/main/ScreenShot/C17.PNG)\n\n![screenshot](https://github.com/Gagniuc/Dynamic-Block-Allocation-algorithm/blob/main/ScreenShot/C20.PNG)\n\n# References\n\n- \u003ci\u003eP. Gagniuc and C. Ionescu-Tirgoviste. Dynamic block allocation for biological sequences. Proc. Rom. Acad., Series B, 2013, 15(3), p. 233-240.\u003c/i\u003e \n","funding_links":["https://github.com/sponsors/Gagniuc"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgagniuc%2Fdynamic-block-allocation-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgagniuc%2Fdynamic-block-allocation-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgagniuc%2Fdynamic-block-allocation-algorithm/lists"}