Randomized Fixed-Parameter Algorithms for the Closest String Problem

Given a set S = { s 1 , s 2 , … , s n } of strings of equal length L and an integer d , the closest string problem (CSP) requires the computation of a string s of length L such that d ( s , s i ) ≤ d for each s i ∈ S , where d ( s , s i ) is the Hamming distance between s and s i . The problem is NP...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 74; no. 1; pp. 466 - 484
Main Authors:	Chen, Zhi-Zhong, Ma, Bin, Wang, Lusheng
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2016
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Randomized algorithms Fixed-parameter algorithms The closest string problem Computational biology
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!