Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs

del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the overlap equivalence problem for realistic strings: when do two different realistic legal strings translate into the same overlap graph? Realistic legal strings are legal strings that “really” correspond to genes generated during the gene assembly process.

• Type: Conference
• Year: 2004
• Where: BIRTHDAY
• Authors: Tero Harju, Ion Petre, Grzegorz Rozenberg
• Keywords: Applied Computing, BIRTHDAY 2004, Legal Strings, Overlap Graph, Realistic Legal Strings