( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximate All-Pairs Suffix/Prefix Overlaps.

, , и . CPM, том 6129 из Lecture Notes in Computer Science, стр. 76-87. Springer, (2010)

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.

Jürgen Ladra

Bernd Ladra

Susana Zapke

Susana Corotto

Susana Azpiazu

 

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

Approximate All-Pairs Suffix/Prefix Overlaps., , и . CPM, том 6129 из Lecture Notes in Computer Science, стр. 76-87. Springer, (2010)Evaluation of information loss for privacy preserving data mining through comparison of fuzzy partitions., , и . FUZZ-IEEE, стр. 1-8. IEEE, (2010)ViQUF: De Novo Viral Quasispecies Reconstruction Using Unitig-Based Flow Networks., , , и . IEEE ACM Trans. Comput. Biol. Bioinform., 20 (2): 1550-1562 (марта 2023)Compressed Data Structures for Binary Relations in Practice., , , и . CoRR, (2020)On the Comparison of Generic Information Loss Measures and Cluster-Specific Ones., и . International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 16 (Supplement-1): 107-120 (2008)Graph Compression for Adjacency-Matrix Multiplication., , , , и . SN Comput. Sci., 3 (3): 193 (2022)Implementing byte-oriented rank and select operations., , , , и . SOFSEM (2), стр. 34-45. Safarik University, Kosice, Slovakia, (2008)A practical succinct dynamic graph representation., , , , , , и . Inf. Comput., 285 (Part): 104862 (2022)Directly Addressable Variable-Length Codes., , и . SPIRE, том 5721 из Lecture Notes in Computer Science, стр. 122-130. Springer, (2009)A New Approach for Document Indexing UsingWavelet Trees., , , , и . DEXA Workshops, стр. 69-73. IEEE Computer Society, (2007)