Shortest consistent superstrings computable in polynomial time

DOI10.1016/0304-3975(95)80027-7zbMATH Open0873.68040OpenAlexW4245301300MaRDI QIDQ673640FDOQ673640

Authors: Juan-Miguel Gracia 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)80027-7

Recommendations

• Approximating shortest superstrings with constraints
• Approximating shortest superstrings with constraints
• Approximating Shortest Superstrings
• Consistent subsequences and supersequences

zbMATH Keywords

DNA sequencingsuperstring problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• A theory of the learnable
• Title not available (Why is that?)
• Title not available (Why is that?)
• On finding minimal length superstrings
• Approximating shortest superstrings with constraints
• String Noninclusion Optimization Problems
• On the complexity of learning strings and sequences
• DNA sequencing and string learning

Cited In (5)

• Approximating shortest superstrings with constraints
• Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
• Finding the longest common nonsuperstring in linear time
• A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem
• A new graph model and algorithms for consistent superstring problems

This page was built for publication: Shortest consistent superstrings computable in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673640)