Publications from 1996-2003

Hallett M 1996-2003.



LuG, Pollock S, Thomas D, Hallett M (2003) DePIE: Designing Primers for Protein Interaction Experiments. Nucleic Acid Research 31(13):3755-7. PMID: 12824411.

Fellows M R, Hallett M, Stege U. (2003) Analogs and duals of the MAST problem for sequences and trees. Journal of Algorithms

Addario-Berry L, Chor B, Hallett M, Lagergren J, Panconesi A, Wareham T (2003) The complexity of ancestral maximum likelihood Workshop on Algorithms in Bioinformatics (WABI ’03) Budapest 202-215.

Addario-Berry, Hallett M, Lagergren J (2003) Towards Identifying Lateral Gene Transfer Events, Pacific Symposium on Biocomputing Hawaii 279-290.

Zhou X, Hallett M, Gonnet G, Folkers G, James P (2001) Cell fingerprinting: an approach to classifying cells according to mass profiles of digests of protein extracts. Proteomics 1(5):683-90. PMID: 11678037. IF: 4.505

Hallett M, Lagergren J (2001) Efficient Algorithms for Lateral Gene Transfer Problems, 5th Annual RECOMB Montreal 149–156.

Dujmovic V, Fellows MR, Hallett M, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond F, Suderman M, Whitesides S, Wood D R (2001) On the parameterized complexity of layered drawing. European Symposium on Algorithms Denmark 488-499.

Alonso G, Bausch W, Pautasso C, Kahn A, Hallett M (2001) Fault Tolerant Computing in the Sciences, 17th Annual International Conference on Data Engineering (ICDCS) Germany 235-242.

Dujmovic V, Fellows M.R, Hallett M, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond F, Suderman M, Whitesides S, Wood D R (2001) A fixed parameter approach to two-layer planarization. Graph Drawing Austria 1-15.

Cannarozzi G, Hallett M, Norberg J, Zhou X (2000) A Cross-Comparison of a Large Set of Genes. Bioinformatics 16(7):654-5.PMID:11038337. IF: 5.468

Gonnet G, Hallett M, Bernardin L, Korostensky C (2000). Darwin v. 2.0: An Interpreted Computer Language for the Biosciences. Bioinformatics 16(2):101-3. PMID: 10842729. IF: 5.468

Bodlaender H, Fellows M, Hallett M, Wareham HT, Warnow T (2000). The Hardness of Perfect Phylogeny, Feasible Register Assignment and Other Problems on Thin Colored Graphs. Journal of Theoretical Computer Science.

Zhou X, Chelvanayagam, G, Hallett M (2000). Identifying the most significant pairwise correlations between residues in different positions of helices: The subset selection problem using least squares optimization. SAC Las Vegas 51–55.

Alonso G, Bausch, Win, Hallett M, Kahn A and Pautasso C. (2000) BioOpera: managing large-scale computations in bioinformatics. Swiss Federal Institute of Technology, Department of Computer Science, Institute of Computer Systems.  <a href=”http://dx.doi.org/10.3929/ethz-a-006654174></a>

Hallett M, Lagergren J (2000). New Algorithms for the Duplication-Loss Model, 4thAnnual RECOMB 00 Tokyo 146-158.

Hallett M, Lagergren J (2000). Hunting for Functionally Analogous Genes, IARCS 20th Annual Foundations of Software Technology and Theoretical Computer Science (FST TCS) New Delhi 465-476.

Fellows M, Hallett M, Stege U (1998). On the Multiple Gene Duplication Problem, International Symposium on Algorithms and Computation ISAAC ’98 Korea 347-356.

Fellows M, Hallett M, Korostensky C, Stege U (1998). Analogs & Duals of the MAST Problem for Sequences & Trees, European Symposium on Algorithms ESA ’98 Venice, Italy 103-114.