Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Shortest superstring problem"”.

  1. Algorithms for exact solutions to combinatorial optimization problems

    The Shortest Superstring Problem (SSP) is a combinatorial optimization problem which has attracted the interest of many researchers due to its applications. It can be applied in computational molecular biology problems such as DNA sequencing, and in computer science problems such as string …

    greece Repository record for Algorithms for exact solutions to combinatorial optimization problems (opens in a new tab)