Shell Programming and Scripting

1 ABCDEFGHI longest_sequence1
2  ABCDEFGH substring_a
3    CDEFG  substring_b
4   ACBDEFGH longest_sequence2_# Note_the order ACB
5   ACBDEFG substring_c
6   ABCDE substring_d
7   ADBCE longest_sequence3_# Note the order ADB
8   ADBC substring_e
9   ABC substring_f
10   DBC substring_g

1 ABCDEFGHI longest_sequence1
4   ACBDEFGH longest_sequence2_# Note_the order ACB
7          ADBCE  longest_sequence3_# Note the order ADB

awk !x[$2]++ infile > temp.file

#!/usr/bin/perl
#This script is to print the longest string of each type, ignore any substrings

use strict;
use warnings;

my $infile  = $ARGV[0];
my $outfile = $ARGV[1];
my @DB;

open(INFILE, "<$infile") or die "Cannot open the input file $!\n";

while (<INFILE>) {
    chomp $_;
foreach my $member (@DB) {
 if (index($member, $_)>=0) {
    next;
    } else   {
       push (@DB, $_);
    }
}
}
close(INFILE);

open (OUTFILE, ">$outfile") or die "Cannot open the output file $!\n";

foreach my $ID (@DB) {
     print OUTFILE "$ID\n";
    }

close(OUTFILE);

ABCDEFGHI
ABCDEFGH
CDEFG
ACBDEFGH
ACBDEFG
ABCDE
ADBCE
ADBC
ABC
DBC

ABCDEFGHI
ACBDEFGH
ADBCE

awk '
$3 ~ /^longest_sequence/ {
  if (x[$2] == 0) { print }
  x[$2]++
}
' file > output

BEGIN { ord_init()}
function ord_init(  i,t) {
  for (i=0;i<=255;i++) {
    t=sprintf("%c",i)
    _ord[t]=i
  }
}
function norm(str,   i,n)
{
   for(i=1;i<=length(str);i++)
     n+=_ord[sprintf("%c", substr(str,i,1))]
   return(n)

}
{
  _n=norm($1)
   la[_n]=$1
   lc[_n]++
}
END {
  for(i in la)
      if (lc[i]>1)
        print la[i]
}