and Related Problems Jens Gramm, Rolf Niedermeier, and Peter Rossmanith...  Home/Search
Context
Related
| lti.informatik.rwtha...gramm01exact.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lti.informatik....lications.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Closest String is one of the core problems in the eld of consensus word analysis with particular importance for computational biology. Given k strings of same length and a positive integer d, nd a \closest string" s such that none of the given strings has Hamming distance greater than d from s. Closest String is NP-complete. We show how to solve Closest String in linear time for constant d (the exponential growth is O(d )). We extend this result to the closely related problems... (Update)
Similar documents (at the sentence level):
26.5%: Fixed-Parameter Algorithms for Closest String - And Related Problems (Correct)
13.2%: Invitation to Fixed-Parameter Algorithms - Niedermeier (2002) (Correct)
Active bibliography (related documents): More All
1.0: Exact Solutions for Closest String and Related Problems - Gramm, Niedermeier.. (2001) (Correct)
0.5: On the Parameterized Intractability of Closest.. - Fellows, Gramm.. (2002) (Correct)
0.2: Fast Algorithms for Finding Maximum-Density Segments of a.. - Goldwasser, Kao, Lu (2002) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ problems-exact,
author = "And Related Problems",
title = "Exact Solutions for Closest String",
url = "citeseer.ist.psu.edu/749832.html" }
Citations (may not include all citations):189 Parameterized Complexity - Downey, Fellows - 1999
49 Minkowski's convex body theorem and integer programming (context) - Kannan - 1987
46 Computational Molecular Biology: An Algorithmic Approach (context) - Pevzner - 2000
30 Faster exact solutions for hard problems: a parameterized po.. (context) - Alber, Gramm et al. - 2001
25 Integer programming with a xed number of variables (context) - Lenstra - 1983
17 Finding similar regions in many strings - Li, Ma et al. - 1999
14 Distinguishing string selection problems - Lanctot, Li et al. - 1999
13 Point lattices (context) - Lagarias - 1995
13 Theory of Computing Systems (context) - Frances, Litman et al. - 1997
10 A linear-time algorithm for the 1-mismatch problem (context) - Stojanovic, Berman et al. - 1997
4 Comparison of ve methods for nding conserved sequences in mu.. (context) - Stojanovic, Florea et al. - 1999
3 Practical non-polynomial time algorithms for designing unive.. (context) - Evans, Wareham - 2001
Documents on the same site (http://www-lti.informatik.rwth-aachen.de/pub/publications.shtml): More
New Upper Bounds for Maximum Satisfiability - Niedermeier, Rossmanith (2000) (Correct)
k-Variable Pattern Languages Efficiently Stochastically.. - Rossmanith, Zeugmann (1998) (Correct)
A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC