Connect with us

Algorithms

Benchmark databases for multiple sequence alignment: An overview

Dr. Muniba Faiza

Published

on

Multiple sequence alignment (MSA) is a very crucial step in most of the molecular analyses and evolutionary studies. Many MSA programs have been developed so far based on different approaches which attempt to provide optimal alignment with high accuracy. Basic algorithms employed to develop MSA programs include progressive algorithm [1], iterative-based [2], and consistency-based algorithm [3]. Some of the programs incorporate several other methods into the process of creating an optimal alignment such as M-COFFEE [4] and PCMA [5].

An MSA program outperforms the other in different aspects with different accuracy levels. The assessment of accuracy and efficiency of these MSA programs is done on the basis of benchmark databases. These benchmark databases are either manually created or semi-automatedly generated and developed on the basis of protein structure alignment. Since multiple structure alignment is complex, therefore, the pairwise structure alignment is preferred. The alignments created by MSA programs are compared to the reference alignment sets provided by these benchmark databases.

There are various benchmark databases available amongst which BAliBASE (Benchmark alignment database) [6-8] is the most widely used. BAliBASE is created by combining automated and manual methods and provides a variety of reference alignment sets such as repeats, circular permutations, sequences with highly divergent orphans, N/C terminal extensions and so on. HOMSTRAD (Homologous structure alignment database) [9-11] is another database of protein structure alignments which is frequently used as a benchmark database though was not created for this purpose. Several other benchmarks have been developed in the last decade which includes OXBench [12], PREFAB (Protein reference alignment benchmark) [13], SABmark (Sequence alignment benchmark) [14], and IRMBASE (Implanted rose motifs base) [15].

Most of the reference alignments in these benchmark databases are globally aligned and measure sensitivity (i.e., number of correctly aligned positions) instead of calculating specificity. The IRMBASE benchmark is comprised of simulated conserved motifs inserted/deleted/substituted manually with the help of a software called ROSE [16]. The manually simulated sequences give correct multiple alignments with known evolution, which is used to assess the capability of MSA programs to detect isolated motifs within the sequences [15].

The evaluation of the MSA programs is done on the basis of some scores such as Sum-of-Pair (SP) score, column score, maximum-likelihood, minimum entropy, consensus, and star, calculated by the reference alignment databases. The most widely used evaluation function is the SP score used for the assessment of the MSA programs. The evaluation functions of the MSA programs will be discussed in detail in the upcoming article. For further reading kindly refer to the references given below. For any other query write to [email protected].

