[RudyS]

swbarnes

are you saying that there is some utility in the UCSC Genome Browser for assembling genomes from short reads? havent heard about that ...

RudyS

[swbarnes2]

i note that there is no active link in the posting

* STADEN - Includes GAP4. GAP5 once completed will handle next-gen sequencing data. A partially implemented test version is available here

anybody have news about GAP5? havent found a satisfying assembler with graphics

RudyS

They've been saying that gap5 will handle short reads for about a year, so I wouldn't hold your breath on that one.

If you are doing mouse or human or rat, UCSC can be worked with. I don't know if it can be tweaked into accepting genomes or trasncriptomes of other organisms.

[RudyS]

Staden GAP5

i note that there is no active link in the posting

* STADEN - Includes GAP4. GAP5 once completed will handle next-gen sequencing data. A partially implemented test version is available here

anybody have news about GAP5? havent found a satisfying assembler with graphics

RudyS

[JackYu]

Hi everyone,

I'm new to NGS. I'm looking for a software package to analyze the sequences. Are there any review articles about the softwares?

Thanks,
Jack

[bioinfosm]

LookSeq: ALignment visualization

from Sanger

http://www.sanger.ac.uk/Software/analysis/lookseq/

[strob]

ABySS (Assembly By Short Sequences)

http://www.bcgsc.ca/platform/bioinfo/software/abyss

Genome Res. 2009 Feb 27.

ABySS: A parallel assembler for short read sequence data.

Widespread adoption of massively parallel DNA sequencing instruments has prompted the recent development of de novo short read assembly algorithms. A common shortcoming of the available tools is their inability to efficiently assemble vast amounts of data generated from large-scale sequencing projects, such as the sequencing of individual human genomes to catalog natural genetic variation. To address this limitation, we developed ABySS (Assembly By Short Sequences), a parallelized sequence assembler. As a demonstration of the capability of our software, we assembled 3.5 billion paired-end reads from the genome of an African male publicly released by Illumina Inc. Approximately 2.76 million contigs >/=100bp in length were created with an N50 size of 1499bp, representing 68% of the reference human genome. Analysis of these contigs identified polymorphic and novel sequences not present in the human reference assembly, which were validated by alignment to alternate human assemblies and to other primate genomes

http://www.ncbi.nlm.nih.gov/pubmed/19251739?dopt=Abstract

[strob]

SeqCons

A Consistency-based Consensus Algorithm for De Novo and Reference-guided Sequence Assembly of Short Reads

http://www.seqan.de/projects/consensus.html

Bioinformatics Advance Access published March 5, 2009

[bioinfosm]

SHORE (SHOrt REads)

It is an impressive package .. with a lot of statistics and pretty plots generated at the end of analysis. Wonder why no one catched it here.

http://1001genomes.org/downloads/

Now my query is, how it matches up to MAQ and others.. it is pretty fast though

[kopi-o]

I didn't see MACS and PeakSeq among the ChIP-seq peak callers. Those should be added.

[jerryliu]

I am trying to realize an assembly of sequences (454 + Sanger) of novo using the program wgs-assembler (Celera Assembler). This program needs a file *.frg to begin the assembly. Can someone obtain like the file *.frg from the files *.fasta and *.qual without using the file *.xml?.

Thank you for everything.

Rocio

There is a script FASTA_to_frg_file.pl under Linux-amd64/bin/ that can convert fasta to .frg file.

[swbarnes2]

I think that Bowtie will also return the optimal and sub-optimal matches.

Bowtie is a BWA program, that's the algorithm that the fastest aligners are based on.

[myrna]

Suboptimal hits

Novoalign will do this for you. You might have to play around with the parameters to get exactly what you want (how many suboptimal hits, how suboptimal etc).

Ryan

[bioinfosm]

Most conservative aligner

I wish to find the best alignment of my 32bp and 100bp reads (separately, not as single input), and also determine the next best matches. Which algorithm would be most suitable for this purpose?

I understand that it can take longer to run, than some of the other algorithms that run much faster..

Any thoughts?

[rociobm]

I am trying to realize an assembly of sequences (454 + Sanger) of novo using the program wgs-assembler (Celera Assembler). This program needs a file *.frg to begin the assembly. Can someone obtain like the file *.frg from the files *.fasta and *.qual without using the file *.xml?.

Thank you for everything.

Rocio

[francesco.vezzi]

Yes for sure is better way it is tested on a real data set, the thing that it seems strange to me is the fact that in the last year I found dozen of articles that cite ALLPATH as an excellent assembler but it seems that nobody has effectively used it....