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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 74; číslo 1; s. 466 - 484
Hlavní autoři:	Chen, Zhi-Zhong, Ma, Bin, Wang, Lusheng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2016
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms. Fixed-parameter algorithms provide the most practical solutions to its real-life applications in bioinformatics. In this paper we develop the first randomized fixed-parameter algorithms for CSP. Not only are the randomized algorithms much simpler than their deterministic counterparts, their time complexities are also significantly better than the previously best known (deterministic) algorithms.
ISSN:	0178-4617 1432-0541
DOI:	10.1007/s00453-014-9952-y