( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning.

, , , , , , , и . AlCoB, том 12715 из Lecture Notes in Computer Science, стр. 16-28. Springer, (2021)

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.

Anna-Pia Paolazzi

Domingos Paola

Paola Belloni

Paola Bozzi

Paola Borri

 

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

The complexity of multiple sequence alignment with SP-score that is a metric., и . Theor. Comput. Sci., 259 (1-2): 63-79 (2001)Regular splicing languages and subclasses., и . Theor. Comput. Sci., 340 (1): 349-363 (2005)Constants and label-equivalence: A decision procedure for reflexive regular splicing languages.. Theor. Comput. Sci., 411 (6): 865-877 (2010)Reconciling a gene tree to a species tree under the duplication cost model., , и . Theor. Comput. Sci., 347 (1-2): 36-53 (2005)The structure of reflexive regular splicing languages via Schützenberger constants., , и . Theor. Comput. Sci., 334 (1-3): 71-98 (2005)Shark: fishing relevant reads in an RNA-Seq sample., , , , , , и . Bioinform., 37 (4): 464-472 (2021)Triplet-based similarity score for fully multilabeled trees with poly-occurring labels., , , , , и . Bioinform., 37 (2): 178-184 (2021)On the power of circular splicing., , , и . Discret. Appl. Math., 150 (1-3): 51-66 (2005)Variants of constrained longest common subsequence., , , и . Inf. Process. Lett., 110 (20): 877-881 (2010)A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters, , и . CoRR, (2009)