Giuseppe Lancia

Paolo Vidoni

CoRR, 2024

2023

Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data.

[BibT_eX]

[DOI]

Algorithms, 2021

2020

Finding the largest triangle in a graph in expected quadratic time.

[BibT_eX]

[DOI]

Paolo Vidoni

Eur. J. Oper. Res., 2020

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP.

[BibT_eX]

[DOI]

CoRR, 2020

Finding the Best 3-OPT Move in Subcubic Time.

[BibT_eX]

[DOI]

Algorithms, 2020

Using Integer Programming to Search for Counterexamples: A Case Study.

[BibT_eX]

[DOI]

Eleonora Pippia

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

2019

<tt>FASTSET</tt>: A Fast Data Structure for the Representation of Sets of Integers.

[BibT_eX]

[DOI]

Algorithms, 2019

Speeding-Up the Dynamic Programming Procedure for the Edit Distance of Two Strings.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2019

2018

New Modeling Ideas for the Exact Solution of the Closest String Problem.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2018

2017

Separating sets of strings by finding matching patterns is almost always hard.

[BibT_eX]

[DOI]

Luke Mathieson

Pablo Moscato

Theor. Comput. Sci., 2017

2016

Perfect Phylogeny Haplotyping.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Algorithmic approaches for the single individual haplotyping problem.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2016

Finding Patterns is Almost Always Hard.

[BibT_eX]

[DOI]

Luke Mathieson

Pablo Moscato

CoRR, 2016

Deriving compact extended formulations via LP-based separation techniques.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2016

2015

Local search inequalities.

[BibT_eX]

[DOI]

Discret. Optim., 2015

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

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2015

A Unified Integer Programming Model for Genome Rearrangement Problems.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2015

2014

Ramsey theory and integrality gap for the independent set problem.

[BibT_eX]

[DOI]

Robert D. Carr

Oper. Res. Lett., 2014

2011

An effective compact formulation of the max cut problem on sparse graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

A time-indexed LP-based approach for min-sum job-shop problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

2010

CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms.

[BibT_eX]

[DOI]

Russell Schwartz

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

2009

A Set-Covering Approach with Column Generation for Parsimony Haplotyping.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2009

2008

Perfect Phylogeny Haplotyping.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Haplotyping for Disease Association: A Combinatorial Approach.

[BibT_eX]

[DOI]

R. Ravi

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Flipping Letters to minimize the Support of a String.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

The phasing of heterozygous traits: Algorithms and complexity.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2008

Logic classification and feature selection for biomedical data.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2008

Mathematical Programming in Computational Biology: an Annotated Bibliography.

[BibT_eX]

[DOI]

Algorithms, 2008

2007

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

[BibT_eX]

[DOI]

BMC Bioinform., 2007

2006

A polynomial case of the parsimony haplotyping problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

The approximability of the String Barcoding problem.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2006

2005

Polynomial and APX-hard cases of the individual haplotyping problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The String Barcoding Problem is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics, 2005

2004

Integer Programming Models for Computational Biology Problems.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2004

1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap.

[BibT_eX]

[DOI]

J. Comput. Biol., 2004

Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.

[BibT_eX]

[DOI]

Maria Cristina Pinotti

INFORMS J. Comput., 2004

Opportunities for Combinatorial Optimization in Computational Biology.

[BibT_eX]

[DOI]

Harvey J. Greenberg

William E. Hart

INFORMS J. Comput., 2004

Compact optimization can outperform separation: A case study in structural proteomics.

[BibT_eX]

[DOI]

Robert D. Carr

4OR, 2004

2003

Haplotyping as Perfect Phylogeny: A Direct Approach.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

Protein Structure Comparison: Algorithms and Applications.

[BibT_eX]

[DOI]

Sorin Istrail

Proceedings of the Mathematical Methods for Protein Structure Analysis and Design, 2003

2002

Compact vs. exponential-size LP relaxations.

[BibT_eX]

[DOI]

Robert D. Carr

Oper. Res. Lett., 2002

Exact algorithms for minimum routing cost trees.

[BibT_eX]

[DOI]

Matteo Fischetti

Networks, 2002

Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem.

[BibT_eX]

[DOI]

Briefings Bioinform., 2002

Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Structural alignment of large-size proteins via lagrangian relaxation.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual International Conference on Computational Biology, 2002

Optimal and Near - Optimal Solutions for 3D Structure Comparisons.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

See-Kiong Ng

INFORMS J. Comput., 2001

101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

SNPs Problems, Complexity, and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Algorithmic strategies in combinatorial chemistry.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Fast practical solution of sorting by reversals.

[BibT_eX]

[DOI]

See-Kiong Ng

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

GESTALT: Genomic Steiner Alignments.

[BibT_eX]

[DOI]

R. Ravi

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998

Job Shop Scheduling With Deadlines.

[BibT_eX]

[DOI]

Egon Balas

Alkiviadis Vazacopoulos

J. Comb. Optim., 1998

Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques.

[BibT_eX]

[DOI]

Mark Perlin

Discret. Appl. Math., 1998

A column-generation based branch-and-bound algorithm for sorting by reversals.

[BibT_eX]

[DOI]