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

4.35% Correct | 95.65% Incorrect
Last Solution submitted on Jan 31, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers1

Suggested Problems

More from this Author296

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!