Patricia A. Evans

	2011
17		Patricia A. Evans: Finding common RNA pseudoknot structures in polynomial time. J. Discrete Algorithms 9(4): 335-343 (2011)
	2010
16		Duong Dai Doan, Patricia A. Evans: Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites. ISBRA 2010: 29-37
15		Duong Dai Doan, Patricia A. Evans: Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites. WABI 2010: 124-135
	2009
14		Rachita Sharma, Patricia A. Evans, Virendra Bhavsar: Mapping Transcription Factors from a Model to a Non-model Organism. IJCBS 2009: 160-166
13		Rachita Sharma, Patricia A. Evans, Virendrakumar C. Bhavsar: Transcription Factor mapping between Bacteria Genomes. I. J. Functional Informatics and Personalised Medicine 2(4): 424-441 (2009)
12		Patricia A. Evans, Todd Wareham, Rhonda Chaytor: Fixed-parameter tractability of anonymizing data by suppressing entries. J. Comb. Optim. 18(4): 362-375 (2009)
	2008
11		Rhonda Chaytor, Patricia A. Evans, Todd Wareham: Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. COCOA 2008: 23-31
	2007
10		Doan Dai Duong, Patricia A. Evans: A Haplotyping Algorithm for Non-recombinant Pedigree Data Containing Missing Members. BIBM 2007: 275-281
	2006
9		Patricia A. Evans: Finding Common RNA Pseudoknot Structures in Polynomial Time. CPM 2006: 223-232
	2005
8		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		Patricia A. Evans, Andrew D. Smith: Complexity of Approximating Closest Substring Problems. FCT 2003: 210-221
6		Patricia A. Evans, Andrew D. Smith: Toward Optimal Motif Enumeration. WADS 2003: 47-58
5		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		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		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		Rodney G. Downey, Patricia A. Evans, Michael R. Fellows: Parameterized Learning Complexity. COLT 1993: 51-57

Coauthor Index

1	Virendra Bhavsar	[14]
2	Virendrakumar C. Bhavsar (Virendra C. Bhavsar)	[13]
3	Hans L. Bodlaender	[2]
4	Rhonda Chaytor	[11] [12]
5	Duong Dai Doan	[15] [16]
6	Rodney G. Downey (Rod Downey)	[1]
7	Doan Dai Duong	[10]
8	Michael R. Fellows (Mike Fellows)	[1] [2]
9	Kenneth B. Kent	[8]
10	Jacqueline E. Rice	[8]
11	Sharon Van Schaick	[8]
12	Rachita Sharma	[13] [14]
13	Andrew D. Smith	[5] [6] [7]
14	Todd Wareham (Harold T. Wareham)	[4] [5] [11] [12]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page