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!
Profile - SciStarter
Citizen CATE 2024 (Citizen Continental-America Telescopic Eclipse 2024 experiment) - SciStarter
Arizona Library Association - 2023 Conference
Erica L. Chenoweth - Fishery Biologist II - Alaska Department of Fish and Game
The Cincy Shirts Podcast Episode 203: The Best of 2021, Part 1
Here's What's Coming to Disney+ in August! ~ Daps Magic
These Citizen Science Projects are Perfect for a New School Year
Online Update: Vol. 17, No. 7 -- April 5, 2019
Phil Plait (@thebadastronomer) • Instagram photos and videos
Paper Collection Reveal: Keeping It Real + GIVEAWAY – Pinkfresh Studio
Will knowledge in sciences ever become so complex that a college degree won't be sufficient to get a job? - Quora
2023-24 Champion August 1 by Girl Scouts of Wisconsin-Badgerland - Issuu
de
por adulto (o preço varia de acordo com o tamanho do grupo)