Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with - Closest string - Document - PDFSEARCH.IO

First Page	Meta Content
	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Document Date: 2014-06-14 17:20:02 Open Document File Size: 606,33 KB Share Result on Facebook Company J. ACM SIAM Journal / / Facility City University of Hong Kong / University of Waterloo L. Wang / / IndustryTerm candidate solution / fixed-parameter algorithms / chosen candidate solution / / Organization University of Waterloo / City University of Hong Kong / / Person Zhi-Zhong Chen Tokyo / / ProgrammingLanguage FP / / Technology Approximation algorithms / bioinformatics / fixed-parameter algorithms / randomized algorithm / previous FP algorithms / / SocialTag Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science

Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint withAdd to Reading List