Tomasz Waleń

1.6k total citations
40 papers, 334 citations indexed

About

Tomasz Waleń is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Tomasz Waleń has authored 40 papers receiving a total of 334 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Artificial Intelligence, 24 papers in Molecular Biology and 24 papers in Computational Theory and Mathematics. Recurrent topics in Tomasz Waleń's work include Algorithms and Data Compression (32 papers), semigroups and automata theory (23 papers) and DNA and Biological Computing (16 papers). Tomasz Waleń is often cited by papers focused on Algorithms and Data Compression (32 papers), semigroups and automata theory (23 papers) and DNA and Biological Computing (16 papers). Tomasz Waleń collaborates with scholars based in Poland, United Kingdom and France. Tomasz Waleń's co-authors include Janusz M. Bujnicki, Grzegorz Chojnowski, Wojciech Rytter, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Costas S. Iliopoulos, Petr Kolman, Tomasz Kociumaka and Solon P. Pissis and has published in prestigious journals such as Nucleic Acids Research, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Tomasz Waleń

38 papers receiving 328 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Tomasz Waleń Poland 10 213 182 90 52 28 40 334
Alexandru I. Tomescu Finland 11 236 1.1× 147 0.8× 121 1.3× 25 0.5× 44 1.6× 68 437
Jan Holub Czechia 10 128 0.6× 164 0.9× 59 0.7× 71 1.4× 16 0.6× 33 256
Volker Heun Germany 7 78 0.4× 109 0.6× 45 0.5× 35 0.7× 9 0.3× 16 185
A. L. Brown United Kingdom 10 141 0.7× 100 0.5× 36 0.4× 47 0.9× 14 0.5× 28 304
Laurent Mouchard France 11 110 0.5× 168 0.9× 59 0.7× 38 0.7× 10 0.4× 32 280
Christophe Hancart France 3 153 0.7× 271 1.5× 123 1.4× 49 0.9× 18 0.6× 5 335
Dina Sokol United States 7 165 0.8× 163 0.9× 65 0.7× 40 0.8× 18 0.6× 21 248
Giovanna Rosone Italy 10 245 1.2× 341 1.9× 90 1.0× 36 0.7× 29 1.0× 31 388
Bhadrachalam Chitturi India 11 146 0.7× 160 0.9× 32 0.4× 5 0.1× 143 5.1× 36 338
Hassaan Saadat Australia 8 67 0.3× 51 0.3× 41 0.5× 68 1.3× 8 0.3× 19 236

Countries citing papers authored by Tomasz Waleń

Since Specialization
Citations

This map shows the geographic impact of Tomasz Waleń's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tomasz Waleń with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomasz Waleń more than expected).

Fields of papers citing papers by Tomasz Waleń

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tomasz Waleń. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tomasz Waleń. The network helps show where Tomasz Waleń may publish in the future.

Co-authorship network of co-authors of Tomasz Waleń

This figure shows the co-authorship network connecting the top 25 collaborators of Tomasz Waleń. A scholar is included among the top collaborators of Tomasz Waleń based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tomasz Waleń. Tomasz Waleń is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kociumaka, Tomasz, Jakub Radoszewski, Wojciech Rytter, & Tomasz Waleń. (2024). Internal Pattern Matching Queries in a Text and Applications. SIAM Journal on Computing. 53(5). 1524–1577. 1 indexed citations
2.
Radoszewski, Jakub, et al.. (2021). Hardness of Detecting Abelian and Additive Square Factors in Strings. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 19. 1 indexed citations
3.
Crochemore, Maxime, Costas S. Iliopoulos, Tomasz Kociumaka, et al.. (2018). Linear-Time Algorithm for Long LCF with k Mismatches. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
4.
Piątkowski, Paweł, Jagoda Jabłońska, Dorota Niedziałek, et al.. (2017). SupeRNAlign: a new tool for flexible superposition of homologous RNA structures and inference of accurate structure-based sequence alignments. Nucleic Acids Research. 45(16). e150–e150. 8 indexed citations
5.
Crochemore, Maxime, Costas S. Iliopoulos, Tomasz Kociumaka, et al.. (2017). Covering problems for partial words and for indeterminate strings. Theoretical Computer Science. 698. 25–39. 7 indexed citations
6.
Kociumaka, Tomasz, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, & Tomasz Waleń. (2016). Efficient algorithms for shortest partial seeds in words. Theoretical Computer Science. 710. 139–147. 4 indexed citations
7.
Fici, Gabriele, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, & Tomasz Waleń. (2015). On the greedy algorithm for the Shortest Common Superstring problem with reversals. Information Processing Letters. 116(3). 245–251. 2 indexed citations
8.
Crochemore, Maxime, Costas S. Iliopoulos, Tomasz Kociumaka, et al.. (2015). A note on the longest common compatible prefix problem for partial words. Journal of Discrete Algorithms. 34. 49–53. 1 indexed citations
9.
Kociumaka, Tomasz, Jakub Radoszewski, Wojciech Rytter, & Tomasz Waleń. (2015). Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theoretical Computer Science. 602. 7–21. 1 indexed citations
10.
Cygan, Marek, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, & Tomasz Waleń. (2015). Polynomial-time approximation algorithms for weighted LCS problem. Discrete Applied Mathematics. 204. 38–48. 4 indexed citations
11.
Chojnowski, Grzegorz, et al.. (2015). Brickworxbuilds recurrent RNA and DNA structural motifs into medium- and low-resolution electron-density maps. Acta Crystallographica Section D Biological Crystallography. 71(3). 697–705. 8 indexed citations
12.
Waleń, Tomasz, et al.. (2014). ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes. Nucleic Acids Research. 42(19). e151–e151. 41 indexed citations
13.
Crochemore, Maxime, Costas S. Iliopoulos, Marcin Kubica, et al.. (2013). New simple efficient algorithms computing powers and runs in strings. Discrete Applied Mathematics. 163. 258–267. 4 indexed citations
14.
Chojnowski, Grzegorz, Tomasz Waleń, & Janusz M. Bujnicki. (2013). RNA Bricks—a database of RNA 3D motifs and their interactions. Nucleic Acids Research. 42(D1). D123–D131. 60 indexed citations
15.
Crochemore, Maxime, Lucian Ilie, Costas S. Iliopoulos, et al.. (2012). Computing the Longest Previous Factor. European Journal of Combinatorics. 34(1). 15–26. 9 indexed citations
16.
Kubica, Marcin, Jakub Radoszewski, Wojciech Rytter, & Tomasz Waleń. (2012). On the maximum number of cubic subwords in a word. European Journal of Combinatorics. 34(1). 27–37. 6 indexed citations
17.
Kubica, Marcin, Roméo Rizzi, Stéphane Vialette, & Tomasz Waleń. (2011). Approximation of RNA multiple structural alignment. Journal of Discrete Algorithms. 9(4). 365–376.
18.
Crochemore, Maxime, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, & Tomasz Waleń. (2011). Efficient algorithms for three variants of the LPF table. Journal of Discrete Algorithms. 11. 51–61. 15 indexed citations
19.
Kolman, Petr & Tomasz Waleń. (2006). Approximating reversal distance for strings with bounded number of duplicates. Discrete Applied Mathematics. 155(3). 327–336. 11 indexed citations
20.
Bereg, Sergey, Marcin Kubica, Tomasz Waleń, & Binhai Zhu. (2006). RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization. 13(2). 179–188. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026