ACM Balloon Logo
 

2006 South Central USA Regional Programming Contest

Blue Jeans
 
ACM Balloon Logo

 
 Summary
   Problem Set
   Results
   Doc
   Config
 
 Regional
   Welcome
   Rules
   Hints
   Compile Howto
   FAQ
 
 Sites
   ACU
   Baylor
   ECU
   LSU
   UTA
 
 PC^2
   About PC^2
   Documentation
   Local Mirror
 
 ACM
   Intl Prog Contest
   South Central US Regional
   Registration
   
 

Introduction:

The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated.

As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.

A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.

Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.

Input:

Input to this problem will begin with a line containing a single integer n indicating the number of datasets. Each dataset consists of the following components:

  1. A single positive integer m (2 <= m <= 10) indicating the number of base sequences in this dataset.
  2. m lines each containing a single base sequence consisting of 60 bases.

Output:

For each dataset in the input, output the longest base subsequence common to all of the given base sequences. If the longest common subsequence is less than three bases in length, display the string "no significant commonalities" instead. If multiple subsequences of the same longest length exist, output only the subsequence that comes first in alphabetical order.

Sample Input:

3
2
GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
3
GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA
GATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA
GATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA
3
CATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
ACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT

Sample Output:

no significant commonalities
AGATAC
CATCATCAT

   [Printable]
 
 SCUSA Regionals
   2006
   2005
   2004
   2003
   2002
   2001
   2000




The statements and opinions included in these pages are those of Hosts of the South Central USA Regional Programming Contest only. Any statements and opinions included in these pages are not those of Louisiana State University or the LSU Board of Supervisors.
© 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Isaac Traxler