<\/figure>\n\n\n\n<\/p>\n\n\n\n
The live scoreboard for one of the challenges at the Copehagen Bioinformatics Hackathon 2021.<\/p>\n\n\n\n
Using GitHub for Automatic Benchmarking<\/h2>\n\n\n\n It was important to get the participants a good start. Jeppe noted, “We created some template code that parsed the data, and a baseline model that made some simple predictions. At the start of the hackathon, all you had to do was to fork the repository to your team’s GitHub account, and then right away, your team had a baseline model that actually worked on real data.” The team also found GitHub Actions to be very useful in simplifying the workflows around the benchmarking. GitHub Actions enables you to identify an action, event or workflow that runs every time you push a new update or write a new line of code. For the hackathon, they defined the action as pushing the results of the code to the BioLib benchmarking server and updating the leaderboard. “Given the short amount of time, we were concerned that this benchmarking system would be too complex to get working. But GitHub Actions made setting up the leaderboard very straightforward,” Jeppe commented. The setup with pre-configured repositories on GitHub, and automated actions for the benchmarking system, were critical components of scaling the hackathon globally. This allowed the hundreds of participants, each with very different backgrounds and skill levels, to make meaningful progress in just two days. Jeppe added, “We tried to make everything pre-configured, so the hackathon teams could just focus on creating the best possible solution for the problem at hand.”<\/p>\n\n\n\n
Going forward<\/h2>\n\n\n\n As the BioLib team thinks about the future, they intend to both scale and refine their approach. “It was great with so many applicants, and we want make sure these challenges are available to anyone that wants to participate. To handle more submissions, we think that it will work better if we have people coming together for a single challenge rather than having an event with nine different challenges running at the same time” suggested J\u00f8rn. He added that “a lot of participants told us they think that a longer event would be better, so we will experiment with challenges running over several weeks, where the teams will have more time to improve their solutions.”<\/p>\n\n\n\n
The BioLib team’s ambition is to continue growing the community, bringing together more hackers, biopharma companies, and universities. They hope the hackathons, in the long run, will encourage development of new and better algorithms and that the benchmarking system they are building will help researchers gauge which algorithms are actually the best ones for a given problem. “For example, perhaps a researcher wants to know, ‘What is the optimal pH for this enzyme?’ The dream is that they can just go to the benchmark page and immediately find out what the best algorithm for that task is, and then run it on their enzyme. It’s just a great way to create scientific progress and awareness, and that’s really what the world needs,” Jeppe said.<\/p>\n","protected":false},"excerpt":{"rendered":"
Biolib is capturing algorithms being developed through GitHub to test ideas in biological sciences, benchmark them, and then make them widely available for others in the field.<\/p>\n","protected":false},"author":1,"featured_media":715,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ms_queue_id":[],"ep_exclude_from_search":false,"_classifai_error":"","_classifai_text_to_speech_error":"","_alt_title":"","ms-ems-related-posts":[],"footnotes":""},"post_tag":[10,11],"content-type":[202],"job-role":[],"topic":[],"coauthors":[546,547,548,549,496,550,509],"class_list":["post-83","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","tag-healthcare","tag-life-sciences","content-type-startup-stories"],"yoast_head":"\n
BioLib and the future of benchmarking for biological data science<\/title>\n \n \n \n \n \n \n \n \n \n \n \n \n \n\t \n\t \n\t \n \n \n \n \n \n \n \n\t \n\t \n\t \n