## 612 - DNA Sorting

Moderator: Board moderators

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

### Re: Help!612 WA!why?

Don't print a blank line at the start of the output.
Check input and AC output for thousands of problems on uDebug!

dennisorz
New poster
Posts: 9
Joined: Wed Aug 14, 2013 6:04 pm

### Re: Help!612 WA!why?

A same

Code: Select all

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<vector>
using namespace std;
vector<char> DNA[101];
int rank[100][2];
void initial(int n,int m){
for(int i=0;i<m;i++){
rank[i][0]=0;
rank[i][1]=i;
}
for(int j=0;j<m;j++)
DNA[j].clear();
}
void func(int n,int m){
int count=0;
for(int i=0;i<m;i++){
for(int x=0;x<n;x++){
for(int y=x+1;y<n;y++){
if((int)DNA[i][x]>(int)DNA[i][y])
count++;
}
}
rank[i][0]=count;
count=0;
}
}
void bubblesort(int n)
{
int i, j, temp, a;
for (i = n - 1; i > 0; i--)
{
for (j = 0; j <= i - 1; j++)
{
if (rank[j][0] > rank[j + 1][0])
{
temp = rank[j][1];
a	 = rank[j][0];
rank[j][1] = rank[j + 1][1];
rank[j][0] = rank[j + 1][0];
rank[j + 1][1] = temp;
rank[j + 1][0] = a;
}
}
}
}
void print(int m){

for(int i=0;i<m;i++){
for(int j=0;j<DNA[rank[i][1]].size();j++)
cout <<DNA[rank[i][1]][j];
cout<<endl;
}

}
int main(){
int n,m,C;
int f=0;
char s;
cin>>C;
for(int i=0;i<100;i++)
rank[i][1]=i;
for(int i=0;i<C;i++){
if(f==1)
cout<<endl;
cin>>n>>m;
for(int j=0;j<m;j++){
for(int k=0;k<n;k++){
cin>>s;
DNA[j].push_back(s);
}
}
func(n,m);
bubblesort(m);
//cout<<endl;
print(m);
initial(n,m);
}
return 0;
}

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

### Re: Help!612 WA!why?

Print a blank line between consecutive test cases.
Check input and AC output for thousands of problems on uDebug!

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

### Re: Help!612 WA!why?

Input:

Code: Select all

10

7 5
CTGAGCC
GCCACGG
TATGCGT
ATCTCGT
GGCTGTT

7 2
GTAATCG
AGGATAG

5 5
AGATC
TATGT
AACTC
TCCTC
AGCGC

1 3
C
T
T

6 1
ATTCCT

6 3
CCAAGC
TTATGA
AACCCC

8 7
GACGTGTG
AGGCTCCA
AGTGAGGA
GTTTCAGT
ATGTAAAA
GCCAAAAA
CAGCGTTC

3 9
GAC
TAC
CGG
TGG
TTT
CTT
CAA
AAG
TGA

5 8
TAATC
TTACA
GGCCA
GCCAG
GAGGA
TAGTC
ACCGC
AAGAC

3 6
TAA
AGC
CGT
TCG
GCA
GAT
AC output:

Code: Select all

GGCTGTT
ATCTCGT
GCCACGG
TATGCGT
CTGAGCC

AGGATAG
GTAATCG

AACTC
AGATC
TATGT
AGCGC
TCCTC

C
T
T

ATTCCT

AACCCC
CCAAGC
TTATGA

GACGTGTG
CAGCGTTC
AGTGAGGA
GTTTCAGT
ATGTAAAA
AGGCTCCA
GCCAAAAA

CGG
TTT
CTT
AAG
GAC
TAC
TGG
CAA
TGA

ACCGC
AAGAC
TAATC
GAGGA
GCCAG
TAGTC
TTACA
GGCCA

CGT
AGC
GAT
TAA
TCG
GCA
Check input and AC output for thousands of problems on uDebug!

m_negah
New poster
Posts: 1
Joined: Wed Feb 05, 2014 5:20 pm

### 612- DNA sorting

Hi,

I try to solve the DNA sorting , my code works well but when I got runtime error after submitting.
I there any topic to give me some tip about runtime errors?

