Need some suggestion for overlap assembler

[ljhwahaha]

Recently, i faced with a problem, I want to overlap the sequences in order to have a longer one, but i can't find out a assembler which could be suitable to my data.
The length of my data is wide range, from 102bp to 87249bp, with N50 length of 738bp, so it count not be assembled using 454 data assembler, such as Newbler.
What's more, the total bases number of my data is about 1.9G, so it seems to be impossible to use Sanger data assembler.
What i want to do is to extend the sequences based on the overlap relationship between them, if someone have any suggestion, please inform me.
thank you

[[email protected]]

hello,

I also want to do the same but could not find any software. Did you find any overlaping assembler?

[sklages]

Have a look at Celera Assembler, http://sourceforge.net/apps/mediawik...itle=Main_Page

[amaurizio]

Hello,
I used Pear to merge my Illumina (MiSeq sequencer) pair-end reads.
I'd like to know the overlap length in each of the merged reads in order to calculate min length, max, average, mode, median etc...
Can you suggest my how to do?
I tried with a perl script (length R1 + length R2 - length MergedR1R2) but I am not very good in programming....
Can anybody help me and tell me how to do this?
Thanks!!

[krobison]

#!/usr/bin/perl
#!/usr/bin/perl
# debugging left as exercise for student :-)
use strict;

foreach my $arg(@ARGV)
{
   my %lengths=();
   # read sequence file for lengths
   my $rdr=new Bio::SeqIO(-file=>$arg,-format=>'fastq');
   my $sum=0; my $cnt=0;
   while (my $rec=$rdr->next_seq)
   {
      $lengths{$rec->length}++; $sum+=$rec->length; $cnt++;
   }
   my @sortedLengths=sort {$a<=>$b} keys %lengths;
   my $minLen=$sortedLengths[0];
   my $maxLen=$sortedLengths[$#sortedLengths];
   my $meanLen=$sum/$cnt;
   my ($modeLen)=sort {$lengths{$b}<=>$lengths{$a}} keys %lengths;

   my $medLen="error";
   # calculating median left as exercise

   print join("\t",$arg,$minLen,$maxLen,$meanLen,$modeLen,$medLen),"\n";
}

[amaurizio]

Thank you very much!