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

Coevolving solutions to the shortest common superstring problem.

Assaf Zaritsky1, Moshe Sipper

  • 1Department of Computer Science, Ben-Gurion University, P.O. Box 653, Beer-Sheva 84105, Israel. assafza@cs.bgu.ac.il

Bio Systems
|September 8, 2004
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

Data modeling the interplay between single-cell shape, single-cell protein expression, and tissue state.

Cell reports methods·2026
Same author

Ferroptosis induces heterogeneous death profiles that are controlled by lysosome rupture.

Developmental cell·2026
Same author

Cell context-dependent in silico organelle localization in label-free microscopy images.

Nature methods·2025
Same author

Anomaly detection for high-content image-based phenotypic cell profiling.

Cell systems·2025
Same author

Multimodal bioimaging across disciplines and scales: challenges, opportunities and breaking down barriers.

Npj imaging..·2025
Same author

Nanoneedles enable spatiotemporal lipidomics of living tissues.

Nature nanotechnology·2025
Same journal

The Quantum-to-Classical Transducer: A Thermodynamic and Quantum Mechanical Framework for the Emergence of Bioenergetics.

Bio Systems·2026
Same journal

Forward-backward gene expression binarization for boolean state inference over a known regulatory network.

Bio Systems·2026
Same journal

Partial-Label Metric Ceilings for Evaluating Gene Regulatory Networks Inferred from Single-Cell Foundation Models.

Bio Systems·2026
Same journal

The impedance mismatch theory: A non-equilibrium thermodynamic framework for a shared energetic stress pathway in neurodegeneration.

Bio Systems·2026
Same journal

Immune signal-status misclassification: A theoretical framework for biological status assignment and failed status resolution.

Bio Systems·2026
Same journal

Contextuality, incompatibility, and intra-system entanglement of mental markers: From cognition and decision making to medicine.

Bio Systems·2026
See all related articles

This study compares four algorithms for the shortest common superstring (SCS) problem. A novel cooperative-coevolutionary approach yielded the best results for finding the shortest superstring.

Area of Science:

  • Computational complexity theory
  • Bioinformatics algorithms
  • Stringology

Background:

  • The shortest common superstring (SCS) problem is a fundamental challenge in computer science, known to be NP-Complete.
  • Finding efficient solutions is crucial for applications in areas like genome assembly and pattern matching.
  • Existing methods often struggle with scalability and solution quality for large datasets.

Purpose of the Study:

  • To evaluate and compare the performance of four distinct algorithmic approaches for solving the SCS problem.
  • To introduce and assess a novel cooperative-coevolutionary algorithm against established methods.
  • To identify the most effective strategy for generating high-quality shortest common superstrings.

Main Methods:

  • Implementation and comparison of a standard genetic algorithm.

Related Experiment Videos

  • Development and testing of a novel cooperative-coevolutionary algorithm.
  • Benchmarking against a standard greedy algorithm.
  • Evaluation of a parallel coevolutionary-greedy approach.

    • Main Results:

    • The cooperative-coevolutionary approach demonstrated superior performance in generating shorter superstrings compared to the other methods.
    • The parallel coevolutionary-greedy approach also showed competitive results, highlighting the benefits of parallelization.
    • The standard genetic and greedy algorithms served as important benchmarks for performance comparison.

    Conclusions:

    • Coevolutionary strategies, particularly the novel cooperative approach, are highly effective for the shortest common superstring problem.
    • Further research into parallelization and hybrid methods can enhance solution efficiency and quality.
    • The findings provide valuable insights for selecting and developing algorithms for SCS and related string problems.