I have another question about getting input. I get all dataset one an after that print the result. I use

Code: Select all

Scanner scan = new Scanner(System.in);
in java!
am I in right way or I should read a specific text file.

Sorry for these questions because I'm new here

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

### Re: 612- DNA sorting

Check input and AC output for thousands of problems on uDebug!

nautiluz92
New poster
Posts: 1
Joined: Sun Mar 09, 2014 5:24 am

### Re: 612 - DNA Sorting - Java RunTime Error

Hi everyone, i have hard problems with my algorithm, all the cases i tried give the correct answer but i get WA, also y checked the blank spaces twice but nothing, ill be glad if you can help me.

This is my code:

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

import java.io.IOException;

public class Main {
public static void main(String[] args) throws IOException {
int sw=0;
for(int i=0; i<tam;i++){
int l=Integer.parseInt(lc[0]);
int c=Integer.parseInt(lc[1]);
int[] res= new int[c];
int[] pos= new int[c];
for(int x=0; x<c;x++){
}
for(int x=0; x<c;x++){
int o=0;
o++;

}
}

res[x]=o;
pos[x]=x;

}

for(int s=1;s<c;s++){
for(int x=0;x<c-s;x++){
if( res[x]>res[x+1]){
sw=res[x];
res[x]=res[x+1];
res[x+1]=sw;
sw=pos[x];
pos[x]=pos[x+1];
pos[x+1]=sw;
}
}
}

for(int s=1;s<c;s++){
for(int x=0;x<c-1;x++){

if( res[x]==res[x+1]&& pos[x]>pos[x+1]){

sw=res[x];
res[x]=res[x+1];
res[x+1]=sw;
sw=pos[x];
pos[x]=pos[x+1];
pos[x+1]=sw;
}
}
}

for(int x=0;x<c;x++){
}
if(i+1!=tam)
}
}
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

### Re: 612 - DNA Sorting - Java RunTime Error

Print a blank line between consecutive test cases.
Check input and AC output for thousands of problems on uDebug!

Compaq
New poster
Posts: 1
Joined: Sun May 18, 2014 5:38 am

### Re: 612 - DNA Sorting

Hi, guys, sorry to bother.

But, this question is really disturbing me.

What's wrong in my code?

Code: Select all

#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
string k[2000];
int i, j, z, linhas, tam;
int cont = 0;
vector<pair<int,int> >v;
cin >> M;
v.clear();
cin >> tam;
cin >> linhas;
for ( z = 0; z < linhas; z++) {
cin >> k[z];
for (i = 0; i < tam; i++) {
for ( j = i; j < tam; j++) {
if (k[z][i] > k[z][j]) {
cont += 1;}}}
v.push_back(pair<int,int>(cont, z));
cont = 0;}
stable_sort (v.begin(), v.end());
for ( i = 0; i < linhas; i++) {
cout << k[v[i].second];
if ( i + 1 < linhas || contador +1< M){
cout << endl;}}
cout << endl;}}
return 0;
}
My output are the same of the "brianfry713", but i keep geting WA. Why?

Thanks, Anyway.

Ps: Sorry my bad english. x.x

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

### Re: 612 - DNA Sorting

Always print a newline char at the end of the last line.
Check input and AC output for thousands of problems on uDebug!

naheed
New poster
Posts: 8
Joined: Sun Oct 25, 2009 7:20 pm

### Re: 612 - DNA Sorting

Hi. I have been stuck with my code getting WA multiple times. Tested on the sample inputs & outputs in this thread, but no luck.
Here it is:

Code: Select all

#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <map>
using namespace std;

int strln;
map <string,int> mp;
int getcount(char a[]){
int n,count,i,j,temp;
n = strln;
count = 0;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(a[i]>a[j]){
count++;
}
}
}
//printf("count: %d ",count);
return count;
}
int compare_func(const void *a,const void *b){
char **ia = (char **)a;
char **ib = (char **)b;
//printf("%s %s<L>",*ia,*ib);
int acount = getcount(*ia);
int bcount = getcount(*ib);
if(acount!=bcount){
//printf(" %d\n",acount-bcount);
return acount-bcount;
}
else{
string sa,sb;
sa = *ia;
sb = *ib;
if(mp[sa] > mp[sb])  {
//printf(" 1\n");
return 1;
}
else{
//printf("-1\n");
return -1;
}
}
}

