BOL

List of bioinformatics tools/Software Website References for genome assembly:

There are numerous genome assembly tools available, each with its strengths and weaknesses. Here is a list of some widely used genome assembly tools as of my last update in September 2021: SPAdes: An assembler specifically designed for...

http://busco.ezlab.org/ - Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs More at http://busco.ezlab.org/

github.com - Pilon is a software tool which can be used to: Automatically improve draft assemblies Find variation among strains, including large event detection Pilon requires as input a FASTA file of the genome along with one or more BAM files of reads...

github.com - PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.   More at https://github.com/neufeld/pandaseq

http://busco.ezlab.org/ - High-throughput genomics has revolutionized biological research, however, while the number of sequenced genomes grows by the day, quality assessment of the resulting assembled sequences remains complicated and mostly limited to technical measures...

www.ncbi.nlm.nih.gov - Background. Next-generation sequencing technologies are now producing multiple times the genome size in total reads from a single experiment. This is enough information to reconstruct at least some of the differences between the individual genome...

github.com - SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads. More at https://github.com/jts/sga SGA...

github.com - Requirements: velvet (velveth velvetg should be in your PATH) R (with Sweave) pdflatex (usually part of TeTeX) ggplot2 (from R prompt type install.packages("ggplot2","proto","xtable")) Perl Optional: BLAT or BLAST (to generate...

sco.h-its.org - PEAR is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory. PEAR evaluates all possible paired-end read overlaps and without requiring the...