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 |
|---|---|---|
| Complexity of approximating closest substring problems. Lecture Notes in Computer Science | 2010-04-20 | Paper |
| Toward optimal motif enumeration. Lecture Notes in Computer Science | 2010-04-20 | Paper |
| On the complexity of finding common approximate substrings. Theoretical Computer Science | 2004-03-14 | Paper |
Research outcomes over time
This page was built for person: Andrew D. Smith
