Search Results - "Wareham, H.Todd"

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    On the complexity of finding common approximate substrings

    On the complexity of finding common approximate substrings by Evans, Patricia A., Smith, Andrew D., Wareham, H.Todd

    Published in Theoretical computer science (05-09-2003)
    “…Problems associated with finding strings that are within a specified Hamming distance of a given set of strings occur in several disciplines. In this paper, we…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

    The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs by Bodlaender, Hans L., Fellows, Michael R., Hallett, Michael T., Wareham, H.Todd, Warnow, Tandy J.

    Published in Theoretical computer science (06-08-2000)
    “…In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: