| A linear time algorithm for consecutive permutation pattern matching M Kubica, T Kulczyński, J Radoszewski, W Rytter, T Waleń Information Processing Letters 113 (12), 430-433, 2013 | 99 | 2013 |
| RNA Bricks—a database of RNA 3D motifs and their interactions G Chojnowski, T Waleń, JM Bujnicki Nucleic acids research 42 (D1), D123-D131, 2014 | 83 | 2014 |
| Reversal distance for strings with duplicates: Linear time approximation using hitting set P Kolman, T Waleń International Workshop on Approximation and Online Algorithms, 279-289, 2006 | 70 | 2006 |
| Internal pattern matching queries in a text and applications T Kociumaka, J Radoszewski, W Rytter, T Waleń Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 59 | 2014 |
| Extracting powers and periods in a word from its runs structure M Crochemore, CS Iliopoulos, M Kubica, J Radoszewski, W Rytter, ... Theoretical Computer Science 521, 29-41, 2014 | 51 | 2014 |
| Order-preserving incomplete suffix trees and order-preserving indexes M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... International Symposium on String Processing and Information Retrieval, 84-95, 2013 | 47 | 2013 |
| LPF computation revisited M Crochemore, L Ilie, CS Iliopoulos, M Kubica, W Rytter, T Waleń International Workshop on Combinatorial Algorithms, 158-169, 2009 | 44 | 2009 |
| Efficient data structures for the factor periodicity problem T Kociumaka, J Radoszewski, W Rytter, T Waleń International Symposium on String Processing and Information Retrieval, 284-294, 2012 | 39 | 2012 |
| Improved algorithms for the range next value problem and applications CS Iliopoulos, M Crochemore, M Kubica, MS Rahman, T Walen 25th International Symposium on Theoretical Aspects of Computer Science …, 2008 | 38 | 2008 |
| A Linear Time Algorithm for Seeds Computation T Kociumaka, M Kubica, J Radoszewski, W Rytter, T Walen Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012 …, 2012 | 37 | 2012 |
| Approximating reversal distance for strings with bounded number of duplicates P Kolman, T Waleń Discrete Applied Mathematics 155 (3), 327-336, 2007 | 32 | 2007 |
| Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 31 | 2016 |
| ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes T Waleń, G Chojnowski, P Gierski, JM Bujnicki Nucleic acids research 42 (19), e151-e151, 2014 | 31 | 2014 |
| Efficient algorithms for two extensions of LPF table: The power of suffix arrays M Crochemore, CS Iliopoulos, M Kubica, W Rytter, T Waleń International Conference on Current Trends in Theory and Practice of …, 2010 | 30 | 2010 |
| Faster longest common extension queries in strings over general alphabets P Gawrychowski, T Kociumaka, W Rytter, T Waleń 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, 5:1--5:13, 2016 | 28 | 2016 |
| Computing the longest previous factor M Crochemore, L Ilie, CS Iliopoulos, M Kubica, W Rytter, T Waleń European Journal of Combinatorics 34 (1), 15-26, 2013 | 27 | 2013 |
| Extracting powers and periods in a string from its runs structure M Crochemore, C Iliopoulos, M Kubica, J Radoszewski, W Rytter, T Waleń International Symposium on String Processing and Information Retrieval, 258-269, 2010 | 27 | 2010 |
| Efficient seeds computation revisited M Christou, M Crochemore, CS Iliopoulos, M Kubica, SP Pissis, ... Annual Symposium on Combinatorial Pattern Matching, 350-363, 2011 | 26 | 2011 |
| A note on efficient computation of all Abelian periods in a string M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, J Pachocki, ... Information Processing Letters 113 (3), 74-77, 2013 | 25 | 2013 |
| Efficient algorithms for three variants of the LPF table M Crochemore, CS Iliopoulos, M Kubica, W Rytter, T Waleń Journal of Discrete Algorithms 11, 51-61, 2012 | 25 | 2012 |
Wojciech RytterWarsaw UniversityVerified email at mimuw.edu.pl
