{"id":19111135,"url":"https://github.com/annapoorna-a-k/motif-discovery_gibbs-sampler-using-python","last_synced_at":"2026-05-18T14:35:35.281Z","repository":{"id":138608332,"uuid":"520196196","full_name":"annapoorna-a-k/MOTIF-DISCOVERY_GIBBS-SAMPLER-using-python","owner":"annapoorna-a-k","description":"Motif Finding using Gibbs Sampler","archived":false,"fork":false,"pushed_at":"2022-08-01T17:22:22.000Z","size":7,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-22T11:25:44.046Z","etag":null,"topics":["gibbs-sampler","gibbs-sampling","gibbs-sampling-algorithm","motif-discovery","motif-finding","python"],"latest_commit_sha":null,"homepage":"","language":"Python","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/annapoorna-a-k.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":"2022-08-01T17:08:05.000Z","updated_at":"2023-11-28T04:21:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"d6e6e2ef-1fad-4782-8b21-c3f458254005","html_url":"https://github.com/annapoorna-a-k/MOTIF-DISCOVERY_GIBBS-SAMPLER-using-python","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/annapoorna-a-k/MOTIF-DISCOVERY_GIBBS-SAMPLER-using-python","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/annapoorna-a-k%2FMOTIF-DISCOVERY_GIBBS-SAMPLER-using-python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/annapoorna-a-k%2FMOTIF-DISCOVERY_GIBBS-SAMPLER-using-python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/annapoorna-a-k%2FMOTIF-DISCOVERY_GIBBS-SAMPLER-using-python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/annapoorna-a-k%2FMOTIF-DISCOVERY_GIBBS-SAMPLER-using-python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/annapoorna-a-k","download_url":"https://codeload.github.com/annapoorna-a-k/MOTIF-DISCOVERY_GIBBS-SAMPLER-using-python/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/annapoorna-a-k%2FMOTIF-DISCOVERY_GIBBS-SAMPLER-using-python/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33181197,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-18T09:27:30.708Z","status":"ssl_error","status_checked_at":"2026-05-18T09:27:28.300Z","response_time":71,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: 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":["gibbs-sampler","gibbs-sampling","gibbs-sampling-algorithm","motif-discovery","motif-finding","python"],"created_at":"2024-11-09T04:27:25.251Z","updated_at":"2026-05-18T14:35:35.252Z","avatar_url":"https://github.com/annapoorna-a-k.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MOTIF-DISCOVERY_GIBBS-SAMPLER-using-python\nGibbs sampling (also called alternating conditional sampling) is a Markov Chain Monte Carlo algorithm for high-dimensional data.\nGibbsSampler is a motif finding algorithm that finds one common motif and returns a list of bestMotifs containing the closest motif match from each string in dna.\n# \u003cstrong\u003eProblem Statement\u003c/strong\u003e\nGiven: Integers k, t, and N, followed by a collection of strings Dna.\u003cbr\u003e\nReturn: The strings BestMotifs resulting from running GibbsSampler(Dna, k, t, N) with 20 random starts.\u003cbr\u003e\u003cbr\u003e\nWe have to code Gibbs Sampler for the purpose of motif discovery. Here,\u003cbr\u003e\n   \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; Dna -- A collection of DNA strings that are of the same length.\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\"t\" -- Is an integer indicating how many times to read the genetic algorithm.\u003cbr\u003e\n   \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; \"k\" -- An integer indicating the motif length being searched for.\u003cbr\u003e\n   \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; \"N\" -- The number of iterations before returning the best motif.\u003cbr\u003e\n    \n# Algorithm\nGibbsSampler (Dna, k , t , N)\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;randomly select k−Mers Motifs = ( Motif 1 , . . . , Motift ) in each string from Dna\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;BestMotifs ←Motifs\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;for j ←1 to N\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;i ← Random ( t )\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;Profile ←profile matrix constructed from all strings in Motifs except for Motifi\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;Motifi ←Profile − randomly generated k-Mer in the i-th sequence\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;if Score ( Motifs ) \u003c Score ( BestMotifs )\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;BestMotifs ←Motifs\u003cbr\u003e\n\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;return BestMotifs \u003cbr\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fannapoorna-a-k%2Fmotif-discovery_gibbs-sampler-using-python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fannapoorna-a-k%2Fmotif-discovery_gibbs-sampler-using-python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fannapoorna-a-k%2Fmotif-discovery_gibbs-sampler-using-python/lists"}