Exact and kernelization algorithms for Closet String

In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an NP-hard problem. This paper proposes two line...

Full description

Saved in:

Bibliographic Details
Published in:	Selecciones matemáticas : revista científica del Departamento Académico de Matemáticas Vol. 7; no. 2; pp. 257 - 266
Main Author:	Latorre, Omar
Format:	Journal Article
Language:	English
Published:	Universidad Nacional de Trujillo 30.12.2020
Subjects:	Algoritmo de parámetro fijo Algoritmo exacto Closest String Problem Combinatorial Optimization Exact Algorithm Fixed Parameter Algorithm Kernelización Kernelization Optimización combinatoria Problema de la subsecuencia de caracteres más próxima
ISSN:	2411-1783, 2411-1783
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!