#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1972

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Patricia A. Evans, Andrew D. Smith, Todd Wareham
- Theor. Comput. Sci.
- 2003

Problems associated with #nding strings that are within a speci#ed Hamming distance of a given set of strings occur in several disciplines. In this paper, we use techniques from parameterized complexity to assess non-polynomial time algorithmic options and complexity for the COMMON APPROXIMATE SUBSTRING (CAS) problem. Our analyses indicate under which… (More)

- Patricia A. Evans
- CPM
- 1999

- Patricia A. Evans, Andrew D. Smith
- WADS
- 2003

We present algorithms that reduce the time and space needed to solve problems of finding all motifs common to a set of sequences. In particular, we give algorithms that (1) require time and space linear in the size of the input, (2) succinctly encode the output so that the time and space requirements depend on the number of motifs, not directly on motif… (More)

- Patricia A. Evans, Andrew D. Smith
- FCT
- 2003

The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with a polynomial time approximation scheme [6]. In this paper, both this problem and its maximization complement, where instead the number of matches is maximized, are examined and… (More)

- Rhonda Baldwin, Patricia A. Evans, Todd Wareham
- COCOA
- 2008

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… (More)

- Andrew David Smith, Patricia A Evans, +6 authors Smith
- 2004

Discovering patterns in strings is a central task in analyzing molecular sequences. One pattern discovery problem is to find a pattern that occurs as a substring in each member of a given set of strings. Additionally, occurrences of this pattern are allowed to have up to some specified number of errors, so the occurrences may not exactly match the pattern.… (More)

- Janet K Kern, S Van Miller, Patricia A Evans, Madhukar H Trivedi
- Journal of autism and developmental disorders
- 2002

Secretin, a gastrointestinal (GI) hormone, was reported in a preliminary study to improve language and behavior in children with autism/pervasive developmental disorder (PDD) and chronic diarrhea. To determine the efficacy of secretin, we completed a double-blind, placebo-controlled, crossover (3 weeks) study in children with autism/PDD and various GI… (More)

We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using paratneterized problem reducibilities, we show that P-sized DNF (CNF) formulas can be exactly learned in time polynomial in the number of variables by extended equivalence queries if… (More)

- Patricia A. Evans
- J. Discrete Algorithms
- 2006