| 2011 | ||
|---|---|---|
| j27 | Giuseppe Lancia, Franca Rinaldi, Paolo Serafini: A time-indexed LP-based approach for min-sum job-shop problems. Annals OR 186(1): 175-198 (2011) | |
| j26 | Giuseppe Lancia, Paolo Serafini: An effective compact formulation of the max cut problem on sparse graphs. Electronic Notes in Discrete Mathematics 37: 111-116 (2011) | |
| 2010 | ||
| j25 | Leonardo Tininini, Paola Bertolazzi, Alessandra Godi, Giuseppe Lancia: CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony. IEEE/ACM Trans. Comput. Biology Bioinform. 7(3): 511-523 (2010) | |
| c14 | Giuseppe Lancia, Romeo Rizzi, Russell Schwartz: Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. Stringology 2010: 89-102 | |
| 2009 | ||
| j24 | Giuseppe Lancia, Paolo Serafini: A Set-Covering Approach with Column Generation for Parsimony Haplotyping. INFORMS Journal on Computing 21(1): 151-166 (2009) | |
| 2008 | ||
| j23 | Giuseppe Lancia: Mathematical Programming in Computational Biology: an Annotated Bibliography. Algorithms 1(2): 100-129 (2008) | |
| j22 | Paola Bertolazzi, Giovanni Felici, Paola Festa, Giuseppe Lancia: Logic classification and feature selection for biomedical data. Computers & Mathematics with Applications 55(5): 889-899 (2008) | |
| j21 | Giuseppe Lancia: The phasing of heterozygous traits: Algorithms and complexity. Computers & Mathematics with Applications 55(5): 960-969 (2008) | |
| j20 | 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) | |
| j19 | Giuseppe Lancia, R. Ravi, Romeo Rizzi: Haplotyping for Disease Association: A Combinatorial Approach. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 245-251 (2008) | |
| r1 | ||
| 2007 | ||
| j18 | Alberto Apostolico, Raffaele Giancarlo, Concettina Guerra, Giuseppe Lancia: Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface. BMC Bioinformatics 8(S-5) (2007) | |
| 2006 | ||
| j17 | Giuseppe Lancia, Romeo Rizzi: The approximability of the String Barcoding problem. Algorithms for Molecular Biology 1 (2006) | |
| j16 | Giuseppe Lancia, Romeo Rizzi: A polynomial case of the parsimony haplotyping problem. Oper. Res. Lett. 34(3): 289-295 (2006) | |
| c13 | Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi: Flipping letters to minimize the support of a string. Stringology 2006: 9-17 | |
| 2005 | ||
| j15 | 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) | |
| c12 | Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi: The String Barcoding Problem is NP-Hard. Comparative Genomics 2005: 88-96 | |
| 2004 | ||
| j14 | Robert D. Carr, Giuseppe Lancia: Compact optimization can outperform separation: A case study in structural proteomics. 4OR 2(3): 221-233 (2004) | |
| j13 | Harvey J. Greenberg, William E. Hart, Giuseppe Lancia: Opportunities for Combinatorial Optimization in Computational Biology. INFORMS Journal on Computing 16(3): 211-231 (2004) | |
| j12 | 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) | |
| j11 | 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) | |
| j10 | Giuseppe Lancia: Integer Programming Models for Computational Biology Problems. J. Comput. Sci. Technol. 19(1): 60-77 (2004) | |
| 2003 | ||
| j9 | 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) | |
| c11 | Giuseppe Lancia, Sorin Istrail: Protein Structure Comparison: Algorithms and Applications. Mathematical Methods for Protein Structure Analysis and Design 2003: 1-33 | |
| 2002 | ||
| j8 | 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) | |
| j7 | Matteo Fischetti, Giuseppe Lancia, Paolo Serafini: Exact algorithms for minimum routing cost trees. Networks 39(3): 161-173 (2002) | |
| j6 | Robert D. Carr, Giuseppe Lancia: Compact vs. exponential-size LP relaxations. Oper. Res. Lett. 30(1): 57-65 (2002) | |
| c10 | Alberto Caprara, Giuseppe Lancia: Optimal and Near - Optimal Solutions for 3D Structure Comparisons. 3DPVT 2002: 737-745 | |
| c9 | Alberto Caprara, Giuseppe Lancia: Structural alignment of large-size proteins via lagrangian relaxation. RECOMB 2002: 100-108 | |
| c8 | 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 | |
| 2001 | ||
| j5 | Alberto Caprara, Giuseppe Lancia, See-Kiong Ng: Sorting Permutations by Reversals Through Branch-and-Price. INFORMS Journal on Computing 13(3): 224-244 (2001) | |
| c7 | Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz: SNPs Problems, Complexity, and Algorithms. ESA 2001: 182-193 | |
| c6 | 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 | |
| 2000 | ||
| j4 | Giuseppe Lancia: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. European Journal of Operational Research 120(2): 277-288 (2000) | |
| c5 | Alberto Caprara, Giuseppe Lancia, See-Kiong Ng: Fast practical solution of sorting by reversals. SODA 2000: 12-21 | |
| c4 | Deborah Goldman, Sorin Istrail, Giuseppe Lancia, Antonio Piccolboni, Brian Walenz: Algorithmic strategies in combinatorial chemistry. SODA 2000: 275-284 | |
| 1999 | ||
| j3 | 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) | |
| c3 | ||
| 1998 | ||
| j2 | Giuseppe Lancia, Mark Perlin: Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques. Discrete Applied Mathematics 88(1-3): 291-314 (1998) | |
| j1 | Egon Balas, Giuseppe Lancia, Paolo Serafini, Alkis Vazacopoulos: Job Shop Scheduling With Deadlines. J. Comb. Optim. 1(4): 329-353 (1998) | |
| c2 | 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 | |
| 1997 | ||
| c1 | Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi: Banishing Bias from Consensus Sequences. CPM 1997: 247-261 | |
Data released under the ODC-BY 1.0 license — See also our legal information page