Problem 1160. Gene Sequence Contest: Retro
This Challenge is a replay opportunity of the 2000 GeneSeq Contest.
Brief Challenge statement: Given N segments of equal length, produce a single sequence of minimal length that must contain each individual segment. Repeated segments must occur at least once in the output Sequence. No rotations allowed.
The winning solution superbly exploited the features of strncmp.
Input: Segments % char array (N segments of equal length)
TCGG
GCAG
ATCG
CAGC
AATC
Output: Sequence % char
AATCGGCAGC
Scoring:
10*Time(sec) + 1000 *sum( Total_Lengths(i)/Original_Lengths(i)/Sequences) -1 )
Solution Stats
Problem Comments
-
3 Comments
Binbin Qi
on 8 Nov 2018
Error downloading URL
Anton Kogios
on 7 Oct 2022
There's an error in test 3:
Error using load Unable to read MAT-file /users/mss.system.MreHls/testsuite_GeneSeq_contest.mat. Not a binary MAT-file. Try load -ASCII to read as text. Error in Test3 (line 2) load testsuite_GeneSeq_contest
Michael Sisco
on 19 Jan 2023
It is incredibly annoying to spend time solving a problem, only to find that the test suite is unable to run because of issues outside the submitted function. Fix the test suite or remove the problem.
Solution Comments
Show commentsProblem Recent Solvers1
Suggested Problems
-
3117 Solvers
-
Split a string into chunks of specified length
1843 Solvers
-
767 Solvers
-
1522 Solvers
-
492 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!