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

Collisions in Multiple Dimensions: Problem Solving01:06

Collisions in Multiple Dimensions: Problem Solving

4.3K
In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
4.3K
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

133
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
133
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

11.4K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
11.4K
Coordination Number and Geometry02:57

Coordination Number and Geometry

16.5K
For transition metal complexes, the coordination number determines the geometry around the central metal ion. Table 1 compares coordination numbers to molecular geometry. The most common structures of the complexes in coordination compounds are octahedral, tetrahedral, and square planar.
16.5K
Collisions in Multiple Dimensions: Introduction01:05

Collisions in Multiple Dimensions: Introduction

5.5K
It is far more common for collisions to occur in two dimensions; that is, the initial velocity vectors are neither parallel nor antiparallel to each other. Let's see what complications arise from this. The first idea is that momentum is a vector. Like all vectors, it can be expressed as a sum of perpendicular components (usually, though not always, an x-component and a y-component, and a z-component if necessary). Thus, when the statement of conservation of momentum is written for a...
5.5K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

You might also read

Related Articles

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

Sort by
Same author

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same author

Cannabidiol in Digital Fatigue: Neuroadaptive Mechanisms and Therapeutic Perspectives on Chronic Screen Exposure.

CNS & neurological disorders drug targets·2026
Same author

Synergistic Interplay Between Probiotic-coated Nanoparticles and Antimicrobial Peptides in Food Biochemistry: Engineering Bioremediation Agents for Heavy Metal Detoxification.

Recent advances in food, nutrition & agriculture·2026
Same author

Immunomodulatory Nanocarriers in Multiple Sclerosis: Dual Targeting of Microglia and Mitochondria for Precision Neurotherapy.

Anti-inflammatory & anti-allergy agents in medicinal chemistry·2026
Same author

Polythiophene Nanocomposites as Smart and Sustainable Materials: Advancements in Energy, Environmental, and Biomedical Technologies.

Anti-inflammatory & anti-allergy agents in medicinal chemistry·2026
Same author

Emerging Frontiers in Prostate Cancer Diagnostics: Nanolaser-Guided Nanotechnology and Computational Biology for Biomarker Surveillance.

Anti-cancer agents in medicinal chemistry·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
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: Aug 22, 2025

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

11.9K

Algorithms for Colinear Chaining with Overlaps and Gap Costs.

Chirag Jain1, Daniel Gibney2, Sharma V Thankachan3

  • 1Department of Computational and Data Sciences, Indian Institute of Science, Bengaluru, India.

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

We developed efficient algorithms for colinear chaining with anchor overlaps and gap costs, significantly improving DNA sequence alignment. This method connects chaining cost to edit distance, enabling faster computation.

Keywords:
alignmentcolinear chainingedit distance

More Related Videos

Operation of the Collaborative Composite Manufacturing CCM System
10:09

Operation of the Collaborative Composite Manufacturing CCM System

Published on: October 1, 2019

6.7K
Associated Chromosome Trap for Identifying Long-range DNA Interactions
14:49

Associated Chromosome Trap for Identifying Long-range DNA Interactions

Published on: April 23, 2011

14.5K

Related Experiment Videos

Last Updated: Aug 22, 2025

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

11.9K
Operation of the Collaborative Composite Manufacturing CCM System
10:09

Operation of the Collaborative Composite Manufacturing CCM System

Published on: October 1, 2019

6.7K
Associated Chromosome Trap for Identifying Long-range DNA Interactions
14:49

Associated Chromosome Trap for Identifying Long-range DNA Interactions

Published on: April 23, 2011

14.5K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Colinear chaining is a key heuristic for aligning long DNA sequences, used in seed-chain-extend alignment strategies.
  • Existing algorithms struggle with subquadratic time complexity for general chaining problems involving anchor overlaps and gap costs.

Purpose of the Study:

  • To present efficient subquadratic time algorithms for the colinear chaining problem with anchor overlaps and gap costs.
  • To establish a theoretical link between colinear chaining cost and edit distance.
  • To demonstrate the computational speed and accuracy of the proposed method compared to edit distance.

Main Methods:

  • Developed algorithms to solve the colinear chaining problem in O(n log n) time, where n is the number of anchors.
  • Proved that optimal anchored edit distance equals optimal colinear chaining cost under a specific cost function.
  • Conducted experiments to compare the computational time and correlation with edit distance.

Main Results:

  • Achieved subquadratic time complexity for colinear chaining with anchor overlaps and gap costs.
  • Established a theoretical equivalence between colinear chaining cost and anchored edit distance.
  • Experimental results show orders of magnitude faster computation than edit distance with a correlation coefficient >0.9.

Conclusions:

  • The proposed algorithms provide an efficient solution for colinear chaining in DNA sequence alignment.
  • The theoretical connection to edit distance offers new insights into sequence alignment costs.
  • The method significantly accelerates alignment computation while maintaining high accuracy.