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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

44
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
44
Design Example: Alignment of a Road Line Using GIS01:17

Design Example: Alignment of a Road Line Using GIS

43
The alignment of a road line using Geographic Information Systems (GIS) is a critical process in civil engineering, combining advanced technology with practical decision-making. This methodology begins with the collection of geospatial data, including information on land cover, geomorphology, drainage patterns, slope, and contour details. Such data is typically acquired through satellite imagery and GIS tools, offering a comprehensive understanding of the terrain.Once the data is gathered, it...
43
Design Example: Measuring Distance Between Two Points with Obstructions01:10

Design Example: Measuring Distance Between Two Points with Obstructions

28
When measuring distances in areas with physical obstructions, such as a lake in a field, surveyors must employ techniques to calculate accurate lengths without direct line measurements. One effective method is the offset technique, which allows for precise distance estimation over inaccessible stretches.In this scenario, a surveyor must measure a side of an area that crosses a lake. Since the measuring tape cannot span the lake, the surveyor begins by establishing a baseline that aligns with...
28
Areas Within Irregular Boundaries01:26

Areas Within Irregular Boundaries

68
Calculating areas within irregular boundaries, such as along rivers or curved roads, is crucial in various fields, including surveying, engineering, and environmental management. Surveyors often begin by creating a traverse, a connected series of straight lines approximating the area's boundary. The coordinates of each traverse point are essential for calculating the enclosed area. The double meridian distance formula is a widely used technique for this purpose. This method utilizes the...
68
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

99
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...
99
Manipulation and Analysis01:21

Manipulation and Analysis

21
GIS manipulation and analysis functions are vital for decision-making and planning. These activities range from data retrieval tasks, such as selecting information based on specific criteria, to advanced analytical techniques that address complex spatial problems.One critical GIS analysis method is overlaying, which combines multiple data layers to examine impacts. For example, overlaying a river-dammed lake boundary with road networks can identify affected infrastructure. Another common...
21

You might also read

Related Articles

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

Sort by
Same author

seq2ribo: structure-aware integration of machine learning and simulation to predict ribosome location profiles from RNA sequences.

Bioinformatics (Oxford, England)·2026
Same author

Fast, accurate construction of multiple sequence alignments from protein language embeddings.

bioRxiv : the preprint server for biology·2026
Same author

CodonRL: Multi-Objective Codon Sequence Optimization Using Demonstration-Guided Reinforcement Learning.

bioRxiv : the preprint server for biology·2026
Same author

seq2ribo: Structure-aware integration of machine learning and simulation to predict ribosome location profiles from RNA sequences.

bioRxiv : the preprint server for biology·2026
Same author

Augmenting Electronic Health Records for Adverse Event Detection.

medRxiv : the preprint server for health sciences·2026
Same author

ARCADE: Controllable Codon Design from Foundation Models via Activation Engineering.

bioRxiv : the preprint server for biology·2025

Related Experiment Video

Updated: Jun 11, 2025

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation
11:41

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation

Published on: February 1, 2020

20.3K

Approximate and Exact Optimization Algorithms for the Beltway and Turnpike Problems with Duplicated, Missing,

C S Elder1, Minh Hoang2, Mohsen Ferdosi1

  • 1Ray and Stephanie Lane Computational Biology Department, Carnegie Mellon University, Pittsburgh Pennsylvania, USA.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|October 10, 2024
PubMed
Summary

The Turnpike problem reconstructs point sets from distance data. New optimization algorithms efficiently solve noisy Turnpike instances, improving scalability and accuracy for biological applications.

Keywords:
BeltwayDistance ProblemInverse ProblemOptimizationTurnpike

More Related Videos

Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street
14:55

Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street

Published on: January 20, 2023

3.2K
Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

12.9K

Related Experiment Videos

Last Updated: Jun 11, 2025

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation
11:41

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation

Published on: February 1, 2020

20.3K
Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street
14:55

Evaluating the Effect of Roadside Parking on a Dual-Direction Urban Street

Published on: January 20, 2023

3.2K
Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

12.9K

Area of Science:

  • Computational Biology
  • Optimization
  • Bioinformatics

Background:

  • The Turnpike problem involves reconstructing one-dimensional point sets from pairwise distances, crucial for molecular structure, genomics, and mass spectrometry.
  • Traditional algorithms struggle with noisy distance data, leading to NP-hard complexity and exponential time/space requirements.

Purpose of the Study:

  • To reframe the noisy Turnpike problem as an optimization task, simultaneously determining point locations and distance permutations.
  • To develop robust and scalable algorithms for solving the Turnpike problem, including extensions for real-world constraints and variations like the Beltway problem.

Main Methods:

  • A novel bilevel optimization framework designed for efficient Turnpike problem solving, capable of handling large datasets (up to 100,000 points).
  • Extension of the framework to accommodate domain-specific constraints such as duplicated, missing, or partially labeled distances.
  • Formulation of an integer linear program (ILP) for small-scale problems requiring global optimality, featuring a generic convex objective and an extended formulation to minimize binary variables.

Main Results:

  • Bilevel algorithms demonstrate state-of-the-art scalability on synthetic and real partial digest data, matching or surpassing existing methods.
  • The ILP efficiently recovers ground-truth assignments and achieves high-quality reconstructions on small-scale instances.
  • Algorithms successfully extended to solve the Beltway problem (points on a circle) and handle various data imperfections.

Conclusions:

  • The developed optimization-based approach offers a robust and scalable solution for the noisy Turnpike problem and its variants.
  • The bilevel framework and ILP provide effective tools for molecular structure determination and other bioinformatics applications.
  • Open-source implementations are available, facilitating further research and application.