Alberto Maria Segre

Professor and Associate Chair
Gerard P. Weeg Faculty Scholar in Informatics
Department of Computer Science
101B MacLean Hall
The University of Iowa
Iowa City, IA 52242
Tel. (319) 335–0737
Fax. (319) 335–3624

Curriculum Vitae
alberto-segre [at] uiowa.edu
Fall 2009 teaching:22c:005 Introduction to Computer Science

Research Interests

I am primarily interested in distributed algorithms for solving optimization problems. Much of my past work has focused on problems from the biological sciences, including linkage analysis problems from statistical genetics, and protein structure prediction techniques. I have also worked on parallel search algorithms such as A*, alpha-beta-minimax, Davis-Loveland-Putnam, and applications of these algorithms to both standard AI problems and economic problems such as combinatorial auction winner determination.

More recently, I have been interested in solving optimization problems in the health sciences, such as optimal location placement for sentinel surveillance, optimal vaccination strategies, and so on.

Selected Publications

An Optimal Multiprocessor Combinatorial Auction Solver (with S. Yang and B. Codenotti), Computers and Operations Research, 36:1 (January 2009), pp 149–166.

Mapping Autism Risk Loci Using Genetic Linkage and Chromosomal Rearrangements (Autism Genome Project), Nature Genetics 39:3 (March 2007), pp. 319–328.

Privacy-Preserving Database Union (with A. Wildenberg, V. Vieland and Y. Zhang), Privacy in Statistical Databases Lecture Notes in Computer Science 4032 (December 2006), pp. 266–276.

Approximation of Multipoint Likelihoods Using Flanking Marker Data: A Simulation Study (with A. George, L. Mangin, C. Bartlett, M. Logue, V. Vieland), BMC Genetics (December 2005), pp. S44.

Nagging: A Scalable, Fault-Tolerant, Paradigm for Distributed Search (with S. Foreman, G. Resta and A. Wildenberg), Artificial Intelligence 140:1–2 (September 2002), pp. 71–106.

A Structured Pattern Matching Approach to Shotgun Sequence Assembly (with S. Kim), Journal of Computational Biology 6:2, (Spring 1999), pp. 163–186.

Nagging: A Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference (with D.B. Sturgill), Journal of Automated Reasoning 19:3 (December 1997), pp. 347–376.

Exploratory Analysis of Speedup Learning Data Using Expectation Maximization (with G.J. Gordon and C.P. Elkan), Artifical Intelligence 85:1–2 (August 1996), pp.301–319.

A High Performance Explanation-Based Learning Algorithm (with C.P. Elkan), Artificial Intelligence 69:1–2 (September 1994), pp.1–50.

Bounded-Overhead Caching for Definite-Clause Theorem Proving (with D. Scharstein), Journal of Automated Reasoning 11:1 (August 1993), pp. 83–113.

A Critical Look at Experimental Evaluations of EBL (with C.P. Elkan and A. Russell), Machine Learning 6:2, Kluwer Academic (March 1991), pp. 183–196.