( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Permutation Pattern Matching for Doubly Partially Ordered Patterns.

, , , и . CPM, том 223 из LIPIcs, стр. 21:1-21:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Stéphane Müller

Stéphane Haussler

Stéphane Klein

Stéphane Aubry

Stéphane Audière

 

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

Two-Interval Pattern Problems.. Encyclopedia of Algorithms, (2016)Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs., , и . MFCS, том 3618 из Lecture Notes in Computer Science, стр. 328-339. Springer, (2005)On Recognizing Words That Are Squares for the Shuffle Product., и . CSR, том 7913 из Lecture Notes in Computer Science, стр. 235-245. Springer, (2013)Finding Approximate and Constrained Motifs in Graphs., , и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 388-401. Springer, (2011)Recognizing Unit Multiple Intervals Is Hard., , , и . ISAAC, том 283 из LIPIcs, стр. 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Disorders and Permutations., , и . CPM, том 191 из LIPIcs, стр. 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On recognising words that are squares for the shuffle product., и . Theor. Comput. Sci., (мая 2023)Upper and lower bounds for finding connected motifs in vertex-colored graphs., , , и . J. Comput. Syst. Sci., 77 (4): 799-811 (2011)Finding a Small Number of Colourful Components., , , , , и . CPM, том 128 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Pattern Matching in Protein-Protein Interaction Graphs., , и . FCT, том 4639 из Lecture Notes in Computer Science, стр. 137-148. Springer, (2007)