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 Experiment Videos

Toward simplifying and accurately formulating fragment assembly

E W Myers1

  • 1Department of Computer Science, University of Arizona, Tucson 85721, USA.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|January 1, 1995
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Design of a compartmentalized shotgun assembler for the human genome.

Bioinformatics (Oxford, England)·2001
Same author

The sequence of the human genome.

Science (New York, N.Y.)·2001
Same author

The genome sequence of Drosophila melanogaster.

Science (New York, N.Y.)·2000
Same author

A whole-genome assembly of Drosophila.

Science (New York, N.Y.)·2000
Same author

Identifying satellites and periodic repetitions in biological sequences.

Journal of computational biology : a journal of computational molecular cell biology·1998
Same author

Xlandscape: the graphical display of word frequencies in sequences.

Bioinformatics (Oxford, England)·1998
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

This study reformulates the DNA fragment assembly problem, moving beyond shortest string reconstruction to a maximum-likelihood approach. New graph-theoretic methods and reduction transformations efficiently solve complex assembly challenges.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • The DNA fragment assembly problem involves reconstructing a DNA sequence from numerous randomly sampled fragments.
  • Traditional methods aiming for the shortest superstring can lead to overcompression, especially with repetitive sequences.

Purpose of the Study:

  • To propose a novel maximum-likelihood formulation for DNA fragment assembly using the Kolmogorov-Smirnov statistic.
  • To address limitations of shortest-string objectives in handling repetitive DNA sequences.

Main Methods:

  • Reformulation of the fragment assembly problem using a maximum-likelihood approach based on the two-sided Kolmogorov-Smirnov statistic.
  • Recasting the problem in graph-theoretic terms, focusing on finding specific noncyclic subgraphs.

Related Experiment Videos

  • Development of graph reduction transformations to decrease computational complexity for NP-hard problems.

    • Main Results:

    • The maximum-likelihood formulation provides a more robust approach to DNA sequence reconstruction.
    • Graph reduction techniques significantly simplify complex assembly problems, making them computationally tractable.
    • Transformed problems are solvable with branch-and-bound algorithms, allowing integration of experimental constraints.

    Conclusions:

    • The proposed maximum-likelihood framework offers an improved solution for DNA fragment assembly, particularly for repetitive sequences.
    • Efficient graph reduction and branch-and-bound algorithms enable practical and accurate DNA sequence reconstruction.
    • The methodology facilitates the incorporation of auxiliary experimental data like overlap, orientation, and distance constraints.