About the design of oligo-chips

DOI10.1016/j.dam.2004.06.020zbMath1062.68536OpenAlexW2110086970MaRDI QIDQ1766743

Alain Guénoche

Publication date: 8 March 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.06.020

zbMATH Keywords

Dynamical programmingOligo-chipSupersequence

Mathematics Subject Classification ID

Computer system organization (68M99)

Cites Work

• A linear-time algorithm for finding approximate shortest common superstrings
• The longest common subsequence problem revisited
• The shortest common supersequence problem over binary alphabet is NP- complete
• The Complexity of Some Problems on Subsequences and Supersequences

This page was built for publication: About the design of oligo-chips