Gianluca Della Vedova

According to our database1, Gianluca Della Vedova authored at least 71 papers between 1995 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Computing the multi-string BWT and LCP array in external memory.
Theor. Comput. Sci., 2021

Shark: fishing relevant reads in an RNA-Seq sample.
Bioinform., 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

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

Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.
J. Comput. Biol., 2019

A Rearrangement Distance for Fully-Labelled Trees.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Effective Clustering for Single Cell Sequencing Cancer Data.
Proceedings of the 10th ACM International Conference on Bioinformatics, 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

Divide and Conquer Computation of the Multi-string BWT and LCP Array.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
A colored graph approach to perfect phylogeny with persistent characters.
Theor. Comput. Sci., 2017

FSG: Fast String Graph Construction for De Novo Assembly.
J. Comput. Biol., 2017

Species-Driven Persistent Phylogeny.
Fundam. Informaticae, 2017

Computing the BWT and LCP array of a Set of Strings in External Memory.
CoRR, 2017

An External-Memory Algorithm for String Graph Construction.
Algorithmica, 2017

Character-Based Phylogeny Construction and Its Application to Tumor Evolution.
Proceedings of the Unveiling Dynamics and Complexity, 2017

Beyond Perfect Phylogeny: Multisample Phylogeny Reconstruction via ILP.
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

Solving the Persistent Phylogeny Problem in polynomial time.
CoRR, 2016

A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings.
CoRR, 2016

FSG: Fast String Graph Construction for De Novo Assembly of Reads Data.
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

2014
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs.
J. Comput. Biol., 2014

Algorithms for the Constrained Perfect Phylogeny with Persistent Characters.
CoRR, 2014

Constructing String Graphs in External Memory.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

2013
Parameterized complexity of k-anonymity: hardness and tractability.
J. Comb. Optim., 2013

Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes.
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

A Unifying Framework to Characterize the Power of a Language to Express Relations
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

Reconstructing isoform graphs from RNA-Seq data.
Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine, 2012

2011
Anonymizing binary and small tables is hard to approximate.
J. Comb. Optim., 2011

Predicting Variants of Alternative Splicing from NGS data without the Genome
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
Pure Parsimony Xor Haplotyping.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Beyond evolutionary trees.
Nat. Comput., 2010

Variants of constrained longest common subsequence.
Inf. Process. Lett., 2010

Fingerprint Clustering with Bounded Number of Missing Values.
Algorithmica, 2010

Parameterized Complexity of <i>k</i>-Anonymity: Hardness and Tractability.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Parameterized Complexity of the k-anonymity Problem
CoRR, 2009

Minimum Factorization Agreement of Spliced ESTs.
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

The <i>k</i>-Anonymity Problem Is Hard.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008
On the Approximation of Correlation Clustering and Consensus Clustering.
J. Comput. Syst. Sci., 2008

2007
Exemplar Longest Common Subsequence.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Anonymizing Binary Tables is APX-hard
CoRR, 2007

2006
Exemplar Longest Common Subsequence.
Proceedings of the Computational Science, 2006

2005
Reconciling a gene tree to a species tree under the duplication cost model.
Theor. Comput. Sci., 2005

Experimental analysis of a new algorithm for partial haplotype completion.
Int. J. Bioinform. Res. Appl., 2005

Approximating Clustering of Fingerprint Vectors with Missing Values
CoRR, 2005

Correlation Clustering and Consensus Clustering.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
Foreword - Special Issue on Bioinformatics.
J. Comput. Sci. Technol., 2004

Multiple Sequence Alignment as a Facility-Location Problem.
INFORMS J. Comput., 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
The Haplotyping Problem: An Overview of Computational Models and Solutions.
J. Comput. Sci. Technol., 2003

Reconciling Gene Trees to a Species Tree.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Optimal algorithms for local vertex quartet cleaning.
Bioinform., 2002

Approximating minimum quartet inconsistency (abstract).
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
The complexity of multiple sequence alignment with SP-score that is a metric.
Theor. Comput. Sci., 2001

Experimenting an approximation algorithm for the LCS.
Discret. Appl. Math., 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
Approximating the Maximum Isomorphic Agreement Subtree is Hard.
Int. J. Found. Comput. Sci., 2000

1999
An Algorithm for the Modular Decomposition of Hypergraphs.
J. Algorithms, 1999

1995
Modular Decomposition of Hypergraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995


  Loading...