Genetic Design of Drugs Without Side-Effects

No abstract is available for this paper.

• Publication year

  2003

• Venue

  SIAM journal on computing (Print)

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/S0097539701397825
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distinguishing string selection problems

  2003influential reference
• On the approximability of trade-offs and optimal access of Web sources

  2000cited by this paper
• A Polynomial Time Approximation Scheme for the Closest Substring Problem

  2000cited by this paper
• On the closest string and substring problems

  2000cited by this paper
• Efficient approximation algorithms for the Hamming center problem

  1999cited by this paper
• Finding similar regions in many strings

  1999cited by this paper
• Banishing Bias from Consensus Sequences

  1997cited by this paper
• Primer Master: a new program for the design and analysis of PCR primers

  1996cited by this paper
• Polynomial-Time Algorithms for Computing Characteristic Strings

  1994cited by this paper
• Design of primers for PCR amplification of highly variable genomes

  1993cited by this paper
• An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes

  1991cited by this paper

• LP-based heuristics for the distinguishing string and substring selection problems

  2021cites this paper
• Algorithms for Closest and Farthest String Problems via Rank Distance

  2019cites this paper
• Consensus Strings with Small Maximum Distance and Small Distance Sum

  2019cites this paper
• Knowledge Transfer between Computer Vision and Text Mining

  2016cites this paper
• State-of-the-Art Approaches for String and Text Analysis

  2016cites this paper
• Generalized closest substring encryption

  2015cites this paper
• Randomized Fixed-Parameter Algorithms for the Closest String Problem

  2014cites this paper
• Randomized and Parameterized Algorithms for the Closest String Problem

  2014cites this paper
• Consensus string matching problem and the diagnosis of allelic heterogeneity

  2014cites this paper
• Complexity Issues on PTAS

  2013cites this paper
• String Selection Problems

  2013cites this paper
• The Multivariate Algorithmic Revolution and Beyond

  2012influential citation
• An efficient RNA interference screening strategy for gene functional analysis

  2012cites this paper
• On the Closest String via Rank Distance

  2012cites this paper
• On Approximating String Selection Problems with Outliers

  2012cites this paper
• Parameterized Complexity and Subexponential-Time Computability

  2012cites this paper
• An Efficient Rank Based Approach for Closest String and Closest Substring

  2012cites this paper
• Closest string with outliers

  2011cites this paper
• The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity

  2011cites this paper
• A Genetic Approximation of Closest String via Rank Distance

  2011cites this paper
• On the Hardness of Counting and Sampling Center Strings

  2010cites this paper
• A Meta Heuristic Solution for Closest String Problem Using Ant Colony System

  2010cites this paper
• Combinatorial and Probabilistic Approaches to Motif Recognition

  2010influential citation
• A three-string approach to the closest string problem

  2010cites this paper
• Why Large Closest String Instances Are Easy to Solve in Practice

  2010cites this paper
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems

  2009cites this paper
• Closest String and Substring Problems

  2008cites this paper
• Addressing Bio-sequence and Bio-structure Problems

  2008cites this paper
• More Efficient Algorithms for Closest String and Substring Problems

  2008cites this paper
• Mathematical Programming in Computational Biology: an Annotated Bibliography

  2008cites this paper
• On Parameterized Intractability: Hardness and Completeness

  2008influential citation
• Influenza a virus informatics: genotype-centered database and genotype annotation

  2007cites this paper
• Parameterized Graph Problems in Computational Biology

  2007cites this paper
• Identification of Distinguishing Motifs

  2007cites this paper
• Maximum common subgraph: some upper bound and lower bound results

  2006cites this paper
• Maximum Common Subgraph: Upper Bound and Lower Bound Results

  2006cites this paper
• Parameterized Intractability of Distinguishing Substring Selection

  2006influential citation
• Lower Bounds and Parameterized Approach for Longest Common Subsequence

  2006cites this paper
• Parameterized Computation of LCS for Two Sequences

  2006cites this paper
• Strong computational lower bounds via parameterized complexity

  2006cites this paper
• Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness

  2005cites this paper
• Applications of Parameterized Computation in Computational Biology

  2005cites this paper
• Parameterized algorithms and computational lower bounds: a structural approach

  2005cites this paper
• Parameterized complexity and polynomial-time approximation schemes

  2004cites this paper
• Linear FPT reductions and computational lower bounds

  2004cites this paper
• Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms

  2004cites this paper
• A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract)

  2004cites this paper
• Parameterized Intractability of Motif Search Problems

  2002cites this paper
• Dust in the wind.

  2002cites this paper
• Ieee/acm Transactions on Computational Biology and Bioinformatics 1 Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (l, D)-motif Model

  year unknowncites this paper