Shortest consistent superstrings computable in polynomial time

DOI10.1016/0304-3975(95)80027-7MaRDI QIDQ673640zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

DNA sequencingsuperstring problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• A theory of the learnable
• Approximating shortest superstrings with constraints
• DNA sequencing and string learning
• On finding minimal length superstrings
• On the complexity of learning strings and sequences
• String Noninclusion Optimization Problems

Cited in

(5)

• Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
• 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
• Approximating shortest superstrings with constraints
• Finding the longest common nonsuperstring in linear time

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)