List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Finding common RNA pseudoknot structures in polynomial time Journal of Discrete Algorithms | 2012-01-04 | Paper |
| Toward optimal motif enumeration. Lecture Notes in Computer Science | 2010-04-20 | Paper |
| Complexity of approximating closest substring problems. Lecture Notes in Computer Science | 2010-04-20 | Paper |
| Fixed-parameter tractability of anonymizing data by suppressing entries Journal of Combinatorial Optimization | 2010-02-24 | Paper |
| Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries Combinatorial Optimization and Applications | 2009-01-27 | Paper |
| Finding Common RNA Pseudoknot Structures in Polynomial Time Combinatorial Pattern Matching | 2007-09-14 | Paper |
| scientific article; zbMATH DE number 2185647 (Why is no real title available?) | 2005-07-04 | Paper |
| On the complexity of finding common approximate substrings. Theoretical Computer Science | 2004-03-14 | Paper |
| Algorithms for learning and teaching sets of vertices in graphs (available as arXiv preprint) | N/A | Paper |
Research outcomes over time
This page was built for person: Patricia A. Evans
