|
Search the dblp DataBase
Gianluca Della Vedova:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
Reconciling Gene Trees to a Species Tree. [Citation Graph (0, 0)][DBLP] CIAC, 2003, pp:120-131 [Conf]
- Sergio Pozzi, Gianluca Della Vedova, Giancarlo Mauri
An Explicit Upper Bound for the Approximation Ratio of the Maximum Gene Regulatory Network Problem. [Citation Graph (0, 0)][DBLP] CMSB, 2004, pp:1-8 [Conf]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri
Fingerprint Clustering with Bounded Number of Missing Values. [Citation Graph (0, 0)][DBLP] CPM, 2006, pp:106-116 [Conf]
- Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri
Approximating the Maximum Isomorphic Agreement Subtree Is Hard. [Citation Graph (0, 0)][DBLP] CPM, 2000, pp:119-128 [Conf]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Exemplar Longest Common Subsequence. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (2), 2006, pp:622-629 [Conf]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Lorenzo Mariani
Experimental Analysis of a New Algorithm for Partial Haplotype Completion. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (2), 2005, pp:952-959 [Conf]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang
Correlation Clustering and Consensus Clustering. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:226-235 [Conf]
- James Borneman, Marek Chrobak, Gianluca Della Vedova, Andres Figueroa, Tao Jiang
Probe selection algorithms with applications in the analysis of microbial communities. [Citation Graph (0, 0)][DBLP] ISMB (Supplement of Bioinformatics), 2001, pp:39-48 [Conf]
- Paolo Barone, Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri
An approximation algorithm for the shortest common supersequence problem: an experimental analysis. [Citation Graph (0, 0)][DBLP] SAC, 2001, pp:56-60 [Conf]
- Gianluca Della Vedova, Todd Wareham
Optimal algorithms for local vertex quartet cleaning. [Citation Graph (0, 0)][DBLP] SAC, 2002, pp:173-177 [Conf]
- Gianluca Della Vedova, Tao Jiang, Jing Li 0002, Jianjun Wen
Approximating minimum quartet inconsistency (abstract). [Citation Graph (0, 0)][DBLP] SODA, 2002, pp:894-895 [Conf]
- Paola Bonizzoni, Gianluca Della Vedova
Modular Decomposition of Hypergraphs. [Citation Graph (0, 0)][DBLP] WG, 1995, pp:303-317 [Conf]
- Gianluca Della Vedova, Todd Wareham
Optimal algorithms for local vertex quartet cleaning. [Citation Graph (0, 0)][DBLP] Bioinformatics, 2002, v:18, n:10, pp:1297-1304 [Journal]
- Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri
Experimenting an approximation algorithm for the LCS. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:110, n:1, pp:13-24 [Journal]
- Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri
Approximating the Maximum Isomorphic Agreement Subtree is Hard. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2000, v:11, n:4, pp:579-590 [Journal]
- Winfried Just, Gianluca Della Vedova
Multiple Sequence Alignment as a Facility-Location Problem. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2004, v:16, n:4, pp:430-440 [Journal]
- Paola Bonizzoni, Gianluca Della Vedova
An Algorithm for the Modular Decomposition of Hypergraphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:32, n:2, pp:65-86 [Journal]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Jing Li 0002
The Haplotyping Problem: An Overview of Computational Models and Solutions. [Citation Graph (0, 0)][DBLP] J. Comput. Sci. Technol., 2003, v:18, n:6, pp:675-688 [Journal]
- Paola Bonizzoni, Gianluca Della Vedova, Tao Jiang
Foreword - Special Issue on Bioinformatics. [Citation Graph (0, 0)][DBLP] J. Comput. Sci. Technol., 2004, v:19, n:1, pp:1- [Journal]
- Paola Bonizzoni, Gianluca Della Vedova
The complexity of multiple sequence alignment with SP-score that is a metric. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:259, n:1-2, pp:63-79 [Journal]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
Reconciling a gene tree to a species tree under the duplication cost model. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:36-53 [Journal]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
Anonymizing Binary Tables is APX-hard [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
The k-Anonymity Problem Is Hard. [Citation Graph (, )][DBLP]
Minimum Factorization Agreement of Spliced ESTs. [Citation Graph (, )][DBLP]
Pure Parsimony Xor Haplotyping. [Citation Graph (, )][DBLP]
Approximating Clustering of Fingerprint Vectors with Missing Values [Citation Graph (, )][DBLP]
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters [Citation Graph (, )][DBLP]
Parameterized Complexity of the k-anonymity Problem [Citation Graph (, )][DBLP]
Variants of Constrained Longest Common Subsequence [Citation Graph (, )][DBLP]
Pure Parsimony Xor Haplotyping [Citation Graph (, )][DBLP]
Search in 0.000secs, Finished in 0.002secs
|