( en | de | ru )

 

Disambiguation of "Vialette, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
Parity Permutation Pattern Matching.

, , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 384-395. 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. You can also use the button next to the name to display some publications already assigned to the person.

Stéphane Müller

Stéphane Klein

Stéphane Haussler

Stéphane Clinchant

Stéphane Aubry

 

Other publications of authors with the same name

RECOMB-Comparative Genomics Special Issue., and . J. Comput. Biol., 16 (10): 1285-1286 (2009)Permutation Pattern matching in (213, 231)-avoiding permutations., , and . Discret. Math. Theor. Comput. Sci., (2016)Finding approximate and constrained motifs in graphs., , and . Theor. Comput. Sci., (2013)Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms., , , , , and . Bioinform., 22 (11): 1359-1366 (2006)Parity Permutation Pattern Matching., , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 384-395. Springer, (2023)The Maximum Zero-Sum Partition Problem., , , and . ICS, volume 1723 of Communications in Computer and Information Science, page 73-85. Springer, (2022)The Minimum Substring Cover Problem., , , and . WAOA, volume 4927 of Lecture Notes in Computer Science, page 170-183. Springer, (2007)Recognizing Unit Multiple Intervals Is Hard., , , and . ISAAC, volume 283 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Disorders and Permutations., , and . CPM, volume 191 of LIPIcs, page 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On Recognizing Words That Are Squares for the Shuffle Product., and . CSR, volume 7913 of Lecture Notes in Computer Science, page 235-245. Springer, (2013)