Difference between revisions of "Team:FAU Erlangen/Tour25"
Guenter FAU (Talk | contribs) |
Guenter FAU (Talk | contribs) |
||
| Line 2: | Line 2: | ||
<html> | <html> | ||
| + | <h3>The struggle to be unique</h3> | ||
| + | <p> | ||
| + | In order to execute our project, we first needed unique sequences, which are not common or do not appear at all in the yeast stems we use. We needed 10 basepairs that are not present. The first brute force attempt turned out to take approximately 40 days, counting all 4194304 possible combinations throughout the chromosomes. As that was not an option, we needed a faster program that could tell us which sequences are the least common. | ||
| + | There were 2 different approaches. | ||
| + | <ul> | ||
| + | <li> Brute force optimization | ||
| + | <li> Cutting down to solve the specific problem at hand | ||
| + | </ul> | ||
| + | </p> | ||
</html> | </html> | ||
{{FAU_Erlangen_footer}} | {{FAU_Erlangen_footer}} | ||
Revision as of 13:25, 13 September 2015
The struggle to be unique
In order to execute our project, we first needed unique sequences, which are not common or do not appear at all in the yeast stems we use. We needed 10 basepairs that are not present. The first brute force attempt turned out to take approximately 40 days, counting all 4194304 possible combinations throughout the chromosomes. As that was not an option, we needed a faster program that could tell us which sequences are the least common. There were 2 different approaches.
- Brute force optimization
- Cutting down to solve the specific problem at hand