Sfoglia per Autore  

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