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

135
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...
135
The Distance Formula01:20

The Distance Formula

724
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
724
Distance Problem01:29

Distance Problem

134
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
134
Interference: Path Lengths01:10

Interference: Path Lengths

2.4K
Consider two sources of sound, that may or may not be in phase, emitting waves at a single frequency, and consider the frequencies to be the same.
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...
2.4K
Design Example: Measuring Distance Between Two Points with Obstructions01:10

Design Example: Measuring Distance Between Two Points with Obstructions

502
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...
502
Design Example: Alignment of a Road Line Using GIS01:17

Design Example: Alignment of a Road Line Using GIS

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

You might also read

Related Articles

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

Sort by
Same author

EMERALD-UI: an interactive web application to unveil novel protein biology hidden in the alternative alignment space.

Bioinformatics (Oxford, England)·2026
Same author

Multi-context seeds enable fast and high-accuracy read mapping.

Genome biology·2026
Same author

Minimum flow decomposition in graphs with cycles using integer linear programming.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2025
Same author

A single-cell, long-read, isoform-resolved case-control study of FTD reveals cell-type-specific and broad splicing dysregulation in human brain.

Cell reports·2025
Same author

A spatial long-read approach at near-single-cell resolution reveals developmental regulation of splicing and polyadenylation sites in distinct cortical layers and cell types.

Nature communications·2025
Same author

cONcat: Computational reconstruction of concatenated fragments from long Oxford Nanopore reads.

PloS one·2025
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
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

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

Related Experiment Video

Updated: Mar 24, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
07:45

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

6.8K

Gap Filling as Exact Path Length Problem.

Leena Salmela1, Kristoffer Sahlin2, Veli Mäkinen1

  • 11 Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki , Finland .

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|March 10, 2016
PubMed
Summary
This summary is machine-generated.

This study introduces a new dynamic programming method for genome assembly gap-filling, significantly improving the number and length of filled gaps in bacterial genomes compared to existing tools.

Keywords:
de novo assemblydynamic programminggap fillinggraph algorithms

More Related Videos

Fabricating Nanogaps by Nanoskiving
07:36

Fabricating Nanogaps by Nanoskiving

Published on: May 13, 2013

11.7K
Detection of Post-Replicative Gaps Accumulation and Repair in Human Cells Using the DNA Fiber Assay
10:32

Detection of Post-Replicative Gaps Accumulation and Repair in Human Cells Using the DNA Fiber Assay

Published on: February 3, 2022

8.3K

Related Experiment Videos

Last Updated: Mar 24, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
07:45

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

6.8K
Fabricating Nanogaps by Nanoskiving
07:36

Fabricating Nanogaps by Nanoskiving

Published on: May 13, 2013

11.7K
Detection of Post-Replicative Gaps Accumulation and Repair in Human Cells Using the DNA Fiber Assay
10:32

Detection of Post-Replicative Gaps Accumulation and Repair in Human Cells Using the DNA Fiber Assay

Published on: February 3, 2022

8.3K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Genome assembly involves filling gaps between DNA contigs.
  • This gap-filling problem is computationally challenging (NP-hard).

Purpose of the Study:

  • To develop a more efficient and accurate algorithm for genome gap-filling.
  • To compare the new algorithm against existing gap-filling tools.

Main Methods:

  • Developed a novel dynamic programming solution for the gap-filling problem.
  • Implemented practical optimizations for the algorithm.
  • Conducted experimental comparisons with popular gap-filling tools on bacterial assemblies.

Main Results:

  • The new method filled 76% more gaps and 136% more sequence length than the best previous tool.
  • The error rate of the newly filled sequence was comparable to existing methods.
  • The approach showed limitations in scaling to larger genomes.

Conclusions:

  • The developed dynamic programming approach offers a significant improvement for bacterial genome gap-filling.
  • While effective for smaller genomes, scalability remains a challenge for larger genomic datasets.