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

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
Extraction: Advanced Methods00:56

Extraction: Advanced Methods

Metal ions can be separated from one another by complexation with organic ligands–the chelating agent– to form uncharged chelates. Here, the chelating agent must contain hydrophobic groups and behave as a weak acid, losing a proton to bind with the metal. Since most organic ligands used in this process are insoluble or undergo oxidation in the aqueous phase, the chelating agent is initially added to the organic phase and extracted into the aqueous phase. The metal-ligand complex is formed in...
Linear Approximations01:23

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...

You might also read

Related Articles

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

Sort by
Same author

The mouse Gene Expression Database (GXD): 2026 update.

Nucleic acids research·2025
Same author

Mouse Genome Informatics: an integrated knowledgebase system for the laboratory mouse.

Genetics·2024
Same author

The Mouse Models of Human Cancer database (MMHCdb).

Disease models & mechanisms·2023
Same author

Mouse Genome Informatics (MGI): latest news from MGD and GXD.

Mammalian genome : official journal of the International Mammalian Genome Society·2021
Same author

Multiple genome viewer (MGV): a new tool for visualization and comparison of multiple annotated genomes.

Mammalian genome : official journal of the International Mammalian Genome Society·2021
Same author

Mouse Genome Database (MGD): Knowledgebase for mouse-human comparative biology.

Nucleic acids research·2020

Related Experiment Video

Updated: Jul 19, 2026

High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method
07:51

High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method

Published on: May 21, 2018

fjoin: simple and efficient computation of feature overlaps.

Joel E Richardson1

  • 1The Jackson Laboratory, Mouse Genome Informatics, Bar Harbor, Maine 04609, USA. jer@informatics.jax.org

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|October 26, 2006
PubMed
Summary

This study introduces fjoin, an efficient algorithm for identifying overlapping genomic features. It quickly finds pairs of biological features, like genes, using genome coordinates, improving bioinformatics data analysis.

More Related Videos

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

Related Experiment Videos

Last Updated: Jul 19, 2026

High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method
07:51

High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method

Published on: May 21, 2018

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

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Bioinformatics frequently analyzes biological features with genome coordinates, such as genes and promoters.
  • Comparing large sets of genomic features to find overlapping pairs is a critical data processing step.

Purpose of the Study:

  • To present fjoin, a novel algorithm designed for efficient and robust identification of overlapping genomic feature pairs.
  • To provide a downloadable implementation of the fjoin algorithm.

Main Methods:

  • Developed fjoin, an algorithm with O(n log(n)) time complexity (O(n) if sorted) and O(1) space complexity.
  • Created a stand-alone Python program implementing the fjoin algorithm and its extensions.

Main Results:

  • Demonstrated fjoin's efficiency in finding overlapping feature pairs from large biological datasets.
  • The algorithm offers a simple yet powerful solution for a common bioinformatics task.

Conclusions:

  • fjoin provides an efficient, robust, and simple solution for comparing genomic feature coordinates.
  • The algorithm and its implementation are valuable tools for bioinformatics research and data analysis.