Patricia A. Evans

According to our database1, Patricia A. Evans authored at least 22 papers between 1993 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Finding Common RNA Secondary Structures: A Case Study on the Dynamic Parallelization of a Data-driven Recurrence.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2011
What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective.
J. Probl. Solving, 2011

Finding common RNA pseudoknot structures in polynomial time.
J. Discrete Algorithms, 2011

Regulatory link mapping between organisms.
BMC Syst. Biol., 2011

An FPT haplotyping algorithm on pedigrees with a small number of sites.
Algorithms Mol. Biol., 2011

2010
A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees.
J. Comput. Biol., 2010

Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites.
Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010

2009
Fixed-parameter tractability of anonymizing data by suppressing entries.
J. Comb. Optim., 2009

Transcription Factor mapping between Bacteria Genomes.
Int. J. Funct. Informatics Pers. Medicine, 2009

Dynamic parallelization for RNA structure comparison.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Mapping Transcription Factors from a Model to a Non-model Organism.
Proceedings of the International Joint Conferences on Bioinformatics, 2009

2007
A Haplotyping Algorithm for Non-recombinant Pedigree Data Containing Missing Members.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2007

2005
Hardware-Based Implementation of the Common Approximate Substring Algorithm.
Proceedings of the Eighth Euromicro Symposium on Digital Systems Design (DSD 2005), 30 August, 2005

2003
On the complexity of finding common approximate substrings.
Theor. Comput. Sci., 2003

Toward Optimal Motif Enumeration.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Complexity of Approximating Closest Substring Problems.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2001
Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract).
Proceedings of the 6th Pacific Symposium on Biocomputing, 2001

1999
Algorithms and complexity for annotated sequence analysis.
PhD thesis, 1999

Finding Common Subsequences with Arcs and Pseudoknots.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1996
Finite-State Computability of Annotations of Strings and Trees.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1993
Parameterized Learning Complexity.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993


  Loading...