2008 |
31 | EE | Giuseppe Lancia:
Perfect Phylogeny Haplotyping.
Encyclopedia of Algorithms 2008 |
30 | EE | Giuseppe Lancia,
R. Ravi,
Romeo Rizzi:
Haplotyping for Disease Association: A Combinatorial Approach.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 245-251 (2008) |
29 | EE | Giuseppe Lancia,
Franca Rinaldi,
Romeo Rizzi:
Flipping Letters to minimize the Support of a String.
Int. J. Found. Comput. Sci. 19(1): 5-17 (2008) |
2006 |
28 | EE | Giuseppe Lancia,
Franca Rinaldi,
Romeo Rizzi:
Flipping letters to minimize the support of a string.
Stringology 2006: 9-17 |
27 | EE | Giuseppe Lancia,
Romeo Rizzi:
A polynomial case of the parsimony haplotyping problem.
Oper. Res. Lett. 34(3): 289-295 (2006) |
2005 |
26 | EE | Marcello Dalpasso,
Giuseppe Lancia,
Romeo Rizzi:
The String Barcoding Problem is NP-Hard.
Comparative Genomics 2005: 88-96 |
25 | EE | Vineet Bafna,
Sorin Istrail,
Giuseppe Lancia,
Romeo Rizzi:
Polynomial and APX-hard cases of the individual haplotyping problem.
Theor. Comput. Sci. 335(1): 109-125 (2005) |
2004 |
24 | EE | Robert D. Carr,
Giuseppe Lancia:
Compact optimization can outperform separation: A case study in structural proteomics.
4OR 2(3): 221-233 (2004) |
23 | EE | Harvey J. Greenberg,
William E. Hart,
Giuseppe Lancia:
Opportunities for Combinatorial Optimization in Computational Biology.
INFORMS Journal on Computing 16(3): 211-231 (2004) |
22 | EE | Giuseppe Lancia,
Maria Cristina Pinotti,
Romeo Rizzi:
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.
INFORMS Journal on Computing 16(4): 348-359 (2004) |
21 | EE | Giuseppe Lancia:
Integer Programming Models for Computational Biology Problems.
J. Comput. Sci. Technol. 19(1): 60-77 (2004) |
20 | EE | Alberto Caprara,
Robert D. Carr,
Sorin Istrail,
Giuseppe Lancia,
Brian Walenz:
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap.
Journal of Computational Biology 11(1): 27-52 (2004) |
2003 |
19 | EE | Giuseppe Lancia,
Sorin Istrail:
Protein Structure Comparison: Algorithms and Applications.
Mathematical Methods for Protein Structure Analysis and Design 2003: 1-33 |
18 | EE | Vineet Bafna,
Dan Gusfield,
Giuseppe Lancia,
Shibu Yooseph:
Haplotyping as Perfect Phylogeny: A Direct Approach.
Journal of Computational Biology 10(3/4): 323-340 (2003) |
2002 |
17 | EE | Alberto Caprara,
Giuseppe Lancia:
Optimal and Near - Optimal Solutions for 3D Structure Comparisons.
3DPVT 2002: 737-745 |
16 | EE | Alberto Caprara,
Giuseppe Lancia:
Structural alignment of large-size proteins via lagrangian relaxation.
RECOMB 2002: 100-108 |
15 | EE | Romeo Rizzi,
Vineet Bafna,
Sorin Istrail,
Giuseppe Lancia:
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem.
WABI 2002: 29-43 |
14 | | Ross Lippert,
Russell Schwartz,
Giuseppe Lancia,
Sorin Istrail:
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem.
Briefings in Bioinformatics 3(1): 23-31 (2002) |
13 | EE | Matteo Fischetti,
Giuseppe Lancia,
Paolo Serafini:
Exact algorithms for minimum routing cost trees.
Networks 39(3): 161-173 (2002) |
12 | EE | Robert D. Carr,
Giuseppe Lancia:
Compact vs. exponential-size LP relaxations.
Oper. Res. Lett. 30(1): 57-65 (2002) |
2001 |
11 | EE | Giuseppe Lancia,
Vineet Bafna,
Sorin Istrail,
Ross Lippert,
Russell Schwartz:
SNPs Problems, Complexity, and Algorithms.
ESA 2001: 182-193 |
10 | EE | Giuseppe Lancia,
Robert D. Carr,
Brian Walenz,
Sorin Istrail:
101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.
RECOMB 2001: 193-202 |
9 | EE | Alberto Caprara,
Giuseppe Lancia,
See-Kiong Ng:
Sorting Permutations by Reversals Through Branch-and-Price.
INFORMS Journal on Computing 13(3): 224-244 (2001) |
2000 |
8 | EE | Alberto Caprara,
Giuseppe Lancia,
See-Kiong Ng:
Fast practical solution of sorting by reversals.
SODA 2000: 12-21 |
7 | EE | Deborah Goldman,
Sorin Istrail,
Giuseppe Lancia,
Antonio Piccolboni,
Brian Walenz:
Algorithmic strategies in combinatorial chemistry.
SODA 2000: 275-284 |
1999 |
6 | EE | Giuseppe Lancia,
R. Ravi:
GESTALT: Genomic Steiner Alignments.
CPM 1999: 101-114 |
5 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput. 29(3): 761-778 (1999) |
1998 |
4 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SODA 1998: 21-32 |
3 | EE | Giuseppe Lancia,
Mark Perlin:
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques.
Discrete Applied Mathematics 88(1-3): 291-314 (1998) |
2 | | Egon Balas,
Giuseppe Lancia,
Paolo Serafini,
Alkis Vazacopoulos:
Job Shop Scheduling With Deadlines.
J. Comb. Optim. 1(4): 329-353 (1998) |
1997 |
1 | | Amir Ben-Dor,
Giuseppe Lancia,
Jennifer Perone,
R. Ravi:
Banishing Bias from Consensus Sequences.
CPM 1997: 247-261 |