Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
DNA-Binding Specificities of Human Transcription Factors
2013889 citationsArttu Jolma, Jian Yan et al.profile →
This map shows the geographic impact of Esko Ukkonen'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 Esko Ukkonen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Esko Ukkonen more than expected).
This network shows the impact of papers produced by Esko Ukkonen. 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 Esko Ukkonen. The network helps show where Esko Ukkonen may publish in the future.
Co-authorship network of co-authors of Esko Ukkonen
This figure shows the co-authorship network connecting the top 25 collaborators of Esko Ukkonen.
A scholar is included among the top collaborators of Esko Ukkonen 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 Esko Ukkonen. Esko Ukkonen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Mäkinen, Veli, et al.. (2003). Algorithms for Transposition Invariant String Matching. 191–202.13 indexed citations
8.
Mäkinen, Veli & Esko Ukkonen. (2002). Local similarity based point-pattern matching. Lecture notes in computer science. 2373. 115–132.1 indexed citations
9.
Lemström, Kjell & Esko Ukkonen. (2000). Including Interval Encoding Into Edit Distance Based Music Comparison and Retrieval.16 indexed citations
10.
Brāzma, Alvis, Inge Jonassen, Jaak Vilo, & Esko Ukkonen. (1998). Predicting gene regulatory elements from their expression data in the complete yeast genome..2 indexed citations
11.
Brāzma, Alvis, Jaak Vilo, & Esko Ukkonen. (1997). Finding transcription factor binding site combinations in the yeast genome.. 57–59.8 indexed citations
Mannila, Heikki & Esko Ukkonen. (1987). Flow Analysis of Prolog Programs.. 205–214.28 indexed citations
18.
Ukkonen, Esko, et al.. (1984). Finding Temporary Terms in Prolog Programs.. Future Generation Computer Systems. 275–282.3 indexed citations
19.
Peltola, Hannu, Hans Söderlund, Jorma Tarhio, & Esko Ukkonen. (1983). Algorithms for Some String Matching Problems Arising in Molecular Genetics.. IFIP Congress. 59–64.31 indexed citations
20.
Soisalon-Soininen, Eljas & Esko Ukkonen. (1976). A Characterization of LL(k) Languages.. International Colloquium on Automata, Languages and Programming. 20–30.4 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.