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

Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

233
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...
233
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

325
Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures...
325
Ranks01:02

Ranks

297
Unlike parametric methods, nonparametric statistics are ideal for nominal and ordinal data, requiring fewer assumptions about the population's nature or distribution. This makes nonparametric methods easier to apply and interpret, as they do not depend on parameters like mean or standard deviation. One common approach in nonparametric analysis is to sort data according to a specific criterion. For instance, we might arrange weather data from hottest to coldest days in a month or rank cities...
297
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

2.6K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
2.6K
Introduction to R01:11

Introduction to R

2.1K
R is a powerful software environment for statistical computing and graphics. Originating as an implementation of the S language, developed at Bell Laboratories, R has evolved into a robust, open-source statistical software favored by statisticians and data scientists worldwide. Its comprehensive suite includes data manipulation, calculation, and graphical display capabilities, making it versatile for data analysis and visualization. Its programming language is at the core of R's...
2.1K
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

455
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...
455

You might also read

Related Articles

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

Sort by
Same author

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026
Same author

Accelerating String Comparison in RLZ Compressed Sequences via LCE Jumps.

bioRxiv : the preprint server for biology·2026
Same author

Building genomic data structures from compressed representations using prefix-free parsing.

Genome research·2026
Same author

Movi Color: fast and accurate taxonomic classification with the move structure.

ACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine·2026
Same author

Faster run-length compressed suffix arrays.

Oasics : openaccess series in informatics·2026
Same author

Minimizing reference bias with an imputed personalized reference.

Genome research·2026
Same journal

Mosquito Species and Gender Identification System Based on Artificial Intelligence and Image Processing Methods.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

Related Experiment Video

Updated: Oct 6, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.7K

Finding Maximal Exact Matches Using the r-Index.

Massimiliano Rossi1, Marco Oliva1, Paola Bonizzoni2

  • 1Department of Computer and Information Science and Engineering, University of Florida, Gainesville, Florida, USA.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|January 18, 2022
PubMed
Summary
This summary is machine-generated.

We present MONI, a tool for efficiently finding maximal exact matches (MEMs) in genomic data. MONI utilizes an advanced data structure to accelerate read alignment, a crucial step in bioinformatics.

Keywords:
MEM findingr-indexrun-length-encoded Burrows–Wheeler transformthresholds

More Related Videos

An R-Based Landscape Validation of a Competing Risk Model
05:37

An R-Based Landscape Validation of a Competing Risk Model

Published on: September 16, 2022

2.2K
Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

7.2K

Related Experiment Videos

Last Updated: Oct 6, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.7K
An R-Based Landscape Validation of a Competing Risk Model
05:37

An R-Based Landscape Validation of a Competing Risk Model

Published on: September 16, 2022

2.2K
Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

7.2K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Efficiently finding maximal exact matches (MEMs) is critical for read alignment in genomics.
  • Previous methods faced challenges in constructing space-efficient data structures for rapid MEM identification.
  • The Burrows-Wheeler Transform (BWT) and its r-index offer a foundation for sequence analysis.

Purpose of the Study:

  • To introduce MONI, a software tool implementing an efficient MEM-finding solution.
  • To demonstrate the practical application of the r-index combined with auxiliary data structures for MEM discovery.
  • To provide a user-friendly tool for researchers to perform read alignment using MEMs.

Main Methods:

  • Implementation of a data structure in O(r) space, where r is the number of runs in the BWT.
  • Integration of the 'thresholds' auxiliary data structure with the r-index.
  • Development of the MONI tool for downloading, compiling, and executing MEM finding.

Main Results:

  • MONI successfully implements an efficient algorithm for finding maximal exact matches.
  • The tool leverages an O(r) space data structure for enhanced performance in read alignment.
  • Source code availability facilitates practical use in genomic sequence analysis.

Conclusions:

  • The MONI tool provides an efficient and accessible solution for MEM finding in large-scale genomic datasets.
  • This work validates the effectiveness of the r-index combined with thresholds for accelerating read alignment.
  • MONI empowers researchers with a practical tool for critical bioinformatics tasks.