| Introducing Phon: A software solution for the study of phonological acquisition Y Rose, B MacWhinney, R Byrne, G Hedlund, K Maddocks, P O'Brien, ... Proceedings of the... Annual Boston University Conference on Language …, 2006 | 144 | 2006 |
| Parameterized complexity analysis in computational biology HL Bodlaender, RG Downey, MR Fellows, MT Hallett, HT Wareham Bioinformatics 11 (1), 49-57, 1995 | 135 | 1995 |
| The parameterized complexity of sequence alignment and consensus HL Bodlaender, RG Downey, MR Fellows, HT Wareham Theoretical Computer Science 147 (1-2), 31-54, 1995 | 91 | 1995 |
| Quartet cleaning: improved algorithms and simulations V Berry, T Jiang, P Kearney, M Li, T Wareham European Symposium on Algorithms, 313-324, 1999 | 89 | 1999 |
| On the complexity of finding common approximate substrings PA Evans, AD Smith, HT Wareham Theoretical Computer Science 306 (1-3), 407-430, 2003 | 83 | 2003 |
| DNA physical mapping: Three ways difficult MR Fellows, MT Hallett, HT Wareham European Symposium on Algorithms, 157-168, 1993 | 74 | 1993 |
| Bayesian intractability is not an ailment that approximation can cure. J Kwisthout, T Wareham, I van Rooij Cogn. Sci. 35 (5), 779-784, 2011 | 68 | 2011 |
| A practical algorithm for recovering the best supported edges of an evolutionary tree V Berry, D Bryant, T Jiang, PE Kearney, M Li, T Wareham, H Zhang SODA, 287-296, 2000 | 66 | 2000 |
| The parameterized complexity of some problems in logic and linguistics RG Downey, MR Fellows, BM Kapron, MT Hallett, HT Wareham International Symposium on Logical Foundations of Computer Science, 89-100, 1994 | 63 | 1994 |
| Intentional communication: Computationally easy or difficult? I Van Rooij, J Kwisthout, M Blokpoel, J Szymanik, T Wareham, I Toni Frontiers in Human Neuroscience 5, 52, 2011 | 60 | 2011 |
| Practical algorithms for universal DNA primer design: an exercise in algorithm engineering P Evans, HT Wareham Currents in Computational Molecular Biology, 25-26, 2001 | 59 | 2001 |
| Systematic parameterized complexity analysis in computational phonology HT Wareham | 57 | 1998 |
| The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs HL Bodlaender, MR Fellows, MT Hallett, HT Wareham, TJ Warnow Theoretical Computer Science 244 (1-2), 167-188, 2000 | 55 | 2000 |
| Community-based influence maximization in social networks under a competitive linear threshold model A Bozorgi, S Samet, J Kwisthout, T Wareham Knowledge-Based Systems 134, 149-158, 2017 | 53 | 2017 |
| Parameterized complexity in cognitive modeling: Foundations, applications and opportunities I Van Rooij, T Wareham The Computer Journal 51 (3), 385-404, 2008 | 48 | 2008 |
| Intractability and the use of heuristics in psychological explanations I Van Rooij, CD Wright, T Wareham Synthese 187 (2), 471-487, 2012 | 40 | 2012 |
| On the computational complexity of inferring evolutionary trees HT Wareham Memorial University of Newfoundland, 1992 | 35 | 1992 |
| Ancestral maximum likelihood of evolutionary trees is hard L Addario-Berry, B Chor, M Hallett, J Lagergren, A Panconesi, T Wareham Journal of Bioinformatics and Computational Biology 2 (02), 257-271, 2004 | 32 | 2004 |
| The parameterized complexity of intersection and composition operations on sets of finite-state automata HT Wareham International Conference on Implementation and Application of Automata, 302-310, 2000 | 32 | 2000 |
| A simplified proof of the NP-and MAX SNP-hardness of multiple sequence tree alignment HT Wareham Journal of Computational Biology 2 (4), 509-514, 1995 | 30 | 1995 |
