GeSort - SciStarter
Por um escritor misterioso
Descrição
The GeSort game allows players to help researchers better understand how genomes evolve by solving puzzles of different levels of difficulty. The goal of the game is to transform a mutable row of coloured shapes into a target row with the help of three operations (duplications, deletions and inversions). The rows of coloured shapes represent sequences of genes, and the three possible operations represent biological events known to occur in real genomes. The final score of a puzzle corresponds to the total number of operations applied to the mutable row. Similarly to the game of golf, this must be achieved …
The GeSort game allows players to help researchers better understand how genomes evolve by solving puzzles of different levels of difficulty. The goal of the game is to transform a mutable row of coloured shapes into a target row with the help of three operations (duplications, deletions and inversions). The rows of coloured shapes represent sequences of genes, and the three possible operations represent biological events known to occur in real genomes. The final score of a puzzle corresponds to the total number of operations applied to the mutable row. Similarly to the game of golf, this must be achieved with as few moves as possible! In the area of bioinformatics, this problem is called the genome sorting problem, which is to find the shortest sequence of events that can transform one sequence of genes into another. In addition to helping the research team infer more efficient evolutionary scenarios, players' solutions will eventually lead to the development of better inference algorithms!
The GeSort game allows players to help researchers better understand how genomes evolve by solving puzzles of different levels of difficulty. The goal of the game is to transform a mutable row of coloured shapes into a target row with the help of three operations (duplications, deletions and inversions). The rows of coloured shapes represent sequences of genes, and the three possible operations represent biological events known to occur in real genomes. The final score of a puzzle corresponds to the total number of operations applied to the mutable row. Similarly to the game of golf, this must be achieved with as few moves as possible! In the area of bioinformatics, this problem is called the genome sorting problem, which is to find the shortest sequence of events that can transform one sequence of genes into another. In addition to helping the research team infer more efficient evolutionary scenarios, players' solutions will eventually lead to the development of better inference algorithms!
Dark Sky Missouri
%20(1).png)
Arizona Library Association - 2023 Conference
Northern Express - June 19, 2023 by Northern Express - Issuu
Green for Good – Girl Scouts of Greater Chicago and Northwest Indiana Blog
Nature Story, North Smithfield Library
PDF) The diversity and evolution of ecological and environmental citizen science
Read Wild: Sarah Mulhern Gross Introduces Us to the Concept of Citizen Science
Differential Characteristics and Collaborative Interactions of Institutional and Personal Twitter Accounts in a Citizen Science Context
Paper Collection Reveal: Keeping It Real + GIVEAWAY – Pinkfresh Studio
Arizona Library Association - Conference Program Booklet
Weird But True!
Erica L. Chenoweth - Fishery Biologist II - Alaska Department of Fish and Game
Applying citizen science to monitor for the Sustainable Development Goal Indicator 6.3.2: a review
Profile - SciStarter
Seven citizen science projects to do in the snow!
de
por adulto (o preço varia de acordo com o tamanho do grupo)
