Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

423
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
423
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

429
A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
429
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

502
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...
502
Improving Translational Accuracy02:07

Improving Translational Accuracy

15.0K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
15.0K
Improving Translational Accuracy02:07

Improving Translational Accuracy

3.7K
No description available
3.7K
Cis-regulatory Sequences02:02

Cis-regulatory Sequences

11.9K
Cis-regulatory sequences are short fragments of non-coding DNA that are present on the same chromosomes as the genes that they regulate. These fragments serve as binding sites for transcriptional regulators, proteins that are responsible for controlling gene transcription and differential gene expression across cell types in eukaryotes. Cis-regulatory sequences can be close to the gene of interest or thousands of bases away in the DNA sequence; however, those sequences that are further away are...
11.9K

You might also read

Related Articles

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

Sort by
Same author

Conserved fragments of transposable elements in intergenic regions: evidence for widespread recruitment of MIR- and L2-derived sequences within the mouse and human genomes.

Genetical research·2003
Same author

The efficient computation of position-specific match scores with the fast fourier transform.

Journal of computational biology : a journal of computational molecular cell biology·2002
Same author

Improving the accuracy of PSI-BLAST protein database searches with composition-based statistics and other refinements.

Nucleic acids research·2001
Same author

Lineage-specific gene expansions in bacterial and archaeal genomes.

Genome research·2001
Same author

Candidate regulatory sequence elements for cell cycle-dependent transcription in Saccharomyces cerevisiae.

Genome research·1999
Same author

A practical method for simultaneously determining the effective burst sizes and cycle times of viruses.

Proceedings of the National Academy of Sciences of the United States of America·1999
Same journal

UPF3A and UPF3B shape the transcriptome cooperatively yet oppose cell function.

Journal of molecular biology·2026
Same journal

Antibody-secreting cells integrate efficient NMD with non‑canonical UPR signaling to maintain proteostasis and support massive immunoglobulin synthesis.

Journal of molecular biology·2026
Same journal

Small molecule stabilization of diverse amyloidogenic immunoglobulin light chains revealed by hydrogen-deuterium exchange mass spectrometry.

Journal of molecular biology·2026
Same journal

UPF1 at Work: Structural and Mechanistic Insights Into a Master Regulator of Nonsense-Mediated mRNA Decay.

Journal of molecular biology·2026
Same journal

Structural basis for the pro-amyloidogenic action and ligand binding of a novel W72R variant of human apolipoprotein A-I.

Journal of molecular biology·2026
Same journal

Cryo-EM Structure of the C. Elegans Septin Tetramer Reveals a Revised Architecture and Conserved Positional Orthology.

Journal of molecular biology·2026
See all related articles

Related Experiment Video

Updated: Feb 10, 2026

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
07:05

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

Published on: February 15, 2022

3.0K

Improving sequence-matching algorithms by working from both ends.

J L Spouge

    Journal of Molecular Biology
    |January 5, 1985
    PubMed
    Summary
    This summary is machine-generated.

    Double-ended sequence alignment significantly improves computational efficiency compared to single-ended methods. This approach reduces the cost of aligning nucleic acid sequences, making large-scale genomic analysis more feasible.

    More Related Videos

    Optimization for Sequencing and Analysis of Degraded FFPE-RNA Samples
    07:30

    Optimization for Sequencing and Analysis of Degraded FFPE-RNA Samples

    Published on: June 8, 2020

    12.8K
    Automated Gel Size Selection to Improve the Quality of Next-generation Sequencing Libraries Prepared from Environmental Water Samples
    13:26

    Automated Gel Size Selection to Improve the Quality of Next-generation Sequencing Libraries Prepared from Environmental Water Samples

    Published on: April 17, 2015

    11.0K

    Related Experiment Videos

    Last Updated: Feb 10, 2026

    Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
    07:05

    Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

    Published on: February 15, 2022

    3.0K
    Optimization for Sequencing and Analysis of Degraded FFPE-RNA Samples
    07:30

    Optimization for Sequencing and Analysis of Degraded FFPE-RNA Samples

    Published on: June 8, 2020

    12.8K
    Automated Gel Size Selection to Improve the Quality of Next-generation Sequencing Libraries Prepared from Environmental Water Samples
    13:26

    Automated Gel Size Selection to Improve the Quality of Next-generation Sequencing Libraries Prepared from Environmental Water Samples

    Published on: April 17, 2015

    11.0K

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Genomics

    Background:

    • Current nucleic acid sequence alignment algorithms, such as Ukkonen and Fickett, typically align sequences from a single end.
    • These methods iteratively increase a distance bound (d) to align subsequences, which can be computationally intensive.

    Purpose of the Study:

    • To investigate the efficiency of aligning nucleic acid sequences from both ends simultaneously.
    • To compare the computational cost of double-ended alignment with traditional single-ended algorithms.

    Main Methods:

    • The study analyzes algorithms that align nucleic acid sequences from both the left and right ends.
    • It considers the computational complexity of these double-ended approaches in contrast to single-ended methods.

    Main Results:

    • Aligning sequences from both ends is demonstrated to be a more efficient strategy.
    • A double-ended algorithm with computational cost C(N/2)k offers significant improvement over single-ended algorithms with cost CNk, where N is sequence length.

    Conclusions:

    • Double-ended sequence alignment presents a computationally advantageous alternative for analyzing nucleic acid sequences.
    • This optimized approach has the potential to accelerate large-scale genomic data processing and analysis.