References

  1. Fitch, W. M., & Yasunobu, K. T. (1975). Phylogenies from amino acid sequences aligned with gaps: The problem of gap weighting. Journal of Molecular Evolution, 5(1), 1–24. https://doi.org/10.1007/BF01732010
  2. Berger, M. P., & Munson, P. J. (1991). A novel randomized iterative strategy for aligning multiple protein sequences. Bioinformatics, 7(4), 479–484. https://doi.org/10.1093/bioinformatics/7.4.479
  3. Gotoh, O. (1990). Consistency of optimal sequence alignments. Bulletin of Mathematical Biology, 52(4), 509–525. https://doi.org/10.1016/S0092-8240(05)80359-3
  4. Wallace, I. M., O’Sullivan, O., Higgins, D. G., & Notredame, C. (2006). M-Coffee: combining multiple sequence alignment methods with T-Coffee. Nucleic Acids Research, 34(6), 1692–1699. https://doi.org/10.1093/nar/gkl091
  5. Pei, J., Sadreyev, R., & Grishin, N. V. (2003). PCMA: fast and accurate multiple sequence alignment based on profile consistency. BIOINFORMATICS APPLICATIONS NOTE, 19(3), 427–428. https://doi.org/10.1093/bioinformatics/btg008
  6. Thompson, J., Plewniak, F., & Poch, O. (1999). BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics, 15(1), 87–88. https://doi.org/10.1093/bioinformatics/15.1.87
  7. Bahr, A., Thompson, J. D., Thierry, J.-C., & Poch, O. (2001). BAliBASE (Benchmark Alignment dataBASE): enhancements for repeats, transmembrane sequences and circular permutations. Nucleic Acids Research, 29(1), 323–326. https://doi.org/10.1093/nar/29.1.323
  8. Thompson, J. D., Koehl, P., Ripp, R., & Poch, O. (2005). BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark. Proteins: Structure, Function, and Bioinformatics, 61(1), 127–136. https://doi.org/10.1002/prot.20527
  9. Mizuguchi, K., Deane, C. M., Blundell, T. L., & Overington, J. P. (1998). HOMSTRAD: A database of protein structure alignments for homologous families. Protein Science, 7(11), 2469–2471. https://doi.org/10.1002/pro.5560071126
  10. De Bakker, P. I. W., Bateman, A., Burke, D. F., Miguel, R. N., Mizuguchi, K., Shi, J., … Blundell, T. L. (2001). HOMSTRAD: Adding sequence information to structure-based alignments of homologous protein families. Bioinformatics, 17(8), 748–749. https://doi.org/10.1093/bioinformatics/17.8.748
  11. Stebbings, L. A., & Mizuguchi, K. (2004). HOMSTRAD: recent developments of the Homologous Protein Structure Alignment Database. Nucleic Acids Research, 32(Database issue), D203–D207.
  12. Raghava, G., & Searle, S. (2003). OXBench: a benchmark for evaluation of protein multiple sequence alignment accuracy. BMC.
  13. Edgar, R. C. (2004). MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research, 32(5), 1792–1797. https://doi.org/10.1093/nar/gkh340
  14. Wallace, I. M., Blackshields, G., & Higgins, D. G. (2005). Multiple sequence alignments. Current Opinion in Structural Biology, 15(3), 261–266. https://doi.org/10.1016/J.SBI.2005.04.002
  15. Subramanian, A. R., Weyer-Menkhoff, J., Kaufmann, M., & Morgenstern, B. (2005). DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. BMC Bioinformatics, 6(1), 66. https://doi.org/10.1186/1471-2105-6-66
  16. Stoye, J., Evers, D., & Meyer, F. (1998). Rose: generating sequence families. Bioinformatics, 14(2), 157–163. https://doi.org/10.1093/bioinformatics/14.2.157

Dr. Muniba is a Bioinformatician based in New Delhi, India. She has completed her PhD in Bioinformatics from South China University of Technology, Guangzhou, China. She has cutting edge knowledge of bioinformatics tools, algorithms, and drug designing. When she is not reading she is found enjoying with the family. Know more about Muniba

Advertisement
Click to comment

You must be logged in to post a comment Login

Leave a Reply

Algorithms

MOCCA- A New Suite to Model cis- regulatory Elements for Motif Occurrence Combinatorics

Published

on

MOCCA- A New Suite to Model cis- regulatory Elements for Motif Occurrence Combinatorics

cis-regulatory elements are DNA sequence segments that regulate gene expression. cis-regulatory elements consist of some regions such as promoters, enhancers, and so on. These regions consist of specific sequence motifs. (more…)

Continue Reading

Algorithms

vs_Analysis.py: A Python Script to Analyze Virtual Screening Results of Autodock Vina

Dr. Muniba Faiza

Published

on

VS-Analysis: A Python Script to Analyze Virtual Screening Results of Autodock Vina

The output files obtained as a result of virtual screening (VS) using Autodock Vina may be large in number. It is difficult or quite impossible to analyze them manually. Therefore, we are providing a Python script to fetch top results (i.e., compounds showing low binding affinities). (more…)

Continue Reading

Algorithms

How to search motif pattern in FASTA sequences using Perl hash?

Dr. Muniba Faiza

Published

on

Here is a simple Perl script to search for motif patterns in a large FASTA file with multiple sequences.

(more…)

Continue Reading

Algorithms

How to read fasta sequences from a file using PHP?

Published

on

Here is a simple function in PHP to read fasta sequences from a file. (more…)

Continue Reading

Algorithms

How to read fasta sequences as hash using perl?

Published

on

