Giuseppe Lancia
Giuseppe Lancia
Bestätigte E-Mail-Adresse bei
Zitiert von
Zitiert von
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
A Roychoudhury, M D'Souza
SNPs problems, complexity, and algorithms
G Lancia, V Bafna, S Istrail, R Lippert, R Schwartz
Algorithms—ESA 2001: 9th Annual European Symposium Århus, Denmark, August …, 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
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
Opportunities for combinatorial optimization in computational biology
HJ Greenberg, WE Hart, G Lancia
INFORMS Journal on Computing 16 (3), 211-231, 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
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
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
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
Toward fully automated genotyping: genotyping microsatellite markers by deconvolution.
MW Perlin, G Lancia, SK Ng
American journal of human genetics 57 (5), 1199, 1995
Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem
R Rizzi, V Bafna, S Istrail, G Lancia
Algorithms in Bioinformatics: Second International Workshop, WABI 2002 Rome …, 2002
Structural alignment of large—size proteins via lagrangian relaxation
A Caprara, G Lancia
Proceedings of the sixth annual international conference on Computational …, 2002
Banishing bias from consensus sequences
A Ben-Dor, G Lancia, R Ravi, J Perone
Combinatorial Pattern Matching: 8th Annual Symposium, CPM 97 Aarhus, Denmark …, 1997
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
Exact algorithms for minimum routing cost trees
M Fischetti, G Lancia, P Serafini
Networks: An International Journal 39 (3), 161-173, 2002
Protein structure comparison: Algorithms and applications
G Lancia, S Istrail
Mathematical Methods for Protein Structure Analysis and Design: CIME Summer …, 2003
A polynomial case of the parsimony haplotyping problem
G Lancia, R Rizzi
Operations Research Letters 34 (3), 289-295, 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
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
Logic classification and feature selection for biomedical data
P Bertolazzi, G Felici, P Festa, G Lancia
Computers & Mathematics with Applications 55 (5), 889-899, 2008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20