default search action
Patricia A. Evans
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c15]Steven T. Stewart, Eric Aubanel, Patricia A. Evans:
Finding Common RNA Secondary Structures: A Case Study on the Dynamic Parallelization of a Data-driven Recurrence. IPDPS Workshops 2012: 715-724 - 2011
- [j8]Duong Dai Doan, Patricia A. Evans:
An FPT haplotyping algorithm on pedigrees with a small number of sites. Algorithms Mol. Biol. 6: 8 (2011) - [j7]Rachita Sharma, Patricia A. Evans, Virendrakumar C. Bhavsar:
Regulatory link mapping between organisms. BMC Syst. Biol. 5(S-1): S4 (2011) - [j6]Patricia A. Evans:
Finding common RNA pseudoknot structures in polynomial time. J. Discrete Algorithms 9(4): 335-343 (2011) - [j5]Todd Wareham, Patricia A. Evans, Iris van Rooij
:
What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective. J. Probl. Solving 3(2) (2011) - 2010
- [j4]Duong Dai Doan, Patricia A. Evans, Joseph D. Horton:
A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees. J. Comput. Biol. 17(10): 1451-1465 (2010) - [c14]Duong Dai Doan, Patricia A. Evans:
Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites. ISBRA 2010: 29-37 - [c13]Duong Dai Doan, Patricia A. Evans:
Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites. WABI 2010: 124-135
2000 – 2009
- 2009
- [j3]Rachita Sharma, Patricia A. Evans, Virendrakumar C. Bhavsar:
Transcription Factor mapping between Bacteria Genomes. Int. J. Funct. Informatics Pers. Medicine 2(4): 424-441 (2009) - [j2]Patricia A. Evans, Todd Wareham, Rhonda Chaytor:
Fixed-parameter tractability of anonymizing data by suppressing entries. J. Comb. Optim. 18(4): 362-375 (2009) - [c12]Rachita Sharma, Patricia A. Evans, Virendra C. Bhavsar:
Mapping Transcription Factors from a Model to a Non-model Organism. IJCBS 2009: 160-166 - [c11]Eric Snow, Eric Aubanel, Patricia A. Evans:
Dynamic parallelization for RNA structure comparison. IPDPS 2009: 1-8 - 2008
- [c10]Rhonda Chaytor, Patricia A. Evans, Todd Wareham:
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. COCOA 2008: 23-31 - 2007
- [c9]Doan Dai Duong, Patricia A. Evans:
A Haplotyping Algorithm for Non-recombinant Pedigree Data Containing Missing Members. BIBM 2007: 275-281 - 2006
- [c8]Patricia A. Evans:
Finding Common RNA Pseudoknot Structures in Polynomial Time. CPM 2006: 223-232 - 2005
- [c7]Kenneth B. Kent
Hardware-Based Implementation of the Common Approximate Substring Algorithm. DSD 2005: 314-321 - 2003
- [j1]Patricia A. Evans, Andrew D. Smith
On the complexity of finding common approximate substrings. Theor. Comput. Sci. 306(1-3): 407-430 (2003) - [c6]Patricia A. Evans, Andrew D. Smith:
Complexity of Approximating Closest Substring Problems. FCT 2003: 210-221 - [c5]Patricia A. Evans, Andrew D. Smith:
Toward Optimal Motif Enumeration. WADS 2003: 47-58 - 2001
- [c4]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
1990 – 1999
- 1999
- [b1]Patricia A. Evans:
Algorithms and complexity for annotated sequence analysis. University of Victoria, Canada, 1999 - [c3]Patricia A. Evans:
Finding Common Subsequences with Arcs and Pseudoknots. CPM 1999: 270-280 - 1996
- [c2]Hans L. Bodlaender
Finite-State Computability of Annotations of Strings and Trees. CPM 1996: 384-391 - 1993
- [c1]Rodney G. Downey, Patricia A. Evans, Michael R. Fellows:
Parameterized Learning Complexity. COLT 1993: 51-57
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: