and Related Problems Jens Gramm + Rolf Niedermeier...  Home/Search
Context
Related
| lti.informatik.rwthaachen...closest.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 field of consensus word analysis with particular importance for computational biology. (Update)
Similar documents (at the sentence level):
19.4%: Exact Solutions for Closest String - And Related Problems (Correct)
19.1%: Exact Solutions for Closest String and Related Problems - Gramm, Niedermeier.. (2001) (Correct)
8.4%: Invitation to Fixed-Parameter Algorithms - Niedermeier (2002) (Correct)
Active bibliography (related documents): More All
1.0: On Exact and Approximation Algorithms for Distinguishing.. - Gramm, Guo, Niedermeier (2003) (Correct)
0.6: Hardness results for the center and median string problems.. - Nicolas, Rivals (2005) (Correct)
0.5: Genome Informatics 15(2): 21--30 (2004) 21 Computational.. - Conservation In Groups (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ problems-fixedparameter,
author = "And Related Problems",
title = "Fixed-Parameter Algorithms for Closest String",
url = "citeseer.ist.psu.edu/750362.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1999 ACM
189 Parameterized Complexity - Downey, Fellows - 1999 ACM
100 Integer programming with a fixed number of variables (context) - Lenstra - 1983
65 Asymptotic enumeration methods - Odlyzko - 1995 ACM
49 Minkowski's convex body theorem and integer programming (context) - Kannan - 1987 ACM
46 Computational Molecular Biology: An Algorithmic Approach (context) - Pevzner - 2000
36 Finding motifs using random projections - Buhler, Tompa - 2002 ACM DBLP
30 Faster exact solutions for hard problems: a parameterized po.. (context) - Alber, Gramm et al. - 2001
20 Combinatorial approaches to finding subtle signals in DNA se.. - Pevzner, Sze - 2000 ACM DBLP
14 Parameterized complexity: the main ideas and some research f.. (context) - Fellows - 2001 DBLP
14 Algorithms for phylogenetic footprinting - Blanchette, Schwikowski et al. - 2002 ACM DBLP
14 Distinguishing string selection problems - Lanctot, Li et al. - 1999 ACM DBLP
13 Point lattices (context) - Lagarias - 1995 ACM
13 Theory of Computing Systems (context) - Frances, Litman et al. - 1997
10 A lineartime algorithm for the 1-mismatch problem (context) - Stojanovic, Berman et al. - 1997
10 A general method to speed up fixed-parametertractable algori.. - Niedermeier, Rossmanith - 2000
9 Wolsey Integer and Combinatorial Optimization (context) - Nemhauser - 1988
8 the Closest String and Substring Problems - Li, Ma et al. - 2002
5 the parameterized intractability of Closest Substring and re.. - Fellows, Gramm et al. - 2002
4 Banishing bias from consensus sequences (context) - Ben-Dor, Lancia et al. - 1997 ACM DBLP
3 Rapid large-scale oligonucleotide selection for microarrays (context) - Rahmann - 2002 ACM DBLP
2 Comparison of five methods for finding conserved sequences i.. (context) - Stojanovic, Florea et al. - 1999
2 cient approximation algorithms for the Hamming center proble.. (context) - Gasieniec, Jansson et al. - 1999
2 center approximate substring problems (context) - Evans, Smith et al. - 2001
1 Practical algorithms for universal DNA primer design: an exe.. (context) - Evans, Wareham - 2001
1 and motif search (context) - Gramm, Hu et al. - 2002
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