{"id":18669997,"url":"https://github.com/blahah/graphsample","last_synced_at":"2025-10-17T09:22:02.804Z","repository":{"id":32716918,"uuid":"36306625","full_name":"blahah/graphsample","owner":"blahah","description":"Subsample FASTQ by sampling connected components of a de-Bruijn graph","archived":false,"fork":false,"pushed_at":"2015-06-20T00:27:50.000Z","size":392,"stargazers_count":1,"open_issues_count":1,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2024-12-27T19:13:30.893Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","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/blahah.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}},"created_at":"2015-05-26T15:49:00.000Z","updated_at":"2018-07-28T08:56:52.000Z","dependencies_parsed_at":"2022-09-23T14:18:00.682Z","dependency_job_id":null,"html_url":"https://github.com/blahah/graphsample","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blahah%2Fgraphsample","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blahah%2Fgraphsample/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blahah%2Fgraphsample/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/blahah%2Fgraphsample/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/blahah","download_url":"https://codeload.github.com/blahah/graphsample/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239500974,"owners_count":19649367,"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":[],"created_at":"2024-11-07T08:49:26.091Z","updated_at":"2025-10-17T09:21:57.745Z","avatar_url":"https://github.com/blahah.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# graphsample\n\nSubsample FASTQ by sampling connected components of a de-Bruijn graph\n\nTaking a subsample from a FASTQ can lead to poor coverage of some regions in the subsample, causing the subsample to have informational properties that are not representative of the full read set.\n\n`graphsample` addresses this problem by building a [de-Bruijn graph](http://en.wikipedia.org/wiki/De_Bruijn_graph) from the reads, identifying all the [connected components](http://en.wikipedia.org/wiki/Connected_component_%28graph_theory%29), and randomly sampling those components. It outputs the reads that belong to the sampled components.\n\nWhat's the point? Glad you asked! `graphsample` allows you to take a small subsample from a large set of reads, and use the subsample to optimise the parameters of any tools and algorithms you want to run on the full set.\n\n## Compiling\n\n```bash\n$ git clone --recursive https://github.com/Blahah/graphsample.git\n$ cd graphsample\n$ make\n```\n\n## Running\n\n```bash\n$ bin/graphsample --help\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fblahah%2Fgraphsample","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fblahah%2Fgraphsample","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fblahah%2Fgraphsample/lists"}