int main(){
char *a[101];
char garbage[10];
int testcases;
int lines,i,j;
scanf("%d",&testcases);

//freopen("a.txt","w",stdout);
while(testcases--){
gets(garbage);
scanf("%d %d",&strln,&lines);
for(i=0;i<lines;i++){
a[i] = (char *)malloc(sizeof(char)*(strln+1));
scanf("%s",a[i]);
string t = a[i];
mp[t] = i;
}

qsort(a,lines,sizeof(a[0]),compare_func);

for(i=0;i<lines;i++){
printf("%s\n",a[i]);
}
if(testcases!=0)
printf("\n");
}
return 0;
}

lighted
Guru
Posts: 587
Joined: Wed Jun 11, 2014 9:56 pm
Location: Kyrgyzstan, Bishkek

### Re: 612 - DNA Sorting

898989 wrote:..
..
For all people who still got WA.
1) Take care from above hints
2) input has repeated strings.

Hope this helps.
Try input

Code: Select all

1

3 10
ABC
ABD
BCD
BCE
ABC
ABD
BCD
BCE
DFG
HJK
Acc Output

Code: Select all

ABC
ABD
BCD
BCE
ABC
ABD
BCD
BCE
DFG
HJK
Sedefcho wrote:I was wondering
IF
there's a better way of calculating the count of
inversions in a given string STR having a length of N
THAN
the obvious straightforward algorithm which has
an O (N^2) time complexity.

Apparently you use that O (N^2) algorithm and I guess there's
no better algorithm in terms of runnng time.

Does anyone know a better algorithm or no such
algorithm exists ?
It is possible to find number of inversions in O(N * logN) using Divide and Conquer Algorithm (Mergesort).
A person who sees the good in things has good thoughts. And he who has good thoughts receives pleasure from life... Bediuzzaman

gautamzero
New poster
Posts: 32
Joined: Fri Oct 10, 2014 1:10 pm

### Re: 612 - DNA Sorting

what is the problem in my code??
getting WA!!

Code: Select all

erased
Last edited by gautamzero on Sun Dec 21, 2014 6:55 pm, edited 1 time in total.
None but a fool is always right..
so don't be upset when u r wrong..

lighted
Guru
Posts: 587
Joined: Wed Jun 11, 2014 9:56 pm
Location: Kyrgyzstan, Bishkek

### Re: 612 - DNA Sorting

Input

Code: Select all

9

2 33
CC
CG
CT
GT
CG
CC
AT
GC
TC
CA
TA
GA
CA
AA
TA
CA
GG
TT
CC
GG
TA
AT
TG
AG
TC
GT
CA
TT
CT
TA
AA
CG
GA

14 31
GTCTGGTAATTTTC
CGGCTCAAGCCGAC
TCGCATCGCAGCTC
AGGCCATAGTAAAC
GAGGCATCTATAAC
GAGGGCATCTTTGA
TGCGTAAAATGAAC
AATGACCTGCGAAG
TGGTATCTTCAAAG
AATACGTCAAAGCT
GCCGTTCTGGTGTT
GTCGAAGCTCGTCT
CGGATTGGGTGACC
GAAATCGTCCAAGT
TAGCGACGTTACGG
CTTATTAGATGGAG
GGCGGTTCTATGTT
TCGCACCTCCCCAT
TAGGTTACTTGGTC
CGCATTCTAGGCAT
TATGCCAAAACTTA
GGCTAGTTCCGGTA
TTAGATCCACCAGG
ACGGAACAGAAACG
GCTCATAAGCCGGG
GACGGTAGTCGGGG
GTCAAACCTCCCGT
TCCCCGATGACCGA
TAGCTTCATTCGAG
TTCGATACCACTAG
CGGAGCGGATGAGT

