Gianluca Della Vedova
Orcid: 0000-0001-5584-3089Affiliations:
- University of Milano-Bicocca, Milan, Italy
According to our database1,
Gianluca Della Vedova
authored at least 79 papers
between 1995 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2023
Three Metaheuristic Approaches for Tumor Phylogeny Inference: An Experimental Comparison.
Algorithms, July, 2023
J. Comput. Biol., April, 2023
Proceedings of the Bioinformatics and Biomedical Engineering, 2023
2022
Computational graph pangenomics: a tutorial on data structures and their applications.
Nat. Comput., 2022
2021
BMC Bioinform., November, 2021
IEEE J. Biomed. Health Informatics, 2021
Theor. Comput. Sci., 2021
Inferring cancer progression from Single-Cell Sequencing while allowing mutation losses.
Bioinform., 2021
Triplet-based similarity score for fully multilabeled trees with poly-occurring labels.
Bioinform., 2021
Proceedings of the Computational Advances in Bio and Medical Sciences: 11th International Conference, 2021
2020
gpps: an ILP-based approach for inferring cancer progression with mutation losses from single cell data.
BMC Bioinform., 2020
2019
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era.
Quant. Biol., 2019
J. Comput. Biol., 2019
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019
2018
ASGAL: aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events.
BMC Bioinform., 2018
HapCHAT: adaptive haplotype assembly for efficiently leveraging high coverage in long reads.
BMC Bioinform., 2018
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
Theor. Comput. Sci., 2017
Proceedings of the Unveiling Dynamics and Complexity, 2017
Proceedings of the 8th ACM International Conference on Bioinformatics, 2017
2016
Tools and data services registry: a community effort to document bioinformatics resources.
Nucleic Acids Res., 2016
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly.
J. Comput. Biol., 2016
A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings.
CoRR, 2016
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016
2014
Proceedings of the Discrete and Topological Models in Molecular Biology, 2014
J. Comput. Biol., 2014
CoRR, 2014
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014
2013
J. Comb. Optim., 2013
Proceedings of the ACM Conference on Bioinformatics, 2013
2012
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters.
Theor. Comput. Sci., 2012
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
CoRR, 2012
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text.
BMC Bioinform., 2012
Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine, 2012
2011
CoRR, 2011
Haplotype Inference on Pedigrees with Recombinations, Errors, and Missing Genotypes via SAT solvers
CoRR, 2011
Improving Probe Set Selection for Microbial Community Analysis by Leveraging Taxonomic Information of Training Sequences.
BMC Bioinform., 2011
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011
2010
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
2009
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009
2008
J. Comput. Syst. Sci., 2008
2007
2006
2005
Theor. Comput. Sci., 2005
Int. J. Bioinform. Res. Appl., 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
An Explicit Upper Bound for the Approximation Ratio of the Maximum Gene Regulatory Network Problem.
Proceedings of the Computational Methods in Systems Biology, International Conference, 2004
2003
J. Comput. Sci. Technol., 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
Theor. Comput. Sci., 2001
An approximation algorithm for the shortest common supersequence problem: an experimental analysis.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001
Probe selection algorithms with applications in the analysis of microbial communities.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001
2000
Int. J. Found. Comput. Sci., 2000
1999
1995
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995