Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis

DOI10.1007/978-3-540-69733-6_27zbMath1148.68416OpenAlexW1791665180MaRDI QIDQ3511336

Ján Maňuch, Chris Thachuk, Anne Condon

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10)

Related Items (4)

Computing equality-free and repetitive string factorisations ⋮ Computing Equality-Free String Factorisations ⋮ String factorisations with maximum or minimum dimension ⋮ The complexity of string partitioning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms on Strings, Trees and Sequences
• A variant of a recursively unsolvable problem

This page was built for publication: Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis