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

DNA as a Genetic Template02:05

DNA as a Genetic Template

9.9K
9.9K
DNA as a Genetic Template02:05

DNA as a Genetic Template

28.5K
Two structural features of the DNA molecule provide a basis for the mechanisms of heredity: the four nucleotide bases and its double-stranded nature. The Watson-Crick model of double-helical DNA structure, proposed in 1952, drew heavily upon the X-ray crystallography work of researchers Rosalind Franklin and Maurice Wilkins. Watson, Crick, and Wilkins jointly received the Nobel Prize in Physiology or Medicine for their work in 1962. Franklin was, controversially, excluded from the prize for...
28.5K
Combining Functions01:16

Combining Functions

326
Functions can be combined to form new mathematical models that describe interactions between variables. These combinations are fundamental in understanding relationships between changing quantities and are commonly encountered in scientific and engineering contexts. The combination methods—addition, subtraction, multiplication, division, and composition—each have unique implications for the resulting function’s domain and behavior.When combining functions through arithmetic...
326
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

13.6K
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...
13.6K
Translesion DNA Polymerases02:10

Translesion DNA Polymerases

11.6K
Translesion (TLS) polymerases rescue stalled DNA polymerases at sites of damaged bases by replacing the replicative polymerase and installing a nucleotide across the damaged site. Doing so, TLS allows additional time for the cell to repair the damage before resuming regular DNA replication.
TLS polymerases are found in all three domains of life - archaea, bacteria, and eukaryotes. Of the different classes of TLS polymerases, members of the Y family are fitted with specialized structures that...
11.6K
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

18.6K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
18.6K

You might also read

Related Articles

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

Sort by
Same author

Distinct predictive factors for acute severe ulcerative colitis in East Asian and Western populations.

Inflammatory bowel diseases·2026
Same author

Advances in Crohn's Disease: A Comprehensive Review of Pathophysiology, Diagnosis, and Emerging Therapeutics.

JGH open : an open access journal of gastroenterology and hepatology·2026
Same author

Australian Real-World Effectiveness and Safety of Ustekinumab for the Treatment of Crohn's Disease: Results of the AURORA Study, Including the ANZIBD Consortium.

JGH open : an open access journal of gastroenterology and hepatology·2025
Same author

Cost-effective inflammatory bowel disease flare pathway with nurse-led triage and rapid access intestinal ultrasound reduces hospital resource use with high patient satisfaction.

Journal of Crohn's & colitis·2025
Same author

Acute Severe Ulcerative Colitis Patients From Asia Have Lower Colectomy Risk Than Patients From Australasia.

Clinical gastroenterology and hepatology : the official clinical practice journal of the American Gastroenterological Association·2025
Same author

Upadacitinib and vedolizumab combination therapy for the management of refractory ulcerative colitis and Crohn's disease.

Intestinal research·2025
Same journal

Topological dependence of viral mutation spread in complex host-interaction networks.

Chaos (Woodbury, N.Y.)·2026
Same journal

Multifractal signatures of Hamiltonian chaos in Hyperion's rotational dynamics.

Chaos (Woodbury, N.Y.)·2026
Same journal

Exploring mechanisms for reversal of flow in tunicate hearts.

Chaos (Woodbury, N.Y.)·2026
Same journal

State estimation in spatiotemporal chaos via low-rank StatFEM.

Chaos (Woodbury, N.Y.)·2026
Same journal

Universal response functions in driven dissipative tunneling dynamics.

Chaos (Woodbury, N.Y.)·2026
Same journal

A network-based approach to characterize the dynamics of the coupling field of thermoacoustic oscillators in annular geometry.

Chaos (Woodbury, N.Y.)·2026
See all related articles

Related Experiment Video

Updated: Mar 23, 2026

Rapid, Enzymatic Methods for Amplification of Minimal, Linear Templates for Protein Prototyping using Cell-Free Systems
07:35

Rapid, Enzymatic Methods for Amplification of Minimal, Linear Templates for Protein Prototyping using Cell-Free Systems

Published on: June 14, 2021

3.3K

Algorithms for concatenating templates.

Robert Gilmore1, Martin Rosalie2

  • 1Physics Department, Drexel University, Philadelphia, Pennsylvania 19104, USA.

Chaos (Woodbury, N.Y.)
|April 3, 2016
PubMed
Summary
This summary is machine-generated.

This study introduces two algorithms for concatenating branched manifolds using linking matrices. These methods handle different representations, enabling seamless integration and description switching.

More Related Videos

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

12.2K
DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
09:26

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

4.9K

Related Experiment Videos

Last Updated: Mar 23, 2026

Rapid, Enzymatic Methods for Amplification of Minimal, Linear Templates for Protein Prototyping using Cell-Free Systems
07:35

Rapid, Enzymatic Methods for Amplification of Minimal, Linear Templates for Protein Prototyping using Cell-Free Systems

Published on: June 14, 2021

3.3K
Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

12.2K
DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
09:26

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

4.9K

Area of Science:

  • Mathematics
  • Topology
  • Computational Geometry

Background:

  • Branched manifolds are complex topological objects.
  • Representations of branched manifolds often involve linking matrices.
  • Existing methods for concatenating these structures can be limited.

Purpose of the Study:

  • To develop algorithms for concatenating branched manifolds.
  • To support two common linking matrix representations: arrays and single matrices.
  • To provide methods for converting between these representations.

Main Methods:

  • Algorithm development for manifold concatenation.
  • Implementation of linking matrix manipulation.
  • Design of conversion routines between representation types.

Main Results:

  • Two distinct algorithms for branched manifold concatenation are presented.
  • The algorithms successfully handle both array-based and single linking matrix representations.
  • Efficient methods for switching between the two linking matrix descriptions are provided.

Conclusions:

  • The developed algorithms offer a flexible and robust approach to branched manifold concatenation.
  • These methods enhance the computational treatment of branched manifolds.
  • The ability to switch representations simplifies data handling and analysis.