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

Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
Average Value of a Function01:17

Average Value of a Function

The average value of a function over a closed interval can be interpreted geometrically as the height of a rectangle whose area equals the net area under the curve across that interval. This net area accounts for both positive and negative contributions of the function, providing a single representative value that reflects the function’s overall behaviorA practical illustration of this idea arises when monitoring the temperature inside a greenhouse over a twenty-four-hour period. Although the...
Lagrange Multipliers: One Constraint01:29

Lagrange Multipliers: One Constraint

In constrained optimization, the objective is to maximize or minimize a quantity while satisfying a fixed condition. A standard example is a rectangular pen built against a barn wall using 100 meters of fencing. Because the wall provides one side of the enclosure, only the other three sides require fencing. The problem is to find the dimensions that produce the greatest possible area.Let L represent the length parallel to the wall and W the width perpendicular to it. The area of the pen is A =...
Lagrange Multipliers: Two Constraints01:28

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.
Range00:59

Range

The range is one of the measures of variation. It can be defined as the difference between a dataset's highest and lowest values. For example, in the study of seven 16-ounce soda cans, the filled volume of soda was measured, thus producing the following amount (in ounces) of soda:
15.9; 16.1; 15.2; 14.8; 15.8; 15.9; 16.0; 15.5
Measurements of the amount of soda in a 16-ounce can vary since different subjects record these measurements or since the exact amount - 16 ounces of liquid, was not...
Interval and Radius of Convergence01:29

Interval and Radius of Convergence

A power series is a mathematical representation of a function as an infinite sum of terms involving powers of a variable. Such series converge only for specific input values, making it essential to determine the range over which the series produces valid results. This leads to the concepts of radius and interval of convergence, which define where the series behaves meaningfully.The radius of convergence describes the distance from the center within which the power series converges. For a...

You might also read

Related Articles

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

Sort by
Same author

A Kernelization Algorithm for Finding a Perfect Phylogeny From Mixed Tumor Samples.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Faster Algorithms for Constructing Frequency Difference Consensus Trees.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Enhancing Thickness Uniformity of Nb<sub>2</sub>O<sub>5</sub>/SiO<sub>2</sub> Multilayers Using Shadow Masks for Flexible Color-Filtering Applications.

Micromachines·2024
Same author

Fast Algorithms for the Simplified Partial Digest Problem.

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

A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees.

IEEE/ACM transactions on computational biology and bioinformatics·2019
Same author

Fast Algorithms for Computing Path-Difference Distances.

IEEE/ACM transactions on computational biology and bioinformatics·2018
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Jul 5, 2026

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach
11:12

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Published on: September 11, 2017

Optimal algorithms for the interval location problem with range constraints on length and average.

Yong-Hsiang Hsieh1, Chih-Chiang Yu, Biing-Feng Wang

  • 1Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Taiwan. eric@cs.nthu.edu.tw

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|May 3, 2008
PubMed
Summary
This summary is machine-generated.

This study defines feasible intervals in real number sequences based on length and average value constraints. Optimal algorithms are developed for finding, counting, and locating these intervals, with applications in bioinformatics.

More Related Videos

Measuring Delay Discounting in Humans Using an Adjusting Amount Task
07:47

Measuring Delay Discounting in Humans Using an Adjusting Amount Task

Published on: January 9, 2016

Related Experiment Videos

Last Updated: Jul 5, 2026

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach
11:12

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Published on: September 11, 2017

Measuring Delay Discounting in Humans Using an Adjusting Amount Task
07:47

Measuring Delay Discounting in Humans Using an Adjusting Amount Task

Published on: January 9, 2016

Area of Science:

  • Computational Biology
  • Algorithm Design
  • Data Analysis

Background:

  • Biomolecular sequences contain functionally significant regions like CpG islands.
  • Identifying these regions requires analyzing intervals within sequences based on specific criteria.
  • Existing methods may lack efficiency for large-scale sequence analysis.

Purpose of the Study:

  • To define and study the computational complexity of feasible interval problems.
  • To develop efficient algorithms for identifying, counting, and locating feasible intervals.
  • To provide a foundation for improved CpG island detection.

Main Methods:

  • Formal definition of feasible intervals based on length and average value constraints.
  • Analysis of time complexity using the comparison model, establishing an Omega(n log n) lower bound.
  • Development of optimal algorithms using geometric approaches.

Main Results:

  • Demonstration of an Omega(n log n) lower bound for all studied feasible interval problems.
  • Design of optimal, on-line algorithms for finding, counting, and locating feasible intervals.
  • Algorithms achieve O(n) space complexity.

Conclusions:

  • The proposed geometric algorithms are optimal for solving feasible interval problems.
  • These algorithms offer efficient solutions for tasks like CpG island identification.
  • The on-line nature and linear space complexity make them suitable for large datasets.