• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
For visually-impairedUser profile (HSE staff only)SearchMenu

Performance Guarantees of Greedy Hierarchical Algorithm for Shortest Common Superstring Problem

Student: Anna Shvetsova

Supervisor: Denis Moskvin

Faculty: St. Petersburg School of Physics, Mathematics, and Computer Science

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2020

Shortest Common Superstring is an NP-hard problem, which finds its application in DNA sequencing. As it often happens for problems from the NP-hard class, algorithms generating precise solutions can’t be used in practice due to their exponential complexity. Because of that approximation algorithms are widely used instead. Though their application puts some restrictions on the task (for instance, suboptimal solutions should be tolerated), they have proved to be quite effective and sometimes even precise. Unfortunately, though it has been almost 30 years since the first conjecture about the existence of a 2-optimal algorithm for the Shortest Common Superstring problem had been claimed, there is currently no polynomial algorithm which would be proven to satisfy this condition. Nevertheless, there are several algorithms whose efficiency hasn’t been studied yet, including the one this work concentrates on. Our study focuses on the recently published approximation algorithm for Shortest Common Superstring problem called Greedy Hierarchical Algorithm and aims to determine its approximation factor.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses