( en | de | ru )

 

Disambiguation of "Vedova, Gianluca Della"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the Maximum Isomorphic Agreement Subtree Is Hard.

, , and . CPM, volume 1848 of Lecture Notes in Computer Science, page 119-128. Springer, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Carlos Omar Della Védova

Gianluca Airaghi

Sergio Dellavalle

Gianluca Cama

Gianluca Valenti

 

Other publications of authors with the same name

Anonymizing Binary Tables is APX-hard, , and . CoRR, (2007)Approximating Clustering of Fingerprint Vectors with Missing Values, , and . CoRR, (2005)PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text., , , , , and . BMC Bioinform., 13 (S-5): S2 (2012)Experimenting an approximation algorithm for the LCS., , and . Discret. Appl. Math., 110 (1): 13-24 (2001)Improving Probe Set Selection for Microbial Community Analysis by Leveraging Taxonomic Information of Training Sequences., , , and . BMC Bioinform., (2011)On the Approximation of Correlation Clustering and Consensus Clustering., , , and . J. Comput. Syst. Sci., 74 (5): 671-696 (2008)Inferring cancer progression from Single-Cell Sequencing while allowing mutation losses., , , , , , , and . Bioinform., 37 (3): 326-333 (2021)Reads2Vec: Efficient Embedding of Raw High-Throughput Sequencing Reads Data., , , , and . J. Comput. Biol., 30 (4): 469-491 (April 2023)Divide and Conquer Computation of the Multi-string BWT and LCP Array., , , , , and . CiE, volume 10936 of Lecture Notes in Computer Science, page 107-117. Springer, (2018)Modular Decomposition of Hypergraphs., and . WG, volume 1017 of Lecture Notes in Computer Science, page 303-317. Springer, (1995)