Search Results - "Lancia, G"

Two-step interpretable modeling of ICU-AIs by Lancia, G., Varkila, M.R.J., Cremer, O.L., Spitoni, C.

“…We present a novel methodology for integrating high resolution longitudinal data with the dynamic prediction capabilities of survival models. The aim is…”
Get full text

An ILP Approach to Determine Smallest 4-Regular Non-Hamiltonian, Nontraceable, and Nonhomogeneously Traceable Graphs by Lancia, G., Pippia, E., Rinaldi, F.

“…In this paper we study some open questions related to the smallest order of a -regular graph which has a connectivity property but does not have a hamiltonian…”
Get full text

Logic classification and feature selection for biomedical data by Bertolazzi, P., Felici, G., Festa, P., Lancia, G.

“…In this paper we investigate logic classification and related feature selection algorithms for large biomedical data sets. When the data is in binary/logic…”
Get full text

Haplotyping for Disease Association: A Combinatorial Approach by Lancia, G., Ravi, R., Rizzi, R.

“…We consider a combinatorial problem derived from haplotyping a population with respect to a , either recessive or dominant. Given a set of individuals,…”
Get full text

Strategies for Rare Population Detection and Sampling: A Methodological Approach in Liguria by Lancia, G, Riccomagno, E

“…Economic policy sciences are constantly investigating the quality of well-being of broad sections of the population in order to describe the current…”
Get full text

The phasing of heterozygous traits: Algorithms and complexity by Lancia, Giuseppe

“…Combinatorial haplotyping problems have received great attention in the past few years. We review their definitions and the main results that were obtained for…”
Get full text

Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan by Lancia, Giuseppe

“…In this paper we deal with the problem of assigning a set of n jobs, with release dates and tails, to either one of two unrelated parallel machines and…”
Get full text

A polynomial case of the parsimony haplotyping problem by Lancia, Giuseppe, Rizzi, Romeo

“…The parsimony haplotyping problem was shown to be NP-hard when each genotype had k ⩽ 3 ambiguous positions, while the case for k ⩽ 2 was open. In this paper,…”
Get full text

Nimodipine in acute ischemic stroke: a double-blind controlled study by Paci, A, Ottaviano, P, Trenta, A, Iannone, G, De Santis, L, Lancia, G, Moschini, E, Carosi, M, Amigoni, S, Caresia, L

“…Nimodipine (BAY e 9736), a new dihydropyridine derivative, has been shown to reduce neurological deficits and mortality induced by acute cerebral ischemia in…”
Get more information

Haplotyping as perfect phylogeny: a direct approach by Bafna, Vineet, Gusfield, Dan, Lancia, Giuseppe, Yooseph, Shibu

“…A full haplotype map of the human genome will prove extremely valuable as it will be used in large-scale screens of populations to associate specific…”
Get more information

Block approximations for probabilistic mixtures of elementary cellular automata by Cirillo, E. N. M, Lancia, G, Spitoni, C

“…Probabilistic Cellular Automata are a generalization of Cellular Automata. Despite their simple definition, they exhibit fascinating and complex behaviours…”
Get full text

Polynomial and APX-hard cases of the individual haplotyping problem by Bafna, Vineet, Istrail, Sorin, Lancia, Giuseppe, Rizzi, Romeo

“…SNP haplotyping problems have been the subject of extensive research in the last few years, and are one of the hottest areas of Computational Biology today. In…”
Get full text

1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap by Caprara, Alberto, Carr, Robert, Istrail, Sorin, Lancia, Giuseppe, Walenz, Brian

“…Protein structure comparison is a fundamental problem for structural genomics, with applications to drug design, fold prediction, protein clustering, and…”
Get more information

Compact optimization can outperform separation: A case study in structural proteomics by Carr, Robert D., Lancia, Giuseppe G.

“…In Combinatorial Optimization, one is frequently faced with linear programming (LP) problems with exponentially many constraints, which can be solved either…”
Get full text

Optimal and near-optimal solutions for 3D structure comparisons by Caprara, A., Lancia, G.

“…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…”
Get full text

Physics captured by data-based methods in El Ni\~no prediction by Lancia, G, Goede, I. J, Spitoni, C, Dijkstra, H. A

“…On average once every four years, the Tropical Pacific warms considerably during events called El Ni\~no, leading to weather disruptions over many regions on…”
Get full text

Exact algorithms for minimum routing cost trees by Fischetti, Matteo, Lancia, Giuseppe, Serafini, Paolo

“…Given a set of points and distances between them, a basic problem in network design calls for selecting a graph connecting them at a minimum total routing…”
Get full text

Integer programming models for computational biology problems by Lancia, Giuseppe

“…The recent years have seen an impressive increase in the use of Integer Programming models for the solution of optimization problems originating in Molecular…”
Get full text

Compact vs. exponential-size LP relaxations by Carr, Robert D., Lancia, Giuseppe

“…In this paper, we illustrate by means of examples a technique for formulating compact (i.e. polynomial-size) linear programming relaxations in place of…”
Get full text

Genotyping of pooled microsatellite markers by combinatorial optimization techniques: Computational molecular biology DAM - CMB Series. Volume 2 by LANCIA, G, PERLIN, M

Get full text