This is a simple Perl script to read a multifasta file as a hash. (more…)

Continue Reading

Algorithms

BETSY: A new backward-chaining expert system for automated development of pipelines in Bioinformatics

Dr. Muniba Faiza

Published

on

Bioinformatics analyses have become long and difficult as it involves a large number of steps implemented for data processing. Bioinformatics pipelines are developed to make this process easier, which on one hand automate a specific analysis, while on the other hand, are still limited for investigative analyses requiring changes to the parameters used in the process. (more…)

Continue Reading

Algorithms

Algorithm and workflow of miRDB

Published

on

As mentioned in the previous article, Micro RNAs (miRNAs) are the short endogenous RNAs (~22 nucleotides) and originate from the non-coding RNAs [1], produced in single-celled eukaryotes, viruses, plants, and animals [2]. They play significant roles in various biological processes such as degradation of mRNA [3]. Several databases exist storing a large amount of information about miRNAs, one of such databases miRBase [4] was explained in the previous article, today we will explain the algorithm of miRDB [5,6], another database for miRNA target prediction. (more…)

Continue Reading

Algorithms

miRBase: Explained

Dr. Muniba Faiza

Published

on

Micro RNAs (miRNAs) are the short endogenous RNAs (~22 nucleotides) and originate from the non-coding RNAs [1], produced in single-celled eukaryotes, viruses, plants, and animals [2]. miRNAs are capable of controlling homeostasis [2] and play significant roles in various biological processes such as degradation of mRNA and post-translational inhibition through complementary base pairing [3].  (more…)

Continue Reading

Algorithms

Prediction of biochemical reactions catalyzed by enzymes in humans

Dr. Muniba Faiza

Published

on

There are many biological important enzymes which exist in the human body, one of them is Cytochrome P450 (CyP450) enzymes which are mostly considered in drug discovery due to their involvement in the majority (75%) of drug metabolism [1]. Therefore, various in-silico methods have been applied to predict the possible substrates of CyP 450 enzymes [2-4]. Recently, an in-silico model has been developed to predict the potential chemical reactions mediated by the enzymes present in humans including CyP450 enzymes [5]. (more…)

Continue Reading

Algorithms

A new high-level Python interface for MD simulation using GROMACS

Published

on

The roots of the molecular simulation application can be traced back to physics where it was applied to simplified hard-sphere systems [1]. This field of molecular simulation study has gained a lot of interest since then and applied to perform simulations to fold small protein at multi-microsecond scale [2-4], predict functional properties of receptors and to capture the intermediate transitions of the complex [5], and to study the movement and behavior of ligand in a binding pocket and also to predict interactions between receptors and ligands [6,7]. (more…)

Continue Reading

Algorithms

Machine learning in prediction of ageing-related genes/proteins

Dr. Muniba Faiza

Published

on

Ageing has a great impact on human health, when people’s age advance towards 80 years, approximately half of the proteins in the body get damaged through oxidation. The chemical degradations occurring in our body produce energy by the consumed food via oxidation in the presence of oxygen. (more…)

Continue Reading

Algorithms

Simulated sequence alignment software: An alternative to MSA benchmarks

Dr. Muniba Faiza

Published

on

In our previous article, we discussed different multiple sequence alignment (MSA) benchmarks to compare and assess the available MSA programs. However, since the last decade, several sequence simulation software have been introduced and are gaining more interest. In this article, we will be discussing various sequence simulating software being used as alternatives to MSA benchmarks. (more…)

Continue Reading

Algorithms

ab-initio prediction of protein structure: An introduction

Dr. Muniba Faiza

Published

on

We have heard a lot about the ab-initio term in Bioinformatics, which could be difficult to understand for newbies in the field of bioinformatics. Today, we will discuss in detail what ab-initio is and what are the applicable methods for it. (more…)

Continue Reading

Algorithms

Intrinsically disordered proteins’ predictors and databases: An overview

Published

on

