Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
H. Todd Wareham
Observed names:
H. T. WAREHAM,
H. T. Wareham,
H. TODD WAREHAM,
H.T. Wareham,
H.Todd Wareham,
Harold T. Wareham,
Harold Todd Wareham,
Wareham, H.T.
show all 8
Institutions:
Memorial University of Newfoundland,
Donders Institute for Brain, Cognition and Behaviour,
University of Amsterdam
Observed institutions:
Memorial University of Newfoundland,
Radboud University Nijmegen,
Utrecht University,
University of Victoria,
Victoria University of Wellington,
Donders Institute for Brain, Cognition and Behaviour,
University of Amsterdam,
McMaster University
show all 8
OpenAlex ID:
A5022101310
Parameterized complexity analysis in computational biology
1995
·
H.L. Bodlaender
, R.G. Downey
, et al.
·
Computer applications in the biosciences
·
106
PDF
The parameterized complexity of sequence alignment and consensus
1995
·
Hans L. Bodlaender
, Rodney G. Downey
, et al.
·
Theoretical Computer Science
·
105
PDF
On the complexity of finding common approximate substrings
2003
·
Patricia A. Evans
, Andrew D. Smith
, et al.
·
Theoretical Computer Science
·
64
PDF
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
2000
·
Hans L. Bodlaender
, Michael R. Fellows
, et al.
·
Theoretical Computer Science
·
49
PDF
The parameterized complexity of some problems in logic and linguistics
1994
·
Rodney G. Downey
, Michael R. Fellows
, et al.
·
Lecture notes in computer science
·
43
DNA physical mapping: Three ways difficult
1993
·
Michael R. Fellows
, Michael T. Hallett
, et al.
·
Lecture notes in computer science
·
41
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata
2001
·
H. Todd Wareham
·
Lecture notes in computer science
·
35
Similarity as tractable transformation
2009
·
Moritz Müller
, I.J.E.I. van Rooij
, et al.
·
eScholarship (California Digital Library)
·
34
PDF
Identifying Sources of Intractability in Cognitive Models: An Illustration Using Analogical Structure Mapping
2008
·
I.J.E.I. van Rooij
, Patricia Evans
, et al.
·
eScholarship (California Digital Library)
·
31
PDF
A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment
1995
·
H. TODD WAREHAM
·
Journal of Computational Biology
·
26
On the computational complexity of inferring evolutionary trees
1992
·
H. Todd Wareham
·
Memorial University Research Repository (Memorial University)
·
25
PDF
Parameterized complexity analysis in robot motion planning
2002
·
M. Cesati
, H.T. Wareham
·
Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics
·
19
Fixed-parameter tractability of anonymizing data by suppressing entries
2009
·
Patricia A. Evans
, H. Todd Wareham
, et al.
·
Journal of Combinatorial Optimization
·
17
The parameterized complexity of sequence alignment and consensus
1994
·
Hans Bodlaender
, Rodney G. Downey
, et al.
·
Lecture notes in computer science
·
12
The computational costs of recipient design and intention recognition in communication
2011
·
Mark Blokpoel
, Johan Kwisthout
, et al.
·
eScholarship (California Digital Library)
·
7
PDF
A compendium of parameterized complexity results
1994
·
Michael T. Hallett
, H. Todd Wareham
·
ACM SIGACT News
·
7
PDF
A Web Application for Generation of Random DNA Sequences with a Single Open Reading Frame: Exemplars for Genetics and Bioinformatics Education
2014
·
Steven M. Carr
, H. Todd Wareham
, et al.
·
CBE—Life Sciences Education
·
6
On the complexity of #nding common approximate substrings
2003
·
Patricia Evans
, Andrew D. Smith
, et al.
·
6
Optimal algorithms for local vertex quartet cleaning
2002
·
Gianluca Della Vedova
, H. Todd Wareham
·
Bioinformatics
·
5
PDF
Optimal algorithms for local vertex quartet cleaning
2002
·
Gianluca Della Vedova
, H. Todd Wareham
·
ACM Symposium on Applied Computing
·
5
Exact Algorithms for Computing Pairwise Alignments and 3-medians From Structure-annotated Sequences (extended Abstract)
2000
·
P. A. EVANS
, H. T. WAREHAM
·
Pacific Symposium on Biocomputing (PSB)
·
5
Tractable embodied computation needs embeddedness
2019
·
Iris van Rooij
, Mark Blokpoel
, et al.
·
3
Efficient Restricted‐Case Algorithms for Problems in Computational Biology
2010
·
Patricia A. Evans
, H. Todd Wareham
·
3
Stochastic Heuristic Algorithms for Target Motif Identification (extended Abstract)
1999
·
H. T. WAREHAM
, T. JIANG
, et al.
·
Pacific Symposium on Biocomputing (PSB)
·
1
Language computations. Ed. by Eric Sven Ristad. (DIMACS series in discrete mathematics and theoretical computer science, 17.) Providence, RI: American Mathematical Society, 1994. Pp. xiv, 198.
1996
·
H. Todd Wareham
·
Language
·
1
Show more works
View as search
Works count:
42
Citation count:
667
H-index:
13
I10-index:
14
Year
Topic
Type
