Related Experiment Video
Updated: Aug 23, 2025

Novel Sequence Discovery by Subtractive Genomics
Published on: January 25, 2019
On a greedy approach for genome scaffolding
Tom Davot1, Annie Chateau2,3, Rohan Fossé4
1LIRMM, Univ. Montpellier, Montpellier, France. tom.davot@lirmm.fr.
Background:
Scaffolding is a bioinformatics problem aimed at completing the contig assembly process by determining the relative position and orientation of these contigs. It can be seen as a paths and cycles cover problem of a particular graph called the "scaffold graph".
Results:
We provide some NP-hardness and inapproximability results on this problem. We also adapt a greedy approximation algorithm on complete graphs so that it works on a special class aiming to be close to real instances. The described algorithm is the first polynomial-time approximation algorithm designed for this problem on non-complete graphs.
Conclusion:
Tests on a set of simulated instances show that our algorithm provides better results than the version on complete graphs.
More Related Videos
12:08Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies
Published on: August 20, 2021
08:03Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
Published on: December 7, 2021
Related Concept Videos
Genome Annotation and Assembly
Evolutionary Relationships through Genome Comparisons
Gene Duplication and Divergence
The duplicated copies of the gene are called Paralogs. Paralogs with similar sequences and functions form a gene family. Across several species, a large number of gene families are...
Genomic DNA in Eukaryotes
Genomics
Sanger Sequencing