{"id":26162394,"url":"https://github.com/wollmers/p6-lcs-bv","last_synced_at":"2026-02-23T08:33:32.683Z","repository":{"id":143073699,"uuid":"49315920","full_name":"wollmers/P6-LCS-BV","owner":"wollmers","description":"Longest Common Subsequence implemented with Bit-Vectors","archived":false,"fork":false,"pushed_at":"2017-05-16T10:18:31.000Z","size":63,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-26T16:41:49.698Z","etag":null,"topics":["algorithm","bit-vector","lcs","longest-common-subsequence"],"latest_commit_sha":null,"homepage":null,"language":"Perl6","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/wollmers.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}},"created_at":"2016-01-09T07:52:51.000Z","updated_at":"2019-09-04T17:43:23.000Z","dependencies_parsed_at":null,"dependency_job_id":"d3c619ac-6b79-43b5-aadd-8b7495b6dc50","html_url":"https://github.com/wollmers/P6-LCS-BV","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/wollmers/P6-LCS-BV","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FP6-LCS-BV","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FP6-LCS-BV/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FP6-LCS-BV/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FP6-LCS-BV/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wollmers","download_url":"https://codeload.github.com/wollmers/P6-LCS-BV/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FP6-LCS-BV/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29740016,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-23T07:44:07.782Z","status":"ssl_error","status_checked_at":"2026-02-23T07:44:07.432Z","response_time":90,"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","bit-vector","lcs","longest-common-subsequence"],"created_at":"2025-03-11T13:54:16.612Z","updated_at":"2026-02-23T08:33:32.654Z","avatar_url":"https://github.com/wollmers.png","language":"Perl6","funding_links":[],"categories":[],"sub_categories":[],"readme":"NAME\n====\n\nLCS::BV - Bit Vector (BV) implementation of the Longest Common Subsequence (LCS) Algorithm\n\nhtml\n====\n\n\u003ca href=\"https://travis-ci.org/wollmers/P6-LCS-BV\"\u003e\u003cimg src=\"https://travis-ci.org/wollmers/P6-LCS-BV.png\" alt=\"P6-LCS-BV\"\u003e\u003c/a\u003e\n\nSYNOPSIS\n========\n\n      use LCS::BV;\n\n      $lcs = LCS::BV::LCS($a,$b);\n\nABSTRACT\n========\n\nLCS::BV implements the Longest Common Subsequence (LCS) Algorithm and is more than double as fast (Jan 2016) than Algorithm::Diff::LCSidx().\n\nDESCRIPTION\n===========\n\nThis module is a port from the Perl5 module with the same name.\n\nThe algorithm used is based on\n\n    H. Hyyroe. A Note on Bit-Parallel Alignment Computation. In\n    M. Simanek and J. Holub, editors, Stringology, pages 79-87. Department\n    of Computer Science and Engineering, Faculty of Electrical\n    Engineering, Czech Technical University, 2004.\n\nMETHODS\n-------\n\n  * LCS($a,$b)\n\nFinds a Longest Common Subsequence, taking two arrayrefs as method arguments. It returns an array reference of corresponding indices, which are represented by 2-element array refs.\n\nSEE ALSO\n========\n\nAlgorithm::Diff\n\nAUTHOR\n======\n\nHelmut Wollmersdorfer lthelmut.wollmersdorfer@gmail.comgt\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwollmers%2Fp6-lcs-bv","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwollmers%2Fp6-lcs-bv","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwollmers%2Fp6-lcs-bv/lists"}