Jorma Tarhio
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jorma Tarhio has a total of 102 co-authors. Here are the top co-authors by number of shared publications:
- Leena Salmela
Department of Computer Science, University of Helsinki, Helsinki, Finland
15 shared publications Erkki Sutinen
University of Joensuu, Finland
10 shared publicationsE. Sutinen
9 shared publicationsHannu Peltola
9 shared publicationsEsko Ukkonen
University of Helsinki
5 shared publicationsGonzalo Navarro
5 shared publications
Latest Publications
- Open Access
- 1 July 2026
- Published by Wiley in Software: Practice and Experience
- Vol. 56 (11) , 1323-1333
Improving String Matching through Enhanced Hashing
Background: Hashing offers opportunities to tune string matching algorithms while enabling efficient data retrieval and pattern detection. Many of the best algorithms apply hashing. Objective: We try to develop faster online algorithms for exact string matching. Methods: We present a set of refined hashing techniques and demonstrate their applicability by experiments. Results: Experiments on various data sets reveal significant improvements in search speed. Results: Our methods reduce computational overhead, enabling string matching algorithms to process larger datasets more efficiently and with better scalability.
- 1 July 2026
- Published by Wiley in Software: Practice and Experience
- Vol. 56 (11) , 1323-1333
Open AccessImproving String Matching through Enhanced Hashing
Background: Hashing offers opportunities to tune string matching algorithms while enabling efficient data retrieval and pattern detection. Many of the best algorithms apply hashing. Objective: We try to develop faster online algorithms for exact string matching. Methods: We present a set of refined hashing techniques and demonstrate their applicability by experiments. Results: Experiments on various data sets reveal significant improvements in search speed. Results: Our methods reduce computational overhead, enabling string matching algorithms to process larger datasets more efficiently and with better scalability.
- Open Access
- 29 December 2025
- Published by MDPI AG in Algorithms
- Vol. 19 (1) , 30
Comparison of Online Searching Algorithms for IUPAC Nucleotide Sequences
We consider online pattern matching algorithms for IUPAC nucleotide sequences. We present an experimental comparison of search algorithms while allowing 3% degenerate symbols. In addition, we introduce two new algorithms, one utilizing SIMD instructions for short patterns and another for long patterns. A BNDM variation with 6-grams turned out to be the best general method to search IUPAC sequences.
- 29 December 2025
- Published by MDPI AG in Algorithms
- Vol. 19 (1) , 30
Open AccessComparison of Online Searching Algorithms for IUPAC Nucleotide Sequences
We consider online pattern matching algorithms for IUPAC nucleotide sequences. We present an experimental comparison of search algorithms while allowing 3% degenerate symbols. In addition, we introduce two new algorithms, one utilizing SIMD instructions for short patterns and another for long patterns. A BNDM variation with 6-grams turned out to be the best general method to search IUPAC sequences.
- Open Access
- 13 January 2025
- Published by Elsevier in Information Processing Letters
- Vol. 189
String searching with mismatches using AVX2 and AVX-512 instructions
- 13 January 2025
- Published by Elsevier in Information Processing Letters
- Vol. 189
Open AccessString searching with mismatches using AVX2 and AVX-512 instructions
- Open Access
- 4 April 2024
- Published by Wiley in Software: Practice and Experience
- Vol. 54 (11) , 2160-2169
Searching long patterns with BNDM
We present new algorithms for exact string matching of long patterns. Our algorithms read ‐grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments. Many of our algorithms were faster than previous methods for English and DNA patterns between 400 and 50,000 in length. Our algorithms were still better when the preprocessing time was taken into account or when the patterns were taken from a different text of the same type.
- 4 April 2024
- Published by Wiley in Software: Practice and Experience
- Vol. 54 (11) , 2160-2169
Open AccessSearching long patterns with BNDM
We present new algorithms for exact string matching of long patterns. Our algorithms read ‐grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments. Many of our algorithms were faster than previous methods for English and DNA patterns between 400 and 50,000 in length. Our algorithms were still better when the preprocessing time was taken into account or when the patterns were taken from a different text of the same type.
- Open Access
- 8 March 2024
- Published by Wiley
Searching Long Patterns with BNDM
We present new algorithms for exact string matching of long patterns. Our algorithms read q-grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments. Many of our algorithms were faster than previous methods for English and DNA patterns between 400 and 50,000 in length. Our algorithms were still better when the preprocessing time was taken into account or when the patterns were taken from a different text of the same type.
- 8 March 2024
- Published by Wiley
Open AccessSearching Long Patterns with BNDM
We present new algorithms for exact string matching of long patterns. Our algorithms read q-grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments. Many of our algorithms were faster than previous methods for English and DNA patterns between 400 and 50,000 in length. Our algorithms were still better when the preprocessing time was taken into account or when the patterns were taken from a different text of the same type.
- 1 March 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 274, 54-66
Improved online algorithms for jumbled matching
- 1 March 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 274, 54-66
Improved online algorithms for jumbled matching
- Open Access
- 21 June 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (6) , 124
Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
We present two modifications of Duval’s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to skip a significant number of characters of the string. Moreover, it can be engineered to have linear time complexity in the worst case. When there is a run-length encoded string R of length , the other algorithm computes the Lyndon factorization of R in time and in constant space. It is shown by experimental results that the new variations are faster than Duval’s original algorithm in many scenarios.- 21 June 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (6) , 124
Open AccessLyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
We present two modifications of Duval’s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to skip a significant number of characters of the string. Moreover, it can be engineered to have linear time complexity in the worst case. When there is a run-length encoded string R of length , the other algorithm computes the Lyndon factorization of R in time and in constant space. It is shown by experimental results that the new variations are faster than Duval’s original algorithm in many scenarios. - Open Access
- 18 September 2017
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 22 (1) , 1-12
Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
We consider approximate string matching of a circular pattern consisting of the rotations of a pattern of length m . From SBNDM and Tuned Shift-Add, we derive a sublinear-time algorithm for searching a noncircular pattern with k allowed mismatches, which is extended to the problem of approximate circular pattern matching with k mismatches. We prove that the presented algorithms are average-optimal for m ⋅⌈log 2 ( k +1)+1 ⌉ = O ( w ), where w is the size of the computer word in bits. Experiments conducted under the aforementioned condition show that the new k -mismatches algorithm for circular strings outperforms previous solutions in practice. In particular, our algorithm is the first nonfiltering method for approximate circular string matching in sublinear average time, which makes it more suitable than earlier filtering methods for high error levels k / m and small alphabets.
- 18 September 2017
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 22 (1) , 1-12
Open AccessBit-Parallel Approximate Matching of Circular Strings with k Mismatches
We consider approximate string matching of a circular pattern consisting of the rotations of a pattern of length m . From SBNDM and Tuned Shift-Add, we derive a sublinear-time algorithm for searching a noncircular pattern with k allowed mismatches, which is extended to the problem of approximate circular pattern matching with k mismatches. We prove that the presented algorithms are average-optimal for m ⋅⌈log 2 ( k +1)+1 ⌉ = O ( w ), where w is the size of the computer word in bits. Experiments conducted under the aforementioned condition show that the new k -mismatches algorithm for circular strings outperforms previous solutions in practice. In particular, our algorithm is the first nonfiltering method for approximate circular string matching in sublinear average time, which makes it more suitable than earlier filtering methods for high error levels k / m and small alphabets.
- Open Access
- 1 August 2017
- Published by Wiley in Software: Practice and Experience
- Vol. 47 (12) , 1877-1885
Technology beats algorithms (in exact string matching)
Summary: More than 120 algorithms have been developed for exact string matching within the last 40 years. We show by experiments that the naïve algorithm exploiting SIMD instructions of modern CPUs (with symbols compared in a special order) is the fastest one for patterns of length up to about 50 symbols and extremely good for longer patterns and small alphabets. The algorithm compares 16 or 32 characters in parallel by applying SSE2 or AVX2 instructions, respectively. Moreover, it uses loop peeling to further speed up the searching phase. We tried several orders for comparisons of pattern symbols, and the increasing order of their probabilities in the text was the best.
- 1 August 2017
- Published by Wiley in Software: Practice and Experience
- Vol. 47 (12) , 1877-1885
Open AccessTechnology beats algorithms (in exact string matching)
Summary: More than 120 algorithms have been developed for exact string matching within the last 40 years. We show by experiments that the naïve algorithm exploiting SIMD instructions of modern CPUs (with symbols compared in a special order) is the fastest one for patterns of length up to about 50 symbols and extremely good for longer patterns and small alphabets. The algorithm compares 16 or 32 characters in parallel by applying SSE2 or AVX2 instructions, respectively. Moreover, it uses loop peeling to further speed up the searching phase. We tried several orders for comparisons of pattern symbols, and the increasing order of their probabilities in the text was the best.
- Open Access
- 24 August 2016
- Published by Wiley in Software: Practice and Experience
- Vol. 47 (5) , 731-739
Engineering order‐preserving pattern matching with SIMD parallelism
- 24 August 2016
- Published by Wiley in Software: Practice and Experience
- Vol. 47 (5) , 731-739
Open AccessEngineering order‐preserving pattern matching with SIMD parallelism