Michael T. Hallett

Orcid: 0000-0001-6738-6786

Affiliations:
  • McGill University, Montreal, Canada


According to our database1, Michael T. Hallett authored at least 35 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Reproducible Data Analysis Pipelines for Precision Medicine.
Proceedings of the 27th Euromicro International Conference on Parallel, 2019

2017
Interactions between the tumor and the blood systemic response of breast cancer patients.
PLoS Comput. Biol., 2017

Building Applications for Interactive Data Exploration in Systems Biology.
Proceedings of the 8th ACM International Conference on Bioinformatics, 2017

2016
Structural and Functional Characterization of a <i>Caenorhabditis elegans</i> Genetic Interaction Network within Pathways.
PLoS Comput. Biol., 2016

2011
Simultaneous Identification of Duplications and Lateral Gene Transfers.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

2010
A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

2007
A Faster FPT Algorithm for the Maximum Agreement Forest Problem.
Theory Comput. Syst., 2007

Tools for visually exploring biological networks.
Bioinform., 2007

2006
A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

2005
Refining Protein Subcellular Localization.
PLoS Comput. Biol., 2005

BIAS: Bioinformatics Integrated Application Software.
Bioinform., 2005

2004
Towards Quality Control for DNA Microarrays.
J. Comput. Biol., 2004

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinform. Comput. Biol., 2004

The Hera database and its use in the characterization of endoplasmic reticulum proteins.
Bioinform., 2004

Simultaneous identification of duplications and lateral transfers.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

2003
DePIE: Designing Primers for Protein Interaction Experiments.
Nucleic Acids Res., 2003

Analogs & duals of the MAST problem for sequences & trees.
J. Algorithms, 2003

Towards Identifying Lateral Gene Transfer Events.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

2001
Identifying the most significant pairwise correlations of residues in different positions of helices: the subset selection problem using least squares optimization.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

Efficient algorithms for lateral gene transfer problems.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Dependable Computing in Virtual Laboratories.
Proceedings of the 17th International Conference on Data Engineering, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001


2000
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.
Theor. Comput. Sci., 2000

Darwin v. 2.0: an interpreted computer language for the biosciences.
Bioinform., 2000

A cross-comparison of a large dataset of genes.
Bioinform., 2000

New algorithms for the duplication-loss model.
Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, 2000

Hunting for Functionally Analogous Genes.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1998
On the Multiple Gene Duplication Problem.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Analogs and Duals of the MAST Problem for Sequences and Trees.
Proceedings of the Algorithms, 1998

1995
Parameterized complexity analysis in computational biology.
Comput. Appl. Biosci., 1995

1994
A compendium of parameterized complexity results.
SIGACT News, 1994

Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The Parameterized Complexity of Some Problems in Logic and Linguistics.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993
DNA Physical Mapping: Three Ways Difficult.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993


  Loading...