Giuseppe Lancia

According to our database1, Giuseppe Lancia authored at least 54 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
FASTSET: A Fast Data Structure for the Representation of Sets of Integers.
Algorithms, 2019

Speeding-Up the Dynamic Programming Procedure for the Edit Distance of Two Strings.
Proceedings of the Database and Expert Systems Applications, 2019

2018
New Modeling Ideas for the Exact Solution of the Closest String Problem.
Proceedings of the Database and Expert Systems Applications, 2018

2017
Separating sets of strings by finding matching patterns is almost always hard.
Theor. Comput. Sci., 2017

2016
Perfect Phylogeny Haplotyping.
Encyclopedia of Algorithms, 2016

Algorithmic approaches for the single individual haplotyping problem.
RAIRO - Operations Research, 2016

Finding Patterns is Almost Always Hard.
CoRR, 2016

Deriving compact extended formulations via LP-based separation techniques.
Annals OR, 2016

The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets.
Proceedings of the Bioinformatics and Biomedical Engineering, 2016

2015
Local search inequalities.
Discrete Optimization, 2015

Estimating the strength of poker hands by integer linear programming techniques.
CEJOR, 2015

A Unified Integer Programming Model for Genome Rearrangement Problems.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

2014
Ramsey theory and integrality gap for the independent set problem.
Oper. Res. Lett., 2014

2011
An effective compact formulation of the max cut problem on sparse graphs.
Electronic Notes in Discrete Mathematics, 2011

A time-indexed LP-based approach for min-sum job-shop problems.
Annals OR, 2011

2010
CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

2009
A Set-Covering Approach with Column Generation for Parsimony Haplotyping.
INFORMS Journal on Computing, 2009

2008
Perfect Phylogeny Haplotyping.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Haplotyping for Disease Association: A Combinatorial Approach.
IEEE/ACM Trans. Comput. Biology Bioinform., 2008

Flipping Letters to minimize the Support of a String.
Int. J. Found. Comput. Sci., 2008

The phasing of heterozygous traits: Algorithms and complexity.
Computers & Mathematics with Applications, 2008

Logic classification and feature selection for biomedical data.
Computers & Mathematics with Applications, 2008

Mathematical Programming in Computational Biology: an Annotated Bibliography.
Algorithms, 2008

2007
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface.
BMC Bioinformatics, 2007

2006
A polynomial case of the parsimony haplotyping problem.
Oper. Res. Lett., 2006

The approximability of the String Barcoding problem.
Algorithms for Molecular Biology, 2006

2005
Polynomial and APX-hard cases of the individual haplotyping problem.
Theor. Comput. Sci., 2005

The String Barcoding Problem is NP-Hard.
Proceedings of the Comparative Genomics, 2005

2004
Integer Programming Models for Computational Biology Problems.
J. Comput. Sci. Technol., 2004

1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap.
Journal of Computational Biology, 2004

Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.
INFORMS Journal on Computing, 2004

Opportunities for Combinatorial Optimization in Computational Biology.
INFORMS Journal on Computing, 2004

Compact optimization can outperform separation: A case study in structural proteomics.
4OR, 2004

2003
Haplotyping as Perfect Phylogeny: A Direct Approach.
Journal of Computational Biology, 2003

Protein Structure Comparison: Algorithms and Applications.
Proceedings of the Mathematical Methods for Protein Structure Analysis and Design, 2003

2002
Compact vs. exponential-size LP relaxations.
Oper. Res. Lett., 2002

Exact algorithms for minimum routing cost trees.
Networks, 2002

Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem.
Briefings in Bioinformatics, 2002

Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Structural alignment of large-size proteins via lagrangian relaxation.
Proceedings of the Sixth Annual International Conference on Computational Biology, 2002

Optimal and Near - Optimal Solutions for 3D Structure Comparisons.
Proceedings of the 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT 2002), 2002

2001
Sorting Permutations by Reversals Through Branch-and-Price.
INFORMS Journal on Computing, 2001

101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

SNPs Problems, Complexity, and Algorithms.
Proceedings of the Algorithms, 2001

2000
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan.
European Journal of Operational Research, 2000

Algorithmic strategies in combinatorial chemistry.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Fast practical solution of sorting by reversals.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput., 1999

GESTALT: Genomic Steiner Alignments.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
Job Shop Scheduling With Deadlines.
J. Comb. Optim., 1998

Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques.
Discrete Applied Mathematics, 1998

A column-generation based branch-and-bound algorithm for sorting by reversals.
Proceedings of the Mathematical Support for Molecular Biology, 1998

1997
Banishing Bias from Consensus Sequences.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997


  Loading...