| Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface PK Agarwal, T Akutsu, A Amihood, A Apostolico, C Benham, G Benson, ... Lecture notes in computer science (including subseries lecture notes in …, 2005 | 425* | 2005 |
| SNPs problems, complexity, and algorithms G Lancia, V Bafna, S Istrail, R Lippert, R Schwartz European symposium on algorithms, 182-193, 2001 | 290 | 2001 |
| Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem R Lippert, R Schwartz, G Lancia, S Istrail Briefings in bioinformatics 3 (1), 23-31, 2002 | 264 | 2002 |
| A polynomial-time approximation scheme for minimum routing cost spanning trees BY Wu, G Lancia, V Bafna, KM Chao, R Ravi, CY Tang SIAM Journal on Computing 29 (3), 761-778, 2000 | 210 | 2000 |
| Opportunities for combinatorial optimization in computational biology HJ Greenberg, WE Hart, G Lancia INFORMS Journal on Computing 16 (3), 211-231, 2004 | 188 | 2004 |
| Haplotyping as perfect phylogeny: A direct approach V Bafna, D Gusfield, G Lancia, S Yooseph Journal of Computational Biology 10 (3-4), 323-340, 2003 | 186 | 2003 |
| 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap A Caprara, R Carr, S Istrail, G Lancia, B Walenz Journal of Computational Biology 11 (1), 27-52, 2004 | 171 | 2004 |
| Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms G Lancia, MC Pinotti, R Rizzi INFORMS Journal on computing 16 (4), 348-359, 2004 | 168 | 2004 |
| 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem G Lancia, R Carr, B Walenz, S Istrail Proceedings of the fifth annual international conference on Computational …, 2001 | 161 | 2001 |
| Toward fully automated genotyping: genotyping microsatellite markers by deconvolution MW Perlin, G Lancia, SK Ng American journal of human genetics 57 (5), 1199, 1995 | 160 | 1995 |
| Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem R Rizzi, V Bafna, S Istrail, G Lancia International Workshop on Algorithms in Bioinformatics, 29-43, 2002 | 121 | 2002 |
| Banishing bias from consensus sequences A Ben-Dor, G Lancia, R Ravi, J Perone Annual Symposium on Combinatorial Pattern Matching, 247-261, 1997 | 100 | 1997 |
| Structural alignment of large—size proteins via lagrangian relaxation A Caprara, G Lancia Proceedings of the sixth annual international conference on Computational …, 2002 | 97 | 2002 |
| Polynomial and APX-hard cases of the individual haplotyping problem V Bafna, S Istrail, G Lancia, R Rizzi Theoretical Computer Science 335 (1), 109-125, 2005 | 72 | 2005 |
| Exact algorithms for minimum routing cost trees M Fischetti, G Lancia, P Serafini Networks: An International Journal 39 (3), 161-173, 2002 | 68 | 2002 |
| Protein structure comparison: Algorithms and applications G Lancia, S Istrail Mathematical Methods for Protein Structure Analysis and Design: CIME Summer …, 2003 | 56 | 2003 |
| A polynomial case of the parsimony haplotyping problem G Lancia, R Rizzi Operations Research Letters 34 (3), 289-295, 2006 | 55 | 2006 |
| Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan G Lancia European Journal of Operational Research 120 (2), 277-288, 2000 | 54 | 2000 |
| Algorithmic strategies in combinatorial chemistry D Goldman, S Istrail, G Lancia, A Piccolboni, B Walenz Sandia National Lab.(SNL-NM), Albuquerque, NM (United States); Sandia …, 2000 | 50 | 2000 |
| Job shop scheduling with deadlines E Balas, G Lancia, P Serafini, A Vazacopoulos Journal of Combinatorial Optimization 1 (4), 329-353, 1998 | 42 | 1998 |
Paolo SerafiniUniversity of UdineVerified email at uniud.it