9 76
CCATGGCTG
CTTTGCGAA
ATGACACCT
TTACAGGAA
ACAGGTGCC
TTCTTACAC
GCGCACCGG
TAGAATAGG
TATATTCGG
CAGGGACTA
GAGAAGGAG
GACATCTTC
GATCCTTTC
TAAATCGTC
CGCTACAAA
GTTTGTGTA
GGTTGAAGT
CAGGCATCA
ACAATATGG
GCCGTTCGC
CGTATATCC
TAGAAAAAT
ATGGCTTTG
TCAAGTATG
AGACCAACC
AGCTGCCCG
AAGGTTTAC
GAAAAGACA
CCCGCTTCG
AGTTTTCCT
AATCGTGTT
ATAAAGGGT
CGATGTGCG
GGTCGAAAG
TGCGGCGTC
ACAAGGAGA
TAGCGACTT
CTTTGCCAT
GTGTTTTTG
CAAGTAACT
AGGTTGGGA
TTCTCACCT
CATTGTTAG
TATGACCAA
TGTTGGACA
AGCATCTGT
GCTACTATA
CAAGTGCTA
TTCTAAAAT
GTGCCTCCA
ACAATAACA
TGTTCGCCG
CCGATCGCG
GGAGGCGTA
TTCTGTGGC
ATGTATCAT
TTACCGCTA
TGTTCTCAC
AGTCGGTCG
TTTGGGGTT
ACGAAAATC
TACACTAGG
GGTCCGATA
GCACCCTCC
ACACACTCG
GCAATGAAT
GAGTGTTTA
ATGCTTCAA
GTCAGGCGC
TGGTCGCAC
CTACTTTAG
TCTTAGAAA
GCTTCCCAG
ACGCGCCAA
CTATGGGCG
CCGCTAATC

17 24
GGTCAGATATTGTCCGG
CTACTCACGCAGAAATT
GTCGTGGGACACAGTTG
AGTAAGCAAGACCATAC
CTTTGACGCCAAAGCGG
CGATTACTCGTAGCGGA
CAAGGGTGGTATGGCAG
ATTCTATGCCTTTAATA
TCGGTCGAAAGCACCAA
GTACCCTCAGCCGCATA
GTCATCACTCGACGTAT
ACATGCGTGACGTCAGG
CCTCTGGCTTAGTTGCT
GTAATGAAATCCGTGTG
TGCGAACAGCTAGGGCT
GACGAGGCTAACTTAGA
GGAAGGCCGTTCAGTCA
GCGATCATGTGGCGCTG
CCAGGTCGACATGACAG
CTTCGCCCAGTCGGGTG
AGCCACGACCCGCTAAT
CGAGTACTCTCTGTTAC
AAGTCTAGGCCGCATTC
GTCTGTGTGAGGCTGCG

4 42
TGGC
CTGC
CCTT
TACA
TCCT
AATT
TCGT
GGCC
CTTG
GCAT
GTGC
TTCT
ATGC
TCAG
GGCA
AGCC
CAAT
GAGA
TCGG
ATCC
GTGC
AGTG
ACGA
TAGC
AGAG
GTTC
ACTA
ACCT
ATAC
CATC
CGGA
GACG
GGCA
CACC
CACC
CTAG
GCTA
CGCG
ATGG
TACC
GGCT
GGAT

8 54
GGCACGAA
GGAACTTC
TCCGTTTC
ACATTTTC
CCCGTCTG
TTGCGGGC
TTTTGTAG
AACTTCAC
GCTCTGTG
CGTTACCT
CAGTTGGA
TTTGAATG
CTAACTTT
CGGCATCC
ATATGGTC
GTTGTTCA
GCCTAAGG
GCTGAATA
AAAGGTTA
GGTCCAGT
CTTCTCTC
GTATTTTT
TTCGTAGC
TCTACCAG
ATATATAT
GAGGACCT
CTCATACG
CATTCTCC
GCAGCCCT
CTCCCTCG
GGGCGTAA
ATTCGATA
GTGTAAGG
TATATAGC
TAGCAGCA
CACTCATT
AGGAGAGC
AGGTGAAC
CTTCCACT
CGGGTGCT
ATTGTGTA
ACTGGAAT
TTAATCTA
TGGGATCA
GCGGTCGT
TCCCCCAA
AACACAAA
GTTGGAGC
CATAGCTC
GCGAGGAT
GCTTGTTA
GGTCTCGA
GCCAGACA
CTAACCTT
11 25
GACCCAAACTC
TTTAATGCAGG
TTGAACTGTCT
CTACTAGGCCC
CCGATTCCCAA
ACACATCGGGC
GTAGCGTGTAT
CCGAGTGGAGT
ATATAGCGTTC
TCGCCAACTGG
CGACATCGGCG
GCGAGCTGGGT
CTACAGCGAGA
CTCAATGGCCT
ACCCCTTTTAT
TGTCTCGCCTC
GTCGCTTGGTA
AACTAAGATGG
GTCTCTCAATT
CCCCCTTATTC
ATCCCCATATT
CGAATCATAGA
CTCCGGAGTCC
AGGCGGCCCTA
CTTGAGTGTAC