Intrinsically unstructured proteins (IUPs) are the natively unfolded proteins which must be unfolded or disordered in order to perform their functions.  They are commonly referred to as intrinsically disordered proteins (IDPs) and play significant roles in regulating and signaling biological networks [1]. IDPs are also involved in the assembly of signaling complexes and in the dynamic self-assembly of membrane-less nuclear and cytoplasmic organelles [1]. The disordered regions in a protein can be highly conserved among the species in respect of both the composition and the sequence [2]. (more…)

Continue Reading

Algorithms

An introduction to the predictors of pathogenic point mutations

Dr. Muniba Faiza

Published

on

Single nucleotide variation is a change in a single nucleotide in a sequence irrespective of the frequency of the variation. Single nucleotide variants (SNVs) play a very important role in causing several diseases such as the tumor, cancer, etc. Many efforts have been made to identify the SNVs which were initially based on identifying non-synonymous mutations in coding regions of the genomes. (more…)

Continue Reading

Algorithms

SparkBLAST: Introduction

Dr. Muniba Faiza

Published

on

The basic local alignment search tool (BLAST) [1,2] is known for its speed and results, which is also a primary step in sequence analysis. The ever-increasing demand for processing huge amount of genomic data has led to the development of new scalable and highly efficient computational tools/algorithms. For example, MapReduce is the most widely accepted framework which supports design patterns representing general reusable solutions to some problems including biological assembly [3] and is highly efficient to handle large datasets running over hundreds to thousands of processing nodes [4]. But the implementation frameworks of MapReduce (such as Hadoop) limits its capability to process smaller data. (more…)

Continue Reading

Algorithms

Role of Information Theory, Chaos Theory, and Linear Algebra and Statistics in the development of alignment-free sequence analysis

Published

on

By

Sequence alignment is customary to not only find similar regions among a pair of sequences but also to study the structural, functional and evolutionary relationship between organisms. Many tools have been discovered to achieve the goal of alignment of a pair of sequences, separately for nucleotide sequence and amino acid sequence, BLOSSUM & PAM [1] are a few to name. (more…)

Continue Reading

Algorithms

Bioinformatics Challenges and Advances in RNA interference

Published

on

By

 

 

RNA interference is a post-transcriptional gene regulatory mechanism to down-regulate the gene expression either by mRNA degradation or by mRNA translation inhibition. The mechanism involves a small partially complementary RNA against the target gene. To perform the action, it also requires a class of dedicated proteins to process these primary RNAs into mature microRNAs. The guide sequence determines the specificity of the miRNA. Therefore, the knowledge of the guide sequence is crucial for predicting its targets and also exploiting the sequence to create a new regulatory circuit. In this short review, we will briefly discuss the role and challenges in miRNA research for unveiling the target prediction by bioinformatics and to foster our understanding and applications of RNA interference. (more…)

Continue Reading

Algorithms

Systems pharmacology and drug development

Dr. Muniba Faiza

Published

on

Systems pharmacology is an emerging area in the field of medicinal chemistry and pharmacology which utilizes systems network to understand drug action at the organ and organism level. It applies the computational and experimental systems biology approaches to pharmacology, which includes network analyzes at multiple biological organization levels facilitating the understanding of both therapeutic and adverse effects of the drugs. Nearly a decade ago, the term systems pharmacology was used to define the drug action in a specific organ system such as reproductive pharmacology [1], but to date, it has been expanded to different organ and organism levels [2]. (more…)

Continue Reading

Algorithms

Recent advances in in-silico approaches for enzyme engineering

Dr. Muniba Faiza

Published

on

Enzymes are natural biocatalysts and an attractive alternative to chemicals providing improved efficiency for biochemical reactions. They are widely utilized in industrial biotechnology and biocatalysis to introduce new functionalities and enhance the production of enzymes. In order to be proved beneficial for industrial purposes, the enzymes need to be optimized by applying protein engineering. This article specifically reviews the recent advancements in the computational approaches for enzyme engineering and structural determination of the enzymes developed in recent years to improve the efficiency of enzymes, and the creation of novel functionalities to obtain
products with high added value for industrial applications.
(more…)

Continue Reading

LATEST ISSUE

ADVERT