Sfoglia per Autore
Toward Fully Automated Genotyping: Genotyping Microsatellite Markers by Deconvolution
1995-01-01 Perlin, M.; Lancia, Giuseppe; Ng, S. K.
Banishing Bias from Consensus Sequences
1997-01-01 BEN DOR, A.; Lancia, Giuseppe; Perone, J.; Ravi, R.
Polynomial time approximation scheme for minimum routing cost spanning trees
1998-01-01 Wu Bang, Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang Chuan, Yi
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques
1998-01-01 Lancia, Giuseppe; Perlin, M.
Job Shop Scheduling With Deadlines
1998-01-01 Balas, E.; Lancia, Giuseppe; Serafini, Paolo; Vazacopoulos, A.
A Column-Generation Based Branch-and-Bound Algorithm for Sorting By Reversals
1999-01-01 Caprara, A.; Lancia, Giuseppe; Ng, S. K.
GESTALT: GEnomic STeiner ALignmenTs
1999-01-01 Lancia, Giuseppe; Ravi, R.
Experimental and statistical analysis of sorting by reversals
2000-01-01 Caprara, A.; Lancia, Giuseppe
Fast Practical Solution of Sorting By Reversals
2000-01-01 Caprara, A.; Lancia, Giuseppe; Ng, S. K.
Algorithmic Strategies in Combinatorial Chemistry
2000-01-01 Goldman, D.; Istrail, S.; Lancia, Giuseppe; Piccolboni, A.; Walenz, B.
A polynomial-time approximation scheme for minimum routing cost spanning trees
2000-01-01 Wu, B. Y.; Lancia, G.; Bafna, V.; Chao, K. -M.; Ravi, R.; Tang, C. Y.
Scheduling Jobs with Release Dates and Tails on Two Unrelated Parallel Machines to Minimize the Makespan
2000-01-01 Lancia, Giuseppe
SNPs Problems, Algorithms and Complexity
2001-01-01 Lancia, Giuseppe; Bafna, V.; Istrail, S.; Lippert, R.; Schwartz, R.
SNPs problems, complexity, and algorithms
2001-01-01 Lancia, G.; Bafna, V.; Istrail, S.; Lippert, R.; Schwartz, R.
101 Optimal PDB Structure Alignments: a Branch-And-Cut Algorithm for the Maximum Contact Map Overlap Problem
2001-01-01 Lancia, Giuseppe; Carr, R. D.; Walenz, B.; Istrail, S.
Sorting Permutations by Reversals through Branch and Price
2001-01-01 Caprara, A.; Lancia, Giuseppe; Ng, S. K.
Combinatorial optimization problems in the study of human diversities
2002-01-01 Lancia, Giuseppe
Structural alignment of large-size proteins via Lagrangian Relaxation
2002-01-01 Caprara, A.; Lancia, Giuseppe
Algorithmic strategies for the SNPs haplotype assembly problem
2002-01-01 Lippert, R.; Schwartz, R.; Lancia, Giuseppe; Istrail, S.
Compact vs Exponential-Size LP Relaxations
2002-01-01 Carr, Robert; Lancia, Giuseppe
Exact algorithms for minimum routing cost trees
2002-01-01 Fischetti, M.; Lancia, Giuseppe; Serafini, Paolo
Practical Algorithms and Fixed-Parameter Tractability of the Single Individual Haplotyping Problem
2002-01-01 Rizzi, R.; Bafna, V.; Istrail, S.; Lancia, Giuseppe
Optimal and Near-Optimal solutions for 3D Structure Comparisons
2002-01-01 Caprara, A.; Lancia, Giuseppe
Protein Structure Comparison: Algorithms and Applications
2003-01-01 Lancia, Giuseppe; Istrail, S.
Haplotyping as Perfect Phylogeny: A Direct Approach
2003-01-01 Bafna, V.; Gusfield, D.; Lancia, Giuseppe; Yooseph, S.
Haplotyping as perfect phylogeny
2004-01-01 Bafna, V.; Gusfield, D.; Lancia, G.; Yooseph, S.
Compact Optimization Can Outperform Separation: A Case Study in Structural Proteomics
2004-01-01 Carr, R. D.; Lancia, Giuseppe
Opportunities for Combinatorial Optimization in Computational Biology
2004-01-01 Greenberg, H.; Hart, W.; Lancia, Giuseppe
1001 optimal PDB structure alignments: Integer Programming methods for finding the maximum contact map overlap
2004-01-01 Caprara, A.; Carr, R.; Istrail, S.; Lancia, Giuseppe; Walenz, B.
Haplotyping Populations by Pure Parsimony. Complexity, Exact and Approximation Algorithms
2004-01-01 Lancia, Giuseppe; Pinotti, M. C.; Rizzi, R.
Integer Programming models for computational biology problems
2004-01-01 Lancia, Giuseppe
The string barcoding problem is NP-hard
2005-01-01 Dalpasso, M.; Lancia, Giuseppe; Rizzi, R.
Polynomial and APX-hard cases of the individual haplotyping problem
2005-01-01 V., Bafna; S., Istrail; Lancia, Giuseppe; R., Rizzi
Flipping letters to minimize the support of a string
2006-01-01 Lancia, Giuseppe; Rinaldi, Franca; R., Rizzi
Computational molecular biology
2006-01-01 Lancia, G.
Applications to Computational Molecular Biology
2006-01-01 Lancia, Giuseppe
The approximability of the String-Barcoding problem
2006-01-01 Lancia, Giuseppe; Rizzi, R.
A polynomial case of the parsimony haplotyping problem
2006-01-01 Lancia, Giuseppe; Rizzi, R.
A compact optimization approach for jobshop problems
2007-01-01 Lancia, Giuseppe; Rinaldi, Franca; Serafini, Paolo
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology
2007-01-01 Apostolico, A.; Giancarlo, R.; Guerra, C.; Lancia, Giuseppe
Perfect Phylogeny Haplotyping
2008-01-01 Lancia, Giuseppe
Mathematical Programming in Computational Biology: An Annotated Bibliography
2008-01-01 Lancia, Giuseppe
Haplotyping for disease association: a combinatorial approach
2008-01-01 R., Ravi; Rizzi, Romeo; Lancia, Giuseppe
Flipping letters to minimize the support of a string
2008-01-01 Lancia, Giuseppe; Rinaldi, Franca; Rizzi, Romeo
The phasing of heterozygous traits: algorithms and complexity
2008-01-01 Lancia, Giuseppe
Logic Classification and Feature Selection for Biomedical Data
2008-01-01 Bertolazzi, Paola; Felici, Giovanni; Festa, Paola; Lancia, Giuseppe
A set covering approach with column generation for parsimony haplotyping
2009-01-01 Lancia, Giuseppe; Serafini, Paolo
Application of Feature Selection and Classification to Computational Molecular Biology
2009-01-01 Bertolazzi, P; Felici, G; Lancia, Giuseppe
A tabu search procedure for the TSP with time windows
2010-01-01 Lancia, Giuseppe; Nadalin, Francesca; Rinaldi, Franca
Tiling binary matrices in haplotyping: Complexity, algorithms and models
2010-01-01 Lancia, Giuseppe; Rizzi, Romeo; Schwartz, R.
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile