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
Solution Comments
Show comments
Loading...
Problem Recent Solvers1
Suggested Problems
-
Swap the first and last columns
22513 Solvers
-
Sum of diagonal of a square matrix
1633 Solvers
-
510 Solvers
-
775 Solvers
-
Find Min and Max Differences in a Vector
48 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!
Error downloading URL
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
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.