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

Short superstrings and the structure of overlapping strings

C Armen1, C Stein

  • 1Department of Computer Science, Dartmouth College, Hanover, NH 03755-3510, 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

Reframing AI for Rare Disease Recognition.

Research square·2026
Same author

Leveraging Generative AI to Prioritize Drug Repurposing Candidates: Validating Identified Candidates for Alzheimer's Disease in Real-World Clinical Datasets.

Research square·2023
Same author

Global, Regional, and National Levels and Trends in Burden of Oral Conditions from 1990 to 2017: A Systematic Analysis for the Global Burden of Disease 2017 Study.

Journal of dental research·2020
Same author

[No evidence for naloxone-induced "enhancement" of receptor sensitivity and long-term use of opioids in chronic nontumor pain].

Schmerz (Berlin, Germany)·2019
Same author

[Pain inhibition by opioids-new concepts].

Schmerz (Berlin, Germany)·2019
Same author

[Pain inhibition by opioids-new concepts].

Der Anaesthesist·2019

Researchers developed a new algorithm for the shortest superstring problem, improving approximation ratios. This algorithm identifies string overlaps to construct shorter superstrings efficiently.

Area of Science:

  • Computational biology
  • Computer science
  • Data compression
  • String algorithms

Background:

  • The shortest superstring problem aims to find a minimum-length string containing all given strings as substrings.
  • This NP-hard problem has significant applications in computational biology and data compression.
  • Existing approximation algorithms offer constant-factor guarantees but offer limited insight into string overlap structures.

Purpose of the Study:

  • To investigate the structure of strings with substantial overlap.
  • To develop a novel algorithm for the shortest superstring problem based on this structural understanding.
  • To improve the approximation ratio for the shortest superstring problem.

Main Methods:

  • Analyzing the structure of strings with large overlaps.

Related Experiment Videos

  • Developing a new algorithm focusing on identifying and utilizing significant string similarities.
  • Proving properties of short periodic strings to characterize potential overlaps.

    • Main Results:

    • An algorithm is presented that finds a superstring within 2.75 times the optimal length.
    • The algorithm achieves a time complexity of O(|S| + n^3).
    • New insights into the structure of overlapping periodic strings are provided.

    Conclusions:

    • The study offers a deeper understanding of string overlap structures.
    • The developed algorithm provides an improved approximation for the shortest superstring problem.
    • The findings contribute to more efficient solutions in computational biology and data compression.