rosalind_common_substring(lcsm).py

# -*- coding: utf-8 -*-
# Diane Kaplan
# Rosalind Problem: finding longest common substring
# http://rosalind.info/problems/lcsm/
# Aug 14, 2015

## Rules:
#Given: A collection of k (k≤100) DNA strings of length at most 1 kbp each in FASTA format.
#Return: A longest common substring of the collection. (If multiple solutions exist, you may return any single solution.)
##    
DEBUG = False

def get_list(string):

    list_of_stuff=[]
    
    return list_of_stuff

    

string= ">Rosalind_1 GATTACA >Rosalind_2 TAGACCA >Rosalind_3 ATACA"



print get_list(string)