Cody

Problem 1160. Gene Sequence Contest: Retro

The Full Gene Sequence Rules and examples.

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

54.55% Correct | 45.45% Incorrect
Last solution submitted on Mar 27, 2016
Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!

Join the 15-year community celebration.

Play games and win prizes!

Learn more