An Algorithm for a Variation of the Shortest Common Superstring Problem
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916465682153472 |
|---|---|
| author | Gilfanov, Arthur |
| author_facet | Gilfanov, Arthur |
| contents | This study develops an algorithm to solve a variation of the Shortest Common Superstring (SCS) problem. There are two modifications to the base SCS problem. First, one string in the set S is allowed to have up to K mistakes, defined as not matching the SCS in at most K positions. Second, no string in S can be a substring of another in S. The algorithm proposed for the problem is exact. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_23900 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Algorithm for a Variation of the Shortest Common Superstring Problem Gilfanov, Arthur Data Structures and Algorithms Computational Complexity F.2.2 This study develops an algorithm to solve a variation of the Shortest Common Superstring (SCS) problem. There are two modifications to the base SCS problem. First, one string in the set S is allowed to have up to K mistakes, defined as not matching the SCS in at most K positions. Second, no string in S can be a substring of another in S. The algorithm proposed for the problem is exact. |
| title | An Algorithm for a Variation of the Shortest Common Superstring Problem |
| topic | Data Structures and Algorithms Computational Complexity F.2.2 |
| url | https://arxiv.org/abs/2410.23900 |