Michael T. Hallett - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2011

Simultaneous Identification of Duplications and Lateral Gene TransfersAli Tofigh, Michael T. Hallett, Jens Lagergren. tcbb, 8(2):517-535, 2011. [doi]

2010

A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series DataTheodore J. Perkins, Michael T. Hallett. tcbb, 7(1):118-125, 2010. [doi]

2007

A Faster FPT Algorithm for the Maximum Agreement Forest ProblemMichael T. Hallett, Catherine McCartin. mst, 41(3):539-550, 2007. [doi]

Tools for visually exploring biological networksMatthew Suderman, Michael T. Hallett. bioinformatics, 23(20):2651-2659, 2007. [doi]

2006

A Fixed-Parameter Approach to 2-Layer PlanarizationVida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood. algorithmica, 45(2):159-182, 2006. [doi]

2005

Refining Protein Subcellular LocalizationMichelle S. Scott, Sara J. Calafell, David Y. Thomas, Michael T. Hallett. ploscb, 1(6), 2005. [doi]

2004

2003

2001

Dependable Computing in Virtual LaboratoriesGustavo Alonso, Win Bausch, Cesare Pautasso, Ari Kahn, Michael T. Hallett. icde 2001: 235-242 [doi]

On the Parameterized Complexity of Layered Graph DrawingVida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood. esa 2001: 488-499 [doi]

A Fixed-Parameter Approach to Two-Layer PlanarizationVida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood. gd 2002: 1-15 [doi]

Efficient algorithms for lateral gene transfer problemsMichael T. Hallett, Jens Lagergren. recomb 2001: 149-156 [doi]

Identifying the most significant pairwise correlations of residues in different positions of helices: the subset selection problem using least squares optimizationXianghong Zhou, Gareth Chelvanayagam, Michael T. Hallett. SAC 2001: 51-55 [doi]

2000

1998

Analogs and Duals of teh MAST Problem for Sequences and TreesMichael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege. esa 1998: 103-114 [doi]

On the Multiple Gene Duplication ProblemMichael R. Fellows, Michael T. Hallett, Ulrike Stege. isaac 1998: 347-356 [doi]

1995

Parameterized complexity analysis in computational biologyHans Leo Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham. bioinformatics, 11(1):49-57, 1995.

1994

Beyond NP-completeness for problems of bounded width: hardness for the W hierarchyHans L. Bodlaender, Michael R. Fellows, Michael T. Hallett. stoc 1994: 449-458 [doi]

The Parameterized Complexity of Some Problems in Logic and LinguisticsMichael T. Hallett, Harold T. Wareham. lfcs 1994: 89-100

A compendium of parameterized complexity resultsMichael T. Hallett, Todd Wareham. sigact, 25(3):122-123, 1994. [doi]

1993

DNA Physical Mapping: Three Ways DifficultMichael R. Fellows, Michael T. Hallett, Harold T. Wareham. esa 1993: 157-168

Sign in or sign up to see more results.

runs on WebDSL