default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael T. Hallett
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c17]Bjørn Fjukstad, Vanessa Dumeaux
, Michael T. Hallett, Lars Ailo Bongo:
Reproducible Data Analysis Pipelines for Precision Medicine. PDP 2019: 299-306- 2017
- [j19]Vanessa Dumeaux, Bjørn Fjukstad, Hans E. Fjosne, Jan-Ole Frantzen, Marit Muri Holmen, Enno Rodegerdts, Ellen Schlichting, Anne-Lise Børresen-Dale, Lars Ailo Bongo, Eiliv Lund, Michael T. Hallett:
Interactions between the tumor and the blood systemic response of breast cancer patients. PLoS Comput. Biol. 13(9) (2017) - [c16]Bjørn Fjukstad, Vanessa Dumeaux, Karina Standahl Olsen, Eiliv Lund, Michael T. Hallett, Lars Ailo Bongo:
Building Applications for Interactive Data Exploration in Systems Biology. BCB 2017: 556-561 - 2016
- [j18]Benjamin Boucher, Anna Y. Lee, Michael T. Hallett, Sarah Jenna:
Structural and Functional Characterization of a Caenorhabditis elegans Genetic Interaction Network within Pathways. PLoS Comput. Biol. 12(2) (2016) - 2011
- [j17]Ali Tofigh, Michael T. Hallett, Jens Lagergren:
Simultaneous Identification of Duplications and Lateral Gene Transfers. IEEE ACM Trans. Comput. Biol. Bioinform. 8(2): 517-535 (2011) - 2010
- [j16]Theodore J. Perkins, Michael T. Hallett:
A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data. IEEE ACM Trans. Comput. Biol. Bioinform. 7(1): 118-125 (2010)
2000 – 2009
- 2007
- [j15]Matthew Suderman, Michael T. Hallett:
Tools for visually exploring biological networks. Bioinform. 23(20): 2651-2659 (2007) - [j14]Michael T. Hallett, Catherine McCartin:
A Faster FPT Algorithm for the Maximum Agreement Forest Problem. Theory Comput. Syst. 41(3): 539-550 (2007) - 2006
- [j13]Vida 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:
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006) - 2005
- [j12]Greg Finak, N. Godin, Michael T. Hallett, François Pepin, Z. Rajabi, V. Srivastava, Z. Tang:
BIAS: Bioinformatics Integrated Application Software. Bioinform. 21(8): 1745-1746 (2005) - [j11]Michelle S. Scott, Sara J. Calafell, David Y. Thomas, Michael T. Hallett:
Refining Protein Subcellular Localization. PLoS Comput. Biol. 1(6) (2005) - 2004
- [j10]Michelle S. Scott, Guoqing Lu, Michael T. Hallett, David Y. Thomas:
The Hera database and its use in the characterization of endoplasmic reticulum proteins. Bioinform. 20(6): 937-944 (2004) - [j9]Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. 2(2): 257-272 (2004) - [j8]Kaleigh Smith, Michael T. Hallett:
Towards Quality Control for DNA Microarrays. J. Comput. Biol. 11(5): 945-970 (2004) - [c15]Michael T. Hallett, Jens Lagergren, Ali Tofigh:
Simultaneous identification of duplications and lateral transfers. RECOMB 2004: 347-356 - 2003
- [j7]Michael R. Fellows, Michael T. Hallett, Ulrike Stege:
Analogs & duals of the MAST problem for sequences & trees. J. Algorithms 49(1): 192-216 (2003) - [j6]Guoqing Lu, Michael T. Hallett, Stephanie Pollock, David Y. Thomas:
DePIE: Designing Primers for Protein Interaction Experiments. Nucleic Acids Res. 31(13): 3755-3757 (2003) - [c14]Louigi Addario-Berry, Michael T. Hallett, Jens Lagergren:
Towards Identifying Lateral Gene Transfer Events. Pacific Symposium on Biocomputing 2003: 279-290 - [c13]Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215 - 2001
- [c12]Vida 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:
On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499 - [c11]Vida 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:
A Fixed-Parameter Approach to Two-Layer Planarization. GD 2001: 1-15 - [c10]Gustavo Alonso, Win Bausch, Cesare Pautasso, Ari Kahn, Michael T. Hallett:
Dependable Computing in Virtual Laboratories. ICDE 2001: 235-242 - [c9]Michael T. Hallett, Jens Lagergren:
Efficient algorithms for lateral gene transfer problems. RECOMB 2001: 149-156 - [c8]Xianghong Zhou, Gareth Chelvanayagam, Michael T. Hallett:
Identifying the most significant pairwise correlations of residues in different positions of helices: the subset selection problem using least squares optimization. SAC 2001: 51-55 - 2000
- [j5]Gaston H. Gonnet, Michael T. Hallett, Chantal Korostensky, Laurent Bernardin:
Darwin v. 2.0: an interpreted computer language for the biosciences. Bioinform. 16(2): 101-103 (2000) - [j4]Gina Cannarozzi, Michael T. Hallett, J. Norberg, Xianghong Zhou:
A cross-comparison of a large dataset of genes. Bioinform. 16(7): 654-655 (2000) - [j3]Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy J. Warnow:
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. 244(1-2): 167-188 (2000) - [c7]Michael T. Hallett, Jens Lagergren:
Hunting for Functionally Analogous Genes. FSTTCS 2000: 465-476 - [c6]Michael T. Hallett, Jens Lagergren:
New algorithms for the duplication-loss model. RECOMB 2000: 138-146
1990 – 1999
- 1998
- [c5]Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege:
Analogs and Duals of the MAST Problem for Sequences and Trees. ESA 1998: 103-114 - [c4]Michael R. Fellows, Michael T. Hallett, Ulrike Stege:
On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356 - 1995
- [j2]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham:
Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. 11(1): 49-57 (1995) - 1994
- [j1]Michael T. Hallett, Todd Wareham:
A compendium of parameterized complexity results. SIGACT News 25(3): 122-123 (1994) - [c3]Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham:
The Parameterized Complexity of Some Problems in Logic and Linguistics. LFCS 1994: 89-100 - [c2]Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett:
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. STOC 1994: 449-458 - 1993
- [c1]Michael R. Fellows, Michael T. Hallett, Harold T. Wareham:
DNA Physical Mapping: Three Ways Difficult. ESA 1993: 157-168
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
