{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"FastANI","owner":"ParBLiSS","isFork":false,"description":"Fast Whole-Genome Similarity (ANI) Estimation","allTopics":["microbial-genomics"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":3,"issueCount":59,"starsCount":352,"forksCount":63,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-10T20:25:05.891Z"}},{"type":"Public","name":"PairG","owner":"ParBLiSS","isFork":false,"description":"Pairing reads on genome graphs","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":1,"issueCount":0,"starsCount":2,"forksCount":1,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-02T23:52:53.170Z"}},{"type":"Public","name":"kmerhash","owner":"ParBLiSS","isFork":false,"description":"A parallel DNA k-mer counter based on optimized distributed memory hash tables","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":3,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-16T17:54:05.442Z"}},{"type":"Public","name":"Variant_Framework","owner":"ParBLiSS","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-27T08:00:31.130Z"}},{"type":"Public","name":"PaSGAL","owner":"ParBLiSS","isFork":false,"description":"Parallel Sequence to Graph Alignment","allTopics":["variation-graph","alignment-algorithm"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":3,"starsCount":34,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-26T10:55:17.448Z"}},{"type":"Public","name":"refcom","owner":"ParBLiSS","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":1,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-03-08T09:28:24.522Z"}},{"type":"Public","name":"kmerind","owner":"ParBLiSS","isFork":false,"description":"Parallel k-mer indexing for biological sequences","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":12,"forksCount":13,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-12-14T19:30:24.127Z"}},{"type":"Public","name":"psbec","owner":"ParBLiSS","isFork":false,"description":"PSbEC is a parallel spectrum-based error correction software.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-12-05T15:11:27.635Z"}},{"type":"Public","name":"bruno","owner":"ParBLiSS","isFork":false,"description":"Distributed Memory De Bruijn Graph Library","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":2,"starsCount":5,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-08-24T20:50:32.981Z"}},{"type":"Public","name":"par-mhash","owner":"ParBLiSS","isFork":false,"description":"Parallel Locality-Sensitive Hashing based heuristic algorithm to construct overlap graphs for large genomic datasets","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-19T21:45:44.177Z"}},{"type":"Public","name":"read_partitioning","owner":"ParBLiSS","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-08-20T00:12:47.384Z"}},{"type":"Public","name":"parconnect","owner":"ParBLiSS","isFork":false,"description":"Computes graph connectivity for large graphs","allTopics":["graph-algorithms","parallel-algorithm","connected-component-labelling"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":2,"starsCount":11,"forksCount":1,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-01-30T01:12:21.410Z"}},{"type":"Public","name":"psac","owner":"ParBLiSS","isFork":true,"description":"Parallel Suffix Array, LCP Array, and Suffix Tree Construction","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":8,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2016-01-14T17:41:25.272Z"}}],"repositoryCount":13,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}