( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study.

, и . SPIRE, том 14240 из Lecture Notes in Computer Science, стр. 218-232. Springer, (2023)

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.

Robert Gregory

Isa Gregory

Gregory Kroon

Xaver Gregory

Gregory Okereke

 

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

On Relationship Between Term Rewriting Systems and Regular Tree Languages.. RTA, том 488 из Lecture Notes in Computer Science, стр. 299-311. Springer, (1991)Regular Language Constrained Sequence Alignment Revisited., , и . J. Comput. Biol., 18 (5): 771-781 (2011)Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey., , и . WG, том 3787 из Lecture Notes in Computer Science, стр. 16-27. Springer, (2005)Patterns in Words versus Patterns in Trees: A Brief Survey and New Results., и . Ershov Memorial Conference, том 1755 из Lecture Notes in Computer Science, стр. 283-296. Springer, (1999)Optimal Linear Arrangement of Interval Graphs., , , , и . MFCS, том 4162 из Lecture Notes in Computer Science, стр. 267-279. Springer, (2006)Approximate Tandem Repeats., и . Encyclopedia of Algorithms, Springer, (2008)SIGffRid: A tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically driven statistics., , , , , и . BMC Bioinform., (2008)Space-Efficient Representation of Genomic k-Mer Count Tables., , и . WABI, том 201 из LIPIcs, стр. 8:1-8:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Efficient Reconciliation of Genomic Datasets of High Similarity., , и . WABI, том 242 из LIPIcs, стр. 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Efficient Tree-Structured Categorical Retrieval., и . CPM, том 161 из LIPIcs, стр. 4:1-4:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)