( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast circular dictionary-matching algorithm.

, , , , , , и . Math. Struct. Comput. Sci., 27 (2): 143-156 (2017)

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.

Polikarpos Pissis

Jannis Pissis

Detlef Solondz

Saran Solongo

Dennis T Solon

 

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

Property Suffix Array with Applications., , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 290-302. Springer, (2018)Efficient Identification of k-Closed Strings., , , , , и . EANN, том 744 из Communications in Computer and Information Science, стр. 583-595. Springer, (2017)Influence maximization in the presence of vulnerable nodes: A ratio perspective., , , и . Theor. Comput. Sci., (2021)Symbolic Regression is NP-hard., и . CoRR, (2022)Optimal Computation of all Repetitions in a Weighted String., и . ICABD, том 1146 из CEUR Workshop Proceedings, стр. 9-15. CEUR-WS.org, (2014)Generalised Implementation for Fixed-Length Approximate String Matching under Hamming Distance and Applications., и . IPDPS Workshops, стр. 367-374. IEEE Computer Society, (2015)GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures., , , и . AIAI (2), том 382 из IFIP Advances in Information and Communication Technology, стр. 593-601. Springer, (2012)Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time., , , и . WABI, том 88 из LIPIcs, стр. 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Optimal Computation of Overabundant Words., , , , , , и . WABI, том 88 из LIPIcs, стр. 4:1-4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes., , , , , , , и . COCOON, том 10392 из Lecture Notes in Computer Science, стр. 99-111. Springer, (2017)