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

Trial and Error and Algorithm01:12

Trial and Error and Algorithm

435
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...
435
Guidelines and Strategies for Safe Computer Charting01:18

Guidelines and Strategies for Safe Computer Charting

2.7K
The guidelines and strategies provided by the American Nurses Association (ANA) and the Canadian Nurses Association (CNA) offer essential principles for ensuring safe and secure computer charting systems in healthcare settings. Let's break down each recommendation:
Maintain Confidentiality and Security:
2.7K
Protein Complex Assembly02:41

Protein Complex Assembly

16.9K
Proteins can form homomeric complexes with another unit of the same protein or heteromeric complexes with different types.  Most protein complexes self-assemble spontaneously via ordered pathways, while some proteins need assembly factors that guide their proper assembly. Despite the crowded intracellular environment, proteins usually interact with their correct partners and form functional complexes.
Many viruses self-assemble into a fully functional unit using the infected host cell to...
16.9K
Spindle Assembly02:50

Spindle Assembly

4.4K
Spindle assembly occurs through three, often coexisting, pathways – the centrosome-mediated pathway, the chromatin-mediated pathway, and the microtubule-mediated pathway – collectively contributing to form a robust spindle apparatus.
In most cells, centrosomes are the primary microtubule nucleation centers. In the centrosome-mediated pathway, the G2-prophase transition triggers centrosome maturation and increased microtubule nucleation. Progressive nucleation results in a...
4.4K
Oligosaccharide Assembly01:24

Oligosaccharide Assembly

3.7K
Protein glycosylation starts in the ER lumen and continues in the Golgi apparatus. Glycosyltransferases catalyze the addition of sugar molecules or glycosylation of proteins. Usually, these enzymes add sugars to the hydroxyl groups of selected serine or threonine residues to form O-linked glycans or the amino groups of asparagine residues to form N-linked glycans. Different positions on the same polypeptide chain can contain differently linked glycans.
Multiple sugar molecules that may or may...
3.7K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

You might also read

Related Articles

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

Sort by
Same author

An FPTAS for Connectivity Interdiction.

Mathematical programming·2026
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

Spatial isoform sequencing at sub-micrometer single-cell resolution reveals novel patterns of spatial isoform variability in brain cell types.

bioRxiv : the preprint server for biology·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.

bioRxiv : the preprint server for biology·2025
Same author

Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs.

Bioinformatics (Oxford, England)·2025
Same author

Applying the Safe-And-Complete Framework to Practical Genome Assembly.

Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop)·2025
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Feb 14, 2026

Metagenomic Analysis of Silage
08:43

Metagenomic Analysis of Silage

Published on: January 13, 2017

19.1K

A safe and complete algorithm for metagenomic assembly.

Nidia Obscura Acosta1, Veli Mäkinen1, Alexandru I Tomescu1

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

Algorithms for Molecular Biology : AMB
|February 16, 2018
PubMed
Summary
This summary is machine-generated.

This study introduces a novel algorithm for metagenomic assembly, efficiently reconstructing bacterial genomes from short DNA fragments. The new method guarantees complete and safe genome reconstruction, setting a new benchmark for bioinformatics analysis.

Keywords:
Circular walkContig assemblyGenome assemblyGraph algorithmMetagenomics

More Related Videos

Large-Scale Screens of Metagenomic Libraries
16:05

Large-Scale Screens of Metagenomic Libraries

Published on: May 28, 2007

9.3K
A High Throughput Screen for Biomining Cellulase Activity from Metagenomic Libraries
10:21

A High Throughput Screen for Biomining Cellulase Activity from Metagenomic Libraries

Published on: February 1, 2011

16.5K

Related Experiment Videos

Last Updated: Feb 14, 2026

Metagenomic Analysis of Silage
08:43

Metagenomic Analysis of Silage

Published on: January 13, 2017

19.1K
Large-Scale Screens of Metagenomic Libraries
16:05

Large-Scale Screens of Metagenomic Libraries

Published on: May 28, 2007

9.3K
A High Throughput Screen for Biomining Cellulase Activity from Metagenomic Libraries
10:21

A High Throughput Screen for Biomining Cellulase Activity from Metagenomic Libraries

Published on: February 1, 2011

16.5K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Genome reconstruction from short fragments is a long-standing bioinformatics challenge.
  • Metagenomic assembly aims to reconstruct multiple bacterial genomes from complex sequencing samples.
  • This problem is modeled as finding circular walks in a directed graph G to cover its nodes or edges.

Purpose of the Study:

  • To develop a "safe and complete" algorithm for metagenomic assembly.
  • To provide graph-theoretic characterizations of "safe" walks in the context of metagenomic assembly.
  • To establish theoretical tight upper bounds for safe assembly from metagenomic data.

Main Methods:

  • Utilized the "safe and complete" framework by Tomescu and Medvedev.
  • Defined algorithms as "safe" if returned walks are present in all assembly solutions.
  • Defined safe algorithms as "complete" if they return all possible safe walks.

Main Results:

  • Provided graph-theoretic characterizations for safe walks in metagenomic assembly.
  • Developed a safe and complete algorithm to identify all safe walks.
  • Achieved time complexities of O(n+m) for node-covering and O(n log n + m) for edge-covering cases.

Conclusions:

  • The algorithm provides the first theoretical tight upper bound for safe metagenomic assembly.
  • This work advances the field of computational biology by offering efficient and reliable genome reconstruction methods.
  • The findings are crucial for accurately assembling genomes from diverse microbial communities.