( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating the Maximum Isomorphic Agreement Subtree Is Hard.

, , и . CPM, том 1848 из Lecture Notes in Computer Science, стр. 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.

Carlos Omar Della Védova

Gianluca Airaghi

Sergio Dellavalle

Gianluca Cama

Gianluca Valenti

 

Другие публикации лиц с тем же именем

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