Shortest consistent superstrings computable in polynomial time

DOI10.1016/0304-3975(95)80027-7zbMath0873.68040OpenAlexW4245301300MaRDI QIDQ673640

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

zbMATH Keywords

DNA sequencingsuperstring problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

A new graph model and algorithms for consistent superstring problems ⋮ Finding the longest common nonsuperstring in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of learning strings and sequences
• On finding minimal length superstrings
• Approximating shortest superstrings with constraints
• DNA sequencing and string learning
• A theory of the learnable
• String Noninclusion Optimization Problems

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