Obserwuj
Tomasz Walen
Tomasz Walen
Zweryfikowany adres z mimuw.edu.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
1202013
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
1042014
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
842014
Reversal distance for strings with duplicates: Linear time approximation using hitting set
P Kolman, T Waleń
Approximation and Online Algorithms: 4th International Workshop, WAOA 2006 …, 2007
742007
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
672014
Order-preserving incomplete suffix trees and order-preserving indexes
M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ...
String Processing and Information Retrieval: 20th International Symposium …, 2013
532013
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
452014
LPF computation revisited
M Crochemore, L Ilie, CS Iliopoulos, M Kubica, W Rytter, T Waleń
Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec …, 2009
452009
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
442012
Order-preserving indexing
M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ...
Theoretical Computer Science 638, 122-135, 2016
412016
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
Efficient data structures for the factor periodicity problem
T Kociumaka, J Radoszewski, W Rytter, T Waleń
String Processing and Information Retrieval: 19th International Symposium …, 2012
372012
Efficient seed computation revisited
M Christou, M Crochemore, CS Iliopoulos, M Kubica, SP Pissis, ...
Theoretical Computer Science 483, 171-181, 2013
362013
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
352016
Approximating reversal distance for strings with bounded number of duplicates
P Kolman, T Waleń
Discrete Applied Mathematics 155 (3), 327-336, 2007
342007
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
332013
Fast algorithm for partial covers in words
T Kociumaka, SP Pissis, J Radoszewski, W Rytter, T Waleń
Algorithmica 73 (1), 217-233, 2015
302015
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
292013
Efficient algorithms for two extensions of LPF table: The power of suffix arrays
M Crochemore, CS Iliopoulos, M Kubica, W Rytter, T Waleń
SOFSEM 2010: Theory and Practice of Computer Science: 36th Conference on …, 2010
292010
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
282012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20