Patricia A. Evans

发表

What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective

Todd Wareham, Patricia A. Evans, Iris A.L.M. van Rooij, 2011, J. Probl. Solving.

Fixed-parameter tractability of anonymizing data by suppressing entries

Todd Wareham, Patricia A. Evans, Rhonda Baldwin, 2009, J. Comb. Optim..

Dynamic parallelization for RNA structure comparison

Patricia A. Evans, Eric Aubanel, Eric Snow, 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

Transcription Factor mapping between Bacteria Genomes

Patricia A. Evans, Virendrakumar C. Bhavsar, Rachita Sharma, 2009, Int. J. Funct. Informatics Pers. Medicine.

INFORMATION SYSTEMS IN ADOT: AN ANALYSIS OF INTRA-FUNCTION FLOW, DECISION SUPPORT NEEDS, EXISTING SYSTEMS UTILITY AND USER ATTITUDES. VOLUME II: MANUAL FOR EVALUATION OF NEEDS AND ATTITUDES OF EDP USERS

Patricia A. Evans, William C. Moor, James E. Bailey, 1985 .

Finding Common Subsequences with Arcs and Pseudoknots

Patricia A. Evans, 1999, CPM.

Finding Common RNA Secondary Structures: A Case Study on the Dynamic Parallelization of a Data-driven Recurrence

Patricia A. Evans, Eric Aubanel, Steven T. Stewart, 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

Toward Optimal Motif Enumeration

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

INFORMATION SYSTEMS IN ADOT: AN ANALYSIS OF INTRA-FUNCTION FLOW, DECISION SUPPORT NEEDS, EXISTING SYSTEMS UTILITY AND USER ATTITUDES. VOLUME III: APPENDICES

Patricia A. Evans, William C. Moor, James E. Bailey, 1985 .

Finding common RNA pseudoknot structures in polynomial time

Patricia A. Evans, 2011, J. Discrete Algorithms.

Algorithms and complexity for annotated sequence analysis

Michael R. Fellows, Patricia A. Evans, Frank Ruskey, 1999 .

Finite-State Computability of Annotations of Strings and Trees

Michael R. Fellows, Patricia A. Evans, Hans L. Bodlaender, 1996, CPM.

An instrument for measuring effectiveness of information systems

Patricia A. Evans, William C. Moor, James E. Bailey, 1988 .

Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries

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

A Haplotyping Algorithm for Non-recombinant Pedigree Data Containing Missing Members

Patricia A. Evans, Doan Dai Duong, D. D. Duong, 2007, 2007 IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2007).

Efficient Restricted‐Case Algorithms for Problems in Computational Biology

Patricia A. Evans, H. Todd Wareham, H. Wareham, 2010 .

Evaluation of the Utilization of Information Systems in the Arizona D.O.T.

Patricia A. Evans, James E. Bailey, Ardell L. Roberts, 1987 .

Finding common RNA pseudoknot structures in polynomial time

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

Parameterized learning complexity

Michael R. Fellows, Rodney G. Downey, Patricia A. Evans, 1993, COLT '93.

Mapping Transcription Factors from a Model to a Non-model Organism

Patricia A. Evans, Virendrakumar C. Bhavsar, Rachita Sharma, 2009, 2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing.

A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees

Patricia A. Evans, Joseph Douglas Horton, Duong Dai Doan, 2010, J. Comput. Biol..

An FPT haplotyping algorithm on pedigrees with a small number of sites

Patricia A. Evans, Duong Dai Doan, D. D. Doan, 2011, Algorithms for Molecular Biology.

Regulatory link mapping between organisms

Patricia A. Evans, Virendrakumar C. Bhavsar, Rachita Sharma, 2011, BMC Systems Biology.

On the complexity of finding common approximate substrings

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

Complexity of Approximating Closest Substring Problems

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

Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites

Patricia A. Evans, Duong Dai Doan, D. D. Doan, 2010, WABI.