Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Routh-Hurwitz Criterion II

Routh-Hurwitz Criterion II

In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...

Routh-Hurwitz Criterion I

Routh-Hurwitz Criterion I

Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...

Evolutionary Relationships through Genome Comparisons

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...

Homologous Recombination

Homologous Recombination

The basic reaction of homologous recombination (HR) involves two chromatids that contain DNA sequences sharing a significant stretch of identity. One of these sequences uses a strand from another as a template to synthesize DNA in an enzyme-catalyzed reaction. The final product is a novel amalgamation of the two substrates. To ensure an accurate recombination of sequences, HR is restricted to the S and G2 phases of the cell cycle. At these stages, the DNA has been replicated already and the...

Homologous Recombination

Homologous Recombination

The basic reaction of homologous recombination (HR) involves two chromatids that contain DNA sequences sharing a significant stretch of identity. One of these sequences uses a strand from another as a template to synthesize DNA in an enzyme-catalyzed reaction. The final product is a novel amalgamation of the two substrates. To ensure an accurate recombination of sequences, HR is restricted to the S and G2 phases of the cell cycle. At these stages, the DNA has been replicated already and the...

Wilcoxon Signed-Ranks Test for Matched Pairs

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same journal

In silico analysis, annotation and characterisation of putative ESTs from Sorghum bicolor associated with heat stress.

International journal of bioinformatics research and applications·2015

Same journal

Docking analysis of gallic acid derivatives as HIV-1 protease inhibitors.

International journal of bioinformatics research and applications·2015

Same journal

Automatic segmentation of Potyviridae family polyproteins.

International journal of bioinformatics research and applications·2015

Same journal

Neural network and rough set hybrid scheme for prediction of missing associations.

International journal of bioinformatics research and applications·2015

Same journal

On the interconnection of stable protein complexes: inter-complex hubs and their conservation in Saccharomyces cerevisiae and Homo sapiens networks.

International journal of bioinformatics research and applications·2015

Same journal

Diversity and evolution of the envelope gene of dengue virus type 1 circulating in India in recent times.

International journal of bioinformatics research and applications·2015

Search research articles

Related Experiment Video

Updated: Jul 9, 2026

A Protocol for Computer-Based Protein Structure and Function Prediction

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

Homology search with binary and trinary scoring matrices.

Scott F Smith¹

¹Department of Electrical and Computer Engineering, Boise State University, 1910 University Avenue, Boise, ID 83725, USA. sfsmith@boisestate.edu

International Journal of Bioinformatics Research and Applications

|December 1, 2007

Summary

This summary is machine-generated.

Simplified scoring matrices, like trinary and binary, accelerate protein homology searches. These methods speed up Smith-Waterman algorithms without greatly impacting search accuracy, enabling faster biological sequence analysis.

More Related Videos

The ITS2 Database

The ITS2 Database

Published on: March 12, 2012

Related Experiment Videos

Last Updated: Jul 9, 2026

A Protocol for Computer-Based Protein Structure and Function Prediction

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

The ITS2 Database

The ITS2 Database

Published on: March 12, 2012

Area of Science:

Bioinformatics
Computational Biology
Genomics

Background:

Protein homology searches are crucial for understanding protein function and evolution.
The Smith-Waterman algorithm is a standard method for local sequence alignment.
Computational efficiency is a key challenge in large-scale biological data analysis.

Purpose of the Study:

To investigate methods for accelerating protein homology searches.
To evaluate the impact of simplified scoring matrices on Smith-Waterman algorithm performance.
To explore the use of bit-parallel algorithms and constrained scoring matrices for faster sequence alignment.

Main Methods:

Utilized bit-parallel algorithms for accelerated computation.
Implemented trinary scoring matrices (-1, 0, 1) and binary scoring matrices (0, 1).
Assessed performance using the receiver operating characteristic (ROC) score for Smith-Waterman searches.

Main Results:

Trinary scoring matrices significantly accelerate Smith-Waterman searches with minimal ROC score reduction.
Binary scoring matrices offer greater acceleration but result in a moderate decrease in ROC score.
Binary matrices combined with five-bit saturating scores serve as effective prefilters for the Smith-Waterman algorithm.

Conclusions:

Simplified scoring matrices are effective for accelerating protein homology searches.
Bit-parallel algorithms and constrained matrices offer a trade-off between speed and accuracy.
These optimized methods can enhance the efficiency of large-scale genomic and proteomic analyses.