6 77
GCTAGA
TGCTAT
CAGAAA
TAGGAA
ACTGAG
AGTTGG
ACACAA
ACAGGA
GCACTA
CACAGC
TTTGGC
AGTATT
ATCACT
AAAACT
AGTCGG
GCCCAT
TAGGCC
CCCGGG
CGGCTT
CTCACA
GTCTCC
TAGCGT
GTATGG
GTCACA
AGTCGA
CCATAC
ATCGAT
CTGGGA
AAACCC
CCTCGC
CAGCTT
GTGTGT
GTGCCA
CGCCTG
GCTCGC
TTCCCA
ATATTG
GCCAGT
AACCCA
TACGCT
AATCGA
GGTGCG
ATACTG
AAGCCA
GCATTC
TTGGCA
GTGCCA
ACTAGT
GTTCAA
CGCCGC
GCAATC
ACATGC
TGGGGC
CCAAGA
CTTGAC
TGGATC
CTGGGA
TCTGAC
TCGTGA
TTTGCT
TCGCCC
GGAAAT
CAAAGA
CCGAAA
ATTAGA
TCCCTG
GCCTGC
GTCGTT
TAACAA
CCAACG
AATGGG
AAACTG
TCCAAA
ATAAAC
CCGCCT
TCTGTC
CAGCCC

15 31
TATCAGTGTCGATTC
GACCCCACACCACAT
GTTCATATCTATAAT
CGTGACTAGTCAAGA
TCTGGTGGGTGTTGT
GTCCGCGCCCCGCCC
CAGAGATATCACATT
TCGCGAGCGAGTGTA
TAACAGGTTCATGCG
CATTCCAAGGAACGT
CGTCTTTCGGGTCAA
TCAGCGACGGTGTAA
GCGGGGCCTAAGTCG
TCATTCCTGTGCCCC
GTGACAGTCGTCAGT
GCAGATTGTCCCGTG
TCCCCTCAGTGCAGT
TAATTATGGGAATGT
CGAGTCCCCTATAAC
TAGTTCAGTGATGTG
CAACTTTAAAAAAAC
CACTTAATTAGTTAT
CGTCTGCGTCTTGTT
TATAATAAGTAATAC
GCTCTGAACTCAGTT
CGTCGTATAGGATCA
ATGTCCCCCGAGGGG
CTACATAAGATACGG
CGCTCGAGTCCTATC
GCCGGCCGGTTCAAT
GCCTCGGCACTCCTC
Acc Output

Code: Select all

CC
CG
CT
GT
CG
CC
AT
AA
GG
TT
CC
GG
AT
AG
GT
TT
CT
AA
CG
GC
TC
CA
TA
GA
CA
TA
CA
TA
TG
TC
CA
TA
GA

GCCGTTCTGGTGTT
GGCGGTTCTATGTT
GACGGTAGTCGGGG
CGGAGCGGATGAGT
GTCAAACCTCCCGT
AATACGTCAAAGCT
GTCTGGTAATTTTC
GAGGGCATCTTTGA
GTCGAAGCTCGTCT
GAAATCGTCCAAGT
ACGGAACAGAAACG
AATGACCTGCGAAG
TAGCGACGTTACGG
TAGGTTACTTGGTC
GCTCATAAGCCGGG
TCGCACCTCCCCAT
CGCATTCTAGGCAT
GGCTAGTTCCGGTA
TCGCATCGCAGCTC
AGGCCATAGTAAAC
CGGATTGGGTGACC
TATGCCAAAACTTA
TAGCTTCATTCGAG
GAGGCATCTATAAC
CGGCTCAAGCCGAC
CTTATTAGATGGAG
TCCCCGATGACCGA
TTAGATCCACCAGG
TTCGATACCACTAG
TGCGTAAAATGAAC
TGGTATCTTCAAAG

