| 2008 |
|---|
| 11 | EE | Rhonda Chaytor,
Patricia A. Evans,
Todd Wareham:
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries.
COCOA 2008: 23-31 |
| 2007 |
|---|
| 10 | EE | Doan Dai Duong,
Patricia A. Evans:
A Haplotyping Algorithm for Non-recombinant Pedigree Data Containing Missing Members.
BIBM 2007: 275-281 |
| 2006 |
|---|
| 9 | EE | Patricia A. Evans:
Finding Common RNA Pseudoknot Structures in Polynomial Time.
CPM 2006: 223-232 |
| 2005 |
|---|
| 8 | EE | Kenneth B. Kent,
Sharon Van Schaick,
Jacqueline E. Rice,
Patricia A. Evans:
Hardware-Based Implementation of the Common Approximate Substring Algorithm.
DSD 2005: 314-321 |
| 2003 |
|---|
| 7 | EE | Patricia A. Evans,
Andrew D. Smith:
Complexity of Approximating Closest Substring Problems.
FCT 2003: 210-221 |
| 6 | EE | Patricia A. Evans,
Andrew D. Smith:
Toward Optimal Motif Enumeration.
WADS 2003: 47-58 |
| 5 | EE | Patricia A. Evans,
Andrew D. Smith,
Harold T. Wareham:
On the complexity of finding common approximate substrings.
Theor. Comput. Sci. 306(1-3): 407-430 (2003) |
| 2001 |
|---|
| 4 | EE | Patricia A. Evans,
Harold T. Wareham:
Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract).
Pacific Symposium on Biocomputing 2001: 559-570 |
| 1999 |
|---|
| 3 | EE | Patricia A. Evans:
Finding Common Subsequences with Arcs and Pseudoknots.
CPM 1999: 270-280 |
| 1996 |
|---|
| 2 | | Hans L. Bodlaender,
Michael R. Fellows,
Patricia A. Evans:
Finite-State Computability of Annotations of Strings and Trees.
CPM 1996: 384-391 |
| 1993 |
|---|
| 1 | EE | Rodney G. Downey,
Patricia A. Evans,
Michael R. Fellows:
Parameterized Learning Complexity.
COLT 1993: 51-57 |
