Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Maxam-Gilbert Sequencing

Maxam-Gilbert Sequencing

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

Signal Sequences and Sorting Receptors

Signal Sequences and Sorting Receptors

Signal sequences are short amino acid sequences that guide newly synthesized proteins to their proper location within the cell. Classical signal sequences are fifteen to sixty amino acids long and present at the N-terminus of a polypeptide chain. Each signal sequence has a conserved segment of basic residues towards their N terminus, a hydrophobic core, and a C-terminus rich in polar residues. The C-terminus also contains a signal cleavage site and features a -3 -1 sequence motif. The -3-1...

Next-generation Sequencing

Next-generation Sequencing

The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....

Sanger Sequencing

Sanger Sequencing

DNA sequencing is a fundamental technique that is routinely used in the biological sciences. This method can be applied to a range of questions at different scales - from the sequencing of a cloned DNA fragment or the study of a mutation in a gene up to whole-genome sequencing. However, despite the widespread use of sequencing today, it was not until 1977 that Fredrick Sanger and his collaborators developed the chain-termination method to decode DNA sequences. It relies on the separation of a...

Mitochondrial Precursor Proteins

Mitochondrial Precursor Proteins

Mitochondrial precursors are partially unfolded or loosely folded polypeptide chains. Newly synthesized precursors are inhibited from spontaneously folding into their native conformation by the cytosolic chaperones, heat shock proteins 70 (Hsp70), and mitochondrial import stimulation factors (MSFs). Precursors bound to MSFs are guided to the TOM70-TOM37 receptors, while precursors bound to Hsp70 chaperones are targetted to TOM20-TOM22 receptor complexes.
Most of the mitochondrial...

RNA-seq

RNA-seq

RNA sequencing, or RNA-Seq, is a high-throughput sequencing technology used to study the transcriptome of a cell. Transcriptomics helps to interpret the functional elements of a genome and identify the molecular constituents of an organism. Additionally, it also helps in understanding the development of an organism and the occurrence of diseases.
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while...

You might also read

Related Articles

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

Sort by

Same journal

Some Fast Algorithms for Curves in Surfaces.

Discrete & computational geometry·2026

Same journal

A Full Halin Grid Theorem.

Discrete & computational geometry·2026

Same journal

Stability and Inference of the Euler Characteristic Transform.

Discrete & computational geometry·2026

Same journal

Error Resilient Space Partitioning.

Discrete & computational geometry·2026

Same journal

A Faithful Discretization of Verbose Directional Transforms.

Discrete & computational geometry·2026

Same journal

Maximum Betti Numbers of Čech Complexes.

Discrete & computational geometry·2026

See all related articles

Search research articles

Related Experiment Video

Updated: May 21, 2025

The Peel-Blot Technique: A Cryo-EM Sample Preparation Method to Separate Single Layers From Multi-Layered or Concentrated Biological Samples

The Peel-Blot Technique: A Cryo-EM Sample Preparation Method to Separate Single Layers From Multi-Layered or Concentrated Biological Samples

Published on: June 29, 2022

Peeling Sequences.

Adrian Dumitrescu¹, Géza Tóth²

¹Algoresearch L.L.C., Milwaukee, WI USA.

Discrete & Computational Geometry

|March 20, 2025

Summary

This summary is machine-generated.

This study explores the minimum number of ways to sequentially remove points from a set while always removing a point from the convex hull. The minimum number of ways is shown to be roughly between O(n^2) and O(n^3).

Keywords:

Convexity Integer sequence Recursive construction

More Related Videos

Stomata Tape-Peel: An Improved Method for Guard Cell Sample Preparation

Stomata Tape-Peel: An Improved Method for Guard Cell Sample Preparation

Published on: July 15, 2018

Identification of the Genes Involved in Stomatal Development via Epidermal Phenotype Scoring

Identification of the Genes Involved in Stomatal Development via Epidermal Phenotype Scoring

Published on: January 20, 2023

Related Experiment Videos

Last Updated: May 21, 2025

The Peel-Blot Technique: A Cryo-EM Sample Preparation Method to Separate Single Layers From Multi-Layered or Concentrated Biological Samples

The Peel-Blot Technique: A Cryo-EM Sample Preparation Method to Separate Single Layers From Multi-Layered or Concentrated Biological Samples

Published on: June 29, 2022

Stomata Tape-Peel: An Improved Method for Guard Cell Sample Preparation

Stomata Tape-Peel: An Improved Method for Guard Cell Sample Preparation

Published on: July 15, 2018

Identification of the Genes Involved in Stomatal Development via Epidermal Phenotype Scoring

Identification of the Genes Involved in Stomatal Development via Epidermal Phenotype Scoring

Published on: January 20, 2023

Area of Science:

Computational Geometry
Combinatorics
Geometric Algorithms

Background:

Convex hull algorithms are fundamental in computational geometry.
Understanding point removal processes is crucial for analyzing geometric structures.
The number of ways to process geometric objects can reveal underlying combinatorial properties.

Purpose of the Study:

To determine the minimum number of ways to sequentially remove points from a set in general position.
To analyze the combinatorial complexity of convex hull peeling processes.
To establish bounds for the minimum number of valid point removal sequences.

Main Methods:

Investigating point sets in general position in a 2D plane.
Analyzing the process of iteratively removing points from the convex hull of the remaining set.
Deriving combinatorial formulas and bounds based on geometric configurations.

Main Results:

The maximum number of ways occurs when points are in convex position, resulting in n! sequences.
The minimum number of ways for n points is established to be between approximately O(n^2) and O(n^3).
The number of ways is highly dependent on the specific geometric arrangement of the points.

Conclusions:

The minimum number of convex hull peeling sequences provides a measure of the 'non-convexity' of a point set.
This research contributes to understanding the combinatorial landscape of geometric algorithms.
The derived bounds offer insights into the efficiency and complexity of geometric processing tasks.