The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Patricia A. Evans: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rodney G. Downey, Patricia A. Evans, Michael R. Fellows
    Parameterized Learning Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:51-57 [Conf]
  2. Patricia A. Evans
    Finding Common RNA Pseudoknot Structures in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:223-232 [Conf]
  3. Patricia A. Evans
    Finding Common Subsequences with Arcs and Pseudoknots. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:270-280 [Conf]
  4. Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
    Finite-State Computability of Annotations of Strings and Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:384-391 [Conf]
  5. Kenneth B. Kent, Sharon Van Schaick, Jacqueline E. Rice, Patricia A. Evans
    Hardware-Based Implementation of the Common Approximate Substring Algorithm. [Citation Graph (0, 0)][DBLP]
    DSD, 2005, pp:314-321 [Conf]
  6. Patricia A. Evans, Andrew D. Smith
    Complexity of Approximating Closest Substring Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:210-221 [Conf]
  7. Patricia A. Evans, Harold T. Wareham
    Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2001, pp:559-570 [Conf]
  8. Patricia A. Evans, Andrew D. Smith
    Toward Optimal Motif Enumeration. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:47-58 [Conf]
  9. Patricia A. Evans, Andrew D. Smith, Harold T. Wareham
    On the complexity of finding common approximate substrings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:407-430 [Journal]

  10. Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites. [Citation Graph (, )][DBLP]


  11. Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites. [Citation Graph (, )][DBLP]


  12. Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. [Citation Graph (, )][DBLP]


  13. A Haplotyping Algorithm for Non-recombinant Pedigree Data Containing Missing Members. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002