The Parameterized Complexity of p-Center Approximate Substring Problems

@inproceedings{Evans2001ThePC,
  title={The Parameterized Complexity of p-Center Approximate Substring Problems},
  author={Patricia A. Evans and A. David Smith and Harold Todd Wareham},
  year={2001}
}
Problems associated with nding strings that are within a speci ed Hamming distance of a given set of strings occur in several disciplines. All of the problems investigated are NP -hard and have varying levels of approximability. In this paper, we use techniques from parameterized computational complexity to assess non-polynomial time algorithmic options for three of these problems, namely p-exact substring (pes), approximate substring (1as), and p-approximate substring (pas). These problems… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Practical Algorithms for Universal DNA Primer Design: An Exercise in Algorithm Engineering (Poster Abstract)

  • P. Evans, T. Wareham
  • Sanko (eds.) Currents in Computational Molecular…
  • 2001
3 Excerpts

Similar Papers

Loading similar papers…