A citizen science approach for sorting genomes
Bibliographic record
Abstract
The development of citizen science games requires the implementation of different game mechanics to make them challenging, interesting and motivating. These mechanics are often borrowed from commercial video games, but their outcome on the quality of solutions obtained and player motivation are not fully understood. Citizen science games can be used to solve complex scientific problems. Genome sorting is such a complex problem in genomics which is to find the shortest number of events for transforming one genome to another. Through solving this genome sorting problem we can also learn much about genome evolution. However, the presence of duplicate genes in the genomes makes this problem NP-hard. In this thesis, we propose a citizen science game GeSort which aims at solving the genome sorting problem even in the presence of duplicate genes. Through this game we also analyze the effect of showing a timer, an achievable (top) score and a live leaderboard on players’ scores, puzzle completion time and motivation using different versions of our citizen science game GeSort.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.011 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".