Patricia A. Evans

24 papers A* 1A 1B 5C 3Misc 1Journal 8Unranked 4
YearRankTypeTitle / Venue / Authors
2012 — conf
Finding Common RNA Secondary Structures: A Case Study on the Dynamic Parallelization of a Data-driven Recurrence.
IPDPS Workshops
Steven T. Stewart, Eric Aubanel, Patricia A. Evans
2011 J jnl
An FPT haplotyping algorithm on pedigrees with a small number of sites.
Algorithms Mol. Biol.
Duong Dai Doan, Patricia A. Evans
2011 J jnl
Finding common RNA pseudoknot structures in polynomial time.
J. Discrete Algorithms
Patricia A. Evans
2011 J jnl
Regulatory link mapping between organisms.
BMC Syst. Biol.
Rachita Sharma, Patricia A. Evans, Virendrakumar C. Bhavsar
2011 J jnl
What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective.
J. Probl. Solving
Todd Wareham, Patricia A. Evans, Iris van Rooij
2010 J jnl
A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees.
J. Comput. Biol.
Duong Dai Doan, Patricia A. Evans, Joseph D. Horton
2010 — conf
Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites.
ISBRA
Duong Dai Doan, Patricia A. Evans
2010 C conf
Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites.
WABI
Duong Dai Doan, Patricia A. Evans
2009 A conf
Dynamic parallelization for RNA structure comparison.
IPDPS
Eric Snow, Eric Aubanel, Patricia A. Evans
2009 J jnl
Fixed-parameter tractability of anonymizing data by suppressing entries.
J. Comb. Optim.
Patricia A. Evans, Todd Wareham, Rhonda Chaytor
2009 — conf
Mapping Transcription Factors from a Model to a Non-model Organism.
IJCBS
Rachita Sharma, Patricia A. Evans, Virendra C. Bhavsar
2009 J jnl
Transcription Factor mapping between Bacteria Genomes.
Int. J. Funct. Informatics Pers. Medicine
Rachita Sharma, Patricia A. Evans, Virendrakumar C. Bhavsar
2008 C conf
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries.
COCOA
Rhonda Chaytor, Patricia A. Evans, Todd Wareham
2007 — conf
A Haplotyping Algorithm for Non-recombinant Pedigree Data Containing Missing Members.
BIBM
Doan Dai Duong, Patricia A. Evans
2006 B conf
Finding Common RNA Pseudoknot Structures in Polynomial Time.
CPM
Patricia A. Evans
2005 C conf
Hardware-Based Implementation of the Common Approximate Substring Algorithm.
DSD
Kenneth B. Kent, Sharon Van Schaick, Jacqueline E. Rice, Patricia A. Evans
2003 B conf
Complexity of Approximating Closest Substring Problems.
FCT
Patricia A. Evans, Andrew D. Smith
2003 J jnl
On the complexity of finding common approximate substrings.
Theor. Comput. Sci.
Patricia A. Evans, Andrew D. Smith, Harold T. Wareham
2003 B conf
Toward Optimal Motif Enumeration.
WADS
Patricia A. Evans, Andrew D. Smith
2001 Misc conf
Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract).
Pacific Symposium on Biocomputing
Patricia A. Evans, Harold T. Wareham
1999 — —
Algorithms and complexity for annotated sequence analysis.
Patricia A. Evans
1999 B conf
Finding Common Subsequences with Arcs and Pseudoknots.
CPM
Patricia A. Evans
1996 B conf
Finite-State Computability of Annotations of Strings and Trees.
CPM
Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
1993 A* conf
Parameterized Learning Complexity.
COLT
Rodney G. Downey, Patricia A. Evans, Michael R. Fellows