Filters








6 Hits in 4.2 sec

Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451)

Michael Albert, David Bevan, Miklós Bóna, István Miklós, Michael Wagner
2019 Dagstuhl Reports  
We summarize key features of the workshop, such as the three main research areas in which the participants are active, the number and types of talks, and the geographic diversity of the attendees.  ...  We also provide a sampling of the collaborations started at the workshop, and explain why we believe that the workshop was successful, and why we believe it should take place again in the future.  ...  , Pattern Avoidance, and Statistical Mechanics 8 4 5 1 -Genomics, Pattern Avoidance, and Statistical Mechanics -Genomics, Pattern Avoidance, and Statistical Mechanics  ... 
doi:10.4230/dagrep.8.11.1 dblp:journals/dagstuhl-reports/AlbertBBM18 fatcat:j6akx4yqlbgrdfp73uwqzgwale

Faster and simpler algorithms for finding large patterns in permutations [article]

László Kozma
2019 arXiv   pre-print
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968).  ...  These results improve the earlier best bounds of Ahal and Rabinovich (2000), and Bruner and Lackner (2012), and are the fastest algorithms for the problem when k = Ω( n).  ...  This work was prompted by the Dagstuhl Seminar 18451 "Genomics, Pattern Avoidance, and Statistical Mechanics".  ... 
arXiv:1902.08809v2 fatcat:tb2kb2zh6zfavkjq4ez74jtjem

Finding and counting permutations via CSPs [article]

Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2019 arXiv   pre-print
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968).  ...  time is unlikely, even for patterns from these restricted classes.  ...  This work was prompted by the Dagstuhl Seminar 18451 "Genomics, Pattern Avoidance, and Statistical Mechanics".  ... 
arXiv:1908.04673v1 fatcat:uzraxyou3jdybawbiojy3l2gk4

Finding and Counting Permutations via CSPs

Benjamin Aram Berendsohn, László Kozma, Dániel Marx
2021 Algorithmica  
AbstractPermutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968).  ...  We further prove that 3-increasing (4321-avoiding) and 3-decreasing (1234-avoiding) permutations can, in some sense, embed arbitrary permutations of almost linear length, which indicates that a sub-exponential  ...  This work was prompted by the Dagstuhl Seminar 18451 "Genomics, Pattern Avoidance, and Statistical Mechanics".  ... 
doi:10.1007/s00453-021-00812-z fatcat:owcrk6hapbcvjp3nv5ydv7jsrm

Dagstuhl Reports, Volume 8, Issue 11, November 2018, Complete Issue [article]

2019
Dagstuhl Reports, Volume 8, Issue 11, November 2018, Complete Issue  ...  18451 -Genomics, Pattern Avoidance, and Statistical Mechanics Two topics on permutation patterns Acknowledgments.  ...  The organizers of the seminar would also like to thank Ray Siemens and Dan Edelstein for their contributions to the initial Dagstuhl proposal.  ... 
doi:10.4230/dagrep.8.11 fatcat:26dpkqaulza4pjp6jqo2u6qqf4

Finding and Counting Permutations via CSPs

Benjamin Aram Berendsohn, Laszlo Kozma, Daniel Marx, Universitätsbibliothek Der FU Berlin
2021
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968).  ...  We further prove that 3-increasing (4321-avoiding) and 3-decreasing (1234-avoiding) permutations can, in some sense, embed arbitrary permutations of almost linear length, which indicates that a sub-exponential  ...  This work was prompted by the Dagstuhl Seminar 18451 "Genomics, Pattern Avoidance, and Statistical Mechanics".  ... 
doi:10.17169/refubium-29991 fatcat:dcilhv7v7ndh3jt57p63nvu4lu