Loading [MathJax]/extensions/MathZoom.js
Giuseppe Lancia - IEEE Xplore Author Profile
Subscribe
ADVANCED SEARCH

Author details

< Back

Giuseppe Lancia

Also published under: G. Lancia

Publications
3
Citations
15
Publications by Year
20022010
Co-Authors:
Show All Co-Authors (6)
Image of author Giuseppe Lancia

Giuseppe Lancia

Also published under: G. Lancia

Affiliation

Dipartimento di Matematica e Informatica
University of Udine
Udine, Italy

Publication Topics

Biography

Giuseppe Lancia received the MS and PhD degrees in algorithms, combinatorics and optimization from Carnegie Mellon University. He is an associate professor of operations research at the University of Udine. From 1999 to 2001, he has been a visiting scientist first at Sandia National Labs and then at Celera Genomics. His research focuses on combinatorial optimization problems arising in computational molecular biology. He is an associate editor of the Algorithms, has been an associate editor for special issues of the INFORMS Journal on Computing and BMC Bioinformatics, and has served as a PC member on several computational biology conferences.(Based on document published on 9 December 2008).
Publications
3
Citations
15
Publications by Year
20022010
Co-Authors:
Show All Co-Authors (6)
Author's Published Works

Showing 1-3 of 3 results

  • Sort

Filter Results

Show

Sort By

Results

CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony

Leonardo Tininini;Paola Bertolazzi;Alessandra Godi;Giuseppe Lancia

IEEE/ACM Transactions on Computational Biology and Bioinformatics
Year: 2010 | Volume: 7, Issue: 3 | Journal Article |
Cited by: Papers (13)
Haplotype data play a relevant role in several genetic studies, e.g., mapping of complex disease genes, drug design, and evolutionary studies on populations. However, the experimental determination of haplotypes is expensive and time-consuming. This motivates the increasing interest in techniques for inferring haplotype data from genotypes, which can instead be obtained quickly and economically. S...Show More

CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony

Leonardo Tininini;Paola Bertolazzi;Alessandra Godi;Giuseppe Lancia

Year: 2010 | Volume: 7, Issue: 3 | Journal Article |

Haplotyping for Disease Association: A Combinatorial Approach

Giuseppe Lancia;R. Ravi;Romeo Rizzi

IEEE/ACM Transactions on Computational Biology and Bioinformatics
Year: 2008 | Volume: 5, Issue: 2 | Journal Article |
Cited by: Papers (1)
We consider a combinatorial problem derived from haplotyping a population with respect to a , either recessive or dominant. Given a set of individuals, partitioned into healthy and diseased, and the corresponding sets of genotypes, we want to infer "bad" and "good" haplotypes to account for these genotypes and for the disease. Assume, for example, that the disease is recessive. Then, the resolving...Show More

Haplotyping for Disease Association: A Combinatorial Approach

Giuseppe Lancia;R. Ravi;Romeo Rizzi

Year: 2008 | Volume: 5, Issue: 2 | Journal Article |

Optimal and near-optimal solutions for 3D structure comparisons

A. Caprara;G. Lancia

Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission
Year: 2002 | Conference Paper |
Cited by: Papers (1)
In this paper we describe exact and heuristic algorithms for the comparison of 3D structures via their contact maps. Given two contact maps, we consider the problem of finding the optimal sequence-order dependent and sequenced order independent alignments. We describe an integer programming formulation of the problems along with a Lagrangian relaxation yielding stronger bounds than previous approa...Show More

Optimal and near-optimal solutions for 3D structure comparisons

A. Caprara;G. Lancia

Year: 2002 | Conference Paper |

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.