BOL: Related items

Many-to-many pairwise alignments of two sequence sets

Poonam Mahapatra — Tue, 19 Jun 2018 08:34:15 -0500

needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.

Address of the bookmark: http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html

BLAST options, setting and defaults

Jit — Mon, 10 Dec 2018 08:29:37 -0600

BLAST stands for Basic Local Alignment Search Tool and was developed by Altschul et al. (1990) and significantly improved by Altschul et al. (1997). It is a very fast search algorithm that is used to separately search protein or DNA databases. BLAST is best used for sequence similarity searching, rather than for motif searching. For searches using a query sequence of fewer than twenty residues, PatMatch is the best choice. Another sequence alignment tool that may yield different results from BLAST, and may be useful for motif searching, is FASTA. To search nonplant datasets, try NCGR BLAST or NCBI BLAST.

A fairly complete on-line guide to BLAST searching can be found at the NCBI BLAST Help Manual. For a theoretical overview of BLAST, see the NCBI BLAST Course. Additional information can be found in the BLAST 2.0 Release Notes

	BLASTN	BLASTP	BLASTX	TBLASTN	TBLASTX	PSIBLAST
Gap opening penalty: cost to open a gap [integer]	default = 5	default = 11 limited values are supported	default = 11 limited values are supported	default = 11 limited values are supported	default = 11 limited values are supported	default = 5
Gap extension penalty: cost to extend a gap [integer]	default = 2	default = 1 a 0 in this field means to use the default	default = 1 a 0 in this field means to use the default	default = 1 a 0 in this field means to use the default	default = 1 a 0 in this field means to use the default	default = 2
Nucleic match: reward for a match in the BLAST portion of run [integer]	default = 1	n/a	n/a	n/a	n/a	default = 1
Nucleic mismatch: penalty for a mismatch in the blast portion of run [integer]	default = -3	n/a	n/a	n/a	n/a	default = -3
Expectation value: (E) [real]	default = 10.0	default = 10.0	default = 10.0	default = 10.0	default = 10.0	default = 10.0
Word size: the size of the initial word that must be matched between the database and the query sequence	default = 11	default = 3	default = 3	default = 3	default = 3	default = 11
Max scores: Number of one-line descriptions (V) [Integer]	default = 25	default = 25	default = 25	default = 25	default = 25	default = 25
Max alignments: number of alignments to show (B) [integer]	default = 15	default = 15	default = 15	default = 15	default = 15	default = 15
Query filter: filter applied to the query sequence	default = DUST	default = SEG	default = SEG	default = SEG	default = SEG	default = DUST
Query genetic code: genetic code to be used in BLASTX translation of the query	n/a	n/a	default = universal	default = universal	default = universal	n/a
Matrix: substitution matrix to be used for amino acid comparisons	no default	default = blosum62	default = blosum62	default = blosum62	default = blosum62	no default

Supported and Suggested Values for Gap Open and Extension in BLASTP, BLASTX, TBLASTN, and TBLASTX

Gaps Open	Gap Extension
10	1
10	2
11	1
8	2
9	2

Address of the bookmark: https://www.arabidopsis.org/Blast/BLASToptions.jsp

Termal: a fast and interactive terminal-based viewer for multiple sequence alignments

LEGE — Mon, 22 Sep 2025 23:51:02 -0500

termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.

https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true

Address of the bookmark: https://github.com/sib-swiss/termal

SuRankCo: supervised ranking of contigs in de novo assemblies

Neel — Wed, 24 May 2017 04:46:52 -0500

SuRankCo is a machine learning based software to score and rank contigs from de novo assemblies of next generation sequencing data. It trains with alignments of contigs with known reference genomes and predicts scores and ranking for contigs which have no related reference genome yet.

https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0644-7

Address of the bookmark: https://sourceforge.net/projects/surankco/

Rebaler: program for conducting reference-based assemblies using long reads.

Jit — Tue, 18 Sep 2018 07:52:41 -0500

Rebaler is a program for conducting reference-based assemblies using long reads. It relies mainly on minimap2 for alignment and Racon for making consensus sequences.

I made Rebaler for bacterial genomes (specifically for the task of testing basecallers). It should in principle work for non-bacterial genomes as well, but I haven't tested it.

Address of the bookmark: https://github.com/rrwick/Rebaler

Minipolish: A tool for Racon polishing of miniasm assemblies

BioStar — Tue, 03 Dec 2019 02:40:54 -0600

Miniasm is a great long-read assembly tool: straight-forward, effective and very fast. However, it does not include a polishing step, so its assemblies have a high error rate – they are essentially made of stitched-together pieces of long reads.

Racon is a great polishing tool that can be used to clean up assembly errors. It's also very fast and well suited for long-read data. However, it operates on FASTA files, not the GFA graphs that miniasm makes.

That's where Minipolish comes in. With a single command, it will use Racon to polish up a miniasm assembly, while keeping the assembly in graph form.

It also takes care of some of the other nuances of polishing a miniasm assembly:

Adding read depth information to contigs
Fixing sequence truncation that can occur in Racon
Adding circularising links to circular contigs if not already present (so they display better in Bandage)
'Rotating' circular contigs between polishing rounds to ensure clean circularisation

Address of the bookmark: https://github.com/rrwick/Minipolish

Comparison of Short Read De Novo Alignment Algorithms

Rahul Agarwal — Wed, 21 Aug 2013 07:56:01 -0500

Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.

Title: Comparison of Short Read De Novo Alignment Algorithms

Author: Nikhil Gopal

Address of the bookmark: http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf

3d-dna: 3D de novo assembly (3D DNA) pipeline

Jit — Thu, 28 Dec 2017 10:09:37 -0600

This code is designed to enable anyone to reproduce the Hs2-HiC and the AaegL4 genomes reported in: Dudchenko et al., De novo assembly of the Aedes aegypti genome using Hi-C yields chromosome-length scaffolds. Science, 2017.

Unless otherwise noted, all terminology below is consistent with this paper, and all references to figures and tables in this readme refer to this paper. Specifically, some of the terminology used below is outlined in Figure S2. The assembly procedure is described in detail in the Supporting Online Materials, specifically in the section labelled “Pipeline description”.

In addition, the pipeline uses tools and methods from Juicer (Durand & Shamim et al., Cell Systems, 2016) and Juicebox (Durand & Robinson et al., Cell Systems, 2016), as well as additional dependencies noted below.

Feel free to post your questions and comments at: http://www.aidenlab.org/forum.html

http://aidenlab.org/documentation.html

Address of the bookmark: https://github.com/theaidenlab/3d-dna

ALPACA: A hybrid strategy for assembly of genomic DNA shotgun sequencing reads.

Seema Singh — Mon, 30 Apr 2018 04:38:40 -0500

ALPACA requires Celera Assembler 8.3 or later. It is recommended to build Celera Assembler from source. (Why? The pre-built binaries CA_8.3rc1 and CA8.3rc2 will work for any large data set.

Detail paper at https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3927-8

Address of the bookmark: https://github.com/VicugnaPacos/ALPACA

PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach

Rahul Nayak — Tue, 05 Jun 2018 09:57:11 -0500

PERGA - Paired End Reads Guided Assembler PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate. The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.

Address of the bookmark: https://github.com/hitbio/PERGA