AATCGTGTT
ACACACTCG
CCCGCTTCG
ATAAAGGGT
GTGTTTTTG
AGCATCTGT
ACAATATGG
CCATGGCTG
GAGAAGGAG
ATGGCTTTG
ACAAGGAGA
GAGTGTTTA
ACAGGTGCC
GACATCTTC
GATCCTTTC
AAGGTTTAC
AGTTTTCCT
CAAGTAACT
ACAATAACA
CCGATCGCG
ACGAAAATC
GCACCCTCC
GCGCACCGG
TAAATCGTC
AGACCAACC
GAAAAGACA
AGTCGGTCG
ATGACACCT
TAGAAAAAT
AGCTGCCCG
CGATGTGCG
TAGCGACTT
CAAGTGCTA
TTTGGGGTT
TAGAATAGG
GCCGTTCGC
TCAAGTATG
AGGTTGGGA
CATTGTTAG
GGAGGCGTA
ATGTATCAT
TACACTAGG
CTACTTTAG
CAGGGACTA
GGTTGAAGT
GCAATGAAT
CCGCTAATC
TATATTCGG
GTTTGTGTA
CGTATATCC
CTATGGGCG
CAGGCATCA
TGCGGCGTC
TTCTCACCT
GCTACTATA
GTCAGGCGC
ACGCGCCAA
CTTTGCCAT
TTCTAAAAT
TTACCGCTA
ATGCTTCAA
GCTTCCCAG
GGTCGAAAG
TTCTGTGGC
GGTCCGATA
TTACAGGAA
TTCTTACAC
TGTTCGCCG
CGCTACAAA
TATGACCAA
TGTTCTCAC
GTGCCTCCA
TCTTAGAAA
CTTTGCGAA
TGGTCGCAC
TGTTGGACA

CCTCTGGCTTAGTTGCT
GTAATGAAATCCGTGTG
CTTCGCCCAGTCGGGTG
AGCCACGACCCGCTAAT
CAAGGGTGGTATGGCAG
GCGATCATGTGGCGCTG
CGAGTACTCTCTGTTAC
ACATGCGTGACGTCAGG
AAGTCTAGGCCGCATTC
TGCGAACAGCTAGGGCT
AGTAAGCAAGACCATAC
GGTCAGATATTGTCCGG
GTCATCACTCGACGTAT
GACGAGGCTAACTTAGA
GGAAGGCCGTTCAGTCA
CTACTCACGCAGAAATT
ATTCTATGCCTTTAATA
GTCGTGGGACACAGTTG
CCAGGTCGACATGACAG
CGATTACTCGTAGCGGA
GTACCCTCAGCCGCATA
GTCTGTGTGAGGCTGCG
CTTTGACGCCAAAGCGG
TCGGTCGAAAGCACCAA

CCTT
AATT
ACCT
AGTG
AGAG
CACC
CACC
CGCG
TCCT
TCGT
CTTG
TTCT
AGCC
CAAT
ATCC
ACGA
ACTA
ATAC
CATC
GACG
ATGG
GGCT
GGAT
CTGC
GCAT
ATGC
GAGA
TCGG
GTTC
CGGA
CTAG
TACC
TACA
GGCC
GTGC
TCAG
GTGC
TAGC
GCTA
TGGC
GGCA
GGCA

GTATTTTT
CCCGTCTG
AAAGGTTA
ACATTTTC
CTAACTTT
ATATATAT
CACTCATT
CGGGTGCT
GCGGTCGT
CTAACCTT
CTCCCTCG
AACACAAA
TCCGTTTC
AACTTCAC
GCTCTGTG
CTTCTCTC
CATTCTCC
GCAGCCCT
AGGAGAGC
CATAGCTC
GCGAGGAT
GGAACTTC
CGTTACCT
ATATGGTC
GAGGACCT
ACTGGAAT
GCTTGTTA
CAGTTGGA
CTTCCACT
ATTGTGTA
CGGCATCC
GCCTAAGG
GGTCCAGT
CTCATACG
TTAATCTA
ATTCGATA
GTGTAAGG
TATATAGC
AGGTGAAC
TTTTGTAG
TTTGAATG
GTTGTTCA
GCTGAATA
TCTACCAG
GGGCGTAA
TAGCAGCA
GGTCTCGA
GCCAGACA
GGCACGAA
TTGCGGGC
TTCGTAGC
TCCCCCAA
GTTGGAGC
TGGGATCA

ACCCCTTTTAT
GCGAGCTGGGT
ACACATCGGGC
CCCCCTTATTC
AACTAAGATGG
CCGAGTGGAGT
CGACATCGGCG
ATCCCCATATT
ATATAGCGTTC
GTAGCGTGTAT
GACCCAAACTC
CTCAATGGCCT
TTGAACTGTCT
CTCCGGAGTCC
TCGCCAACTGG
GTCGCTTGGTA
CTACTAGGCCC
GTCTCTCAATT
CGAATCATAGA
AGGCGGCCCTA
CTACAGCGAGA
CTTGAGTGTAC
TGTCTCGCCTC
CCGATTCCCAA
TTTAATGCAGG

AAAACT
CCCGGG
AAACCC
AAACTG
AGTATT
CGGCTT
CAGCTT
CCGCCT
GTGTGT
CGCCTG
AACCCA
ACTAGT
GTCGTT
AATGGG
AGTTGG
ACAGGA
CACAGC
ATCACT
AGTCGG
CCTCGC
ATATTG
ATACTG
CGCCGC
ACATGC
CCAACG
ATAAAC
CAGCCC
ACTGAG
ACACAA
TAGCGT
ATCGAT
GCCAGT
TACGCT
AATCGA
AAGCCA
CAAAGA
TCCCTG
GTATGG
CCATAC
GGTGCG
GCATTC
GGAAAT
GCCTGC
TGCTAT
CAGAAA
GCCCAT
AGTCGA
GCTCGC
GCAATC
CCAAGA
TTTGCT
ATTAGA
TAACAA
TCTGTC
GCACTA
GTCTCC
CTGGGA
CTGGGA
TCGCCC
GCTAGA
TAGGAA
TAGGCC
CTCACA
TGGGGC
CTTGAC
TGGATC
TCGTGA
CCGAAA
TCTGAC
TTTGGC
GTCACA
TTCCCA
GTTCAA
TCCAAA
GTGCCA
GTGCCA
TTGGCA

CGTCTGCGTCTTGTT
TCTGGTGGGTGTTGT
CACTTAATTAGTTAT
CAGAGATATCACATT
GCAGATTGTCCCGTG
TAACAGGTTCATGCG
ATGTCCCCCGAGGGG
TAATTATGGGAATGT
TATAATAAGTAATAC
GACCCCACACCACAT
TCCCCTCAGTGCAGT
TAGTTCAGTGATGTG
CTACATAAGATACGG
GCTCTGAACTCAGTT
GCCTCGGCACTCCTC
TATCAGTGTCGATTC
TCGCGAGCGAGTGTA
CATTCCAAGGAACGT
GTGACAGTCGTCAGT
CGCTCGAGTCCTATC
GCCGGCCGGTTCAAT
GCGGGGCCTAAGTCG
CAACTTTAAAAAAAC
GTCCGCGCCCCGCCC
TCAGCGACGGTGTAA
GTTCATATCTATAAT
TCATTCCTGTGCCCC
CGAGTCCCCTATAAC
CGTCGTATAGGATCA
CGTGACTAGTCAAGA
CGTCTTTCGGGTCAA
A person who sees the good in things has good thoughts. And he who has good thoughts receives pleasure from life... Bediuzzaman

gautamzero
New poster
Posts: 32
Joined: Fri Oct 10, 2014 1:10 pm