Jorma Tarhio

Orcid: 0000-0003-2455-1985

According to our database1, Jorma Tarhio authored at least 99 papers between 1982 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Searching long patterns with BNDM.
Softw. Pract. Exp., 2024

2023
Approximate String Searching with AVX2 and AVX-512.
Proceedings of the Prague Stringology Conference 2023, 2023

2022
Approximate String Matching with SIMD.
Comput. J., 2022

2021
Searching with Extended Guard and Pivot Loop.
Proceedings of the Prague Stringology Conference 2021, 2021

Pitfalls of Algorithm Comparison.
Proceedings of the Prague Stringology Conference 2021, 2021

2020
Improved online algorithms for jumbled matching.
Discret. Appl. Math., 2020

Tune-up for the Dead-Zone Algorithm.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

2019
Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings.
Algorithms, 2019

2017
Technology beats algorithms (in exact string matching).
Softw. Pract. Exp., 2017

Engineering order-preserving pattern matching with SIMD parallelism.
Softw. Pract. Exp., 2017

Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches.
ACM J. Exp. Algorithmics, 2017

Counting Mismatches with SIMD.
Proceedings of the Prague Stringology Conference 2017, 2017

2016
A filtration method for order-preserving matching.
Inf. Process. Lett., 2016

Jumbled Matching with SIMD.
Proceedings of the Prague Stringology Conference 2016, 2016

2015
Alternative Algorithms for Order-Preserving Matching.
Proceedings of the Prague Stringology Conference 2015, 2015

Tuning Algorithms for Jumbled Matching.
Proceedings of the Prague Stringology Conference 2015, 2015

Filtration Algorithms for Approximate Order-Preserving Matching.
Proceedings of the String Processing and Information Retrieval, 2015

2014
String matching with lookahead.
Discret. Appl. Math., 2014

Approximate Online Matching of Circular Strings.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Order-Preserving Matching with Filtration.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Speeding up Compressed Matching with SBNDM2.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Alternative Algorithms for Lyndon Factorization.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Improved Two-Way Bit-parallel Search.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

2012
String matching with alphabet sampling.
J. Discrete Algorithms, 2012

Indexed Multi-pattern Matching.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Variations of Forward-SBNDM.
Proceedings of the Prague Stringology Conference 2011, 2011

GAST, a Genomic Alignment Search Tool.
Proceedings of the BIOINFORMATICS 2011, 2011

2010
Improving practical exact string matching.
Inf. Process. Lett., 2010

Approximate Boyer-Moore String Matching for Small Alphabets.
Algorithmica, 2010

Bit-Parallel Search Algorithms for Long Patterns.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Approximate String Matching with Reduced Alphabet.
Proceedings of the Algorithms and Applications, 2010

PMSGA: A Fast DNA Fragment Assembler.
Proceedings of the BIOINFORMATICS 2010, 2010

2009
mpscan: Fast Localisation of Multiple Reads in Genomes.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Towards Automated Management of Compiler Assignments.
Proceedings of the CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Lisboa, Portugal, March 23-26, 2009, 2009

Tuning BNDM with q-Grams.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Fast parameterized matching with q-grams.
J. Discrete Algorithms, 2008

Speeding Up Pattern Matching by Text Sampling.
Proceedings of the String Processing and Information Retrieval, 2008

Comparison of Exact String Matching Algorithms for Biological Sequences.
Proceedings of the Bioinformatics Research and Development, 2008

2007
On String Matching in Chunked Texts.
Proceedings of the Implementation and Application of Automata, 2007

Platform for Elaboration of Search Results.
Proceedings of the WEBIST 2007, 2007

Algorithms for Weighted Matching.
Proceedings of the String Processing and Information Retrieval, 2007

Tuning Approximate Boyer-Moore for Gene Sequences.
Proceedings of the String Processing and Information Retrieval, 2007

A Framework for Research on Technology-Enhanced Special Education.
Proceedings of the 7th IEEE International Conference on Advanced Learning Technologies, 2007

2006
Multipattern string matching with <i>q</i>-grams.
ACM J. Exp. Algorithmics, 2006

Sublinear Algorithms for Parameterized Matching.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
LZgrep: a Boyer-Moore string matching tool for Ziv-Lempel compressed text.
Softw. Pract. Exp., 2005

Indexing text with approximate <i>q</i>-grams.
J. Discrete Algorithms, 2005

Advanced Multiple Representation Concept Maps for Constructing Shared Conceptual Artifacts.
Proceedings of the Cognition and Exploratory Learning in Digital Age, 2005

2004
Approximate String Matching with Ordered q-Grams.
Nord. J. Comput., 2004

Efficient String Matching in Huffman Compressed Texts.
Fundam. Informaticae, 2004

Mobile Collaborative Concept Mapping - Combining Classroom Activity with Simultaneous Field Exploration.
Proceedings of the Proceedings 2nd IEEE International Workshop on Wireless and Mobile Technologies in Education, 2004

2003
Transposition Invariant Pattern Matching for Multi-Track Strings.
Nord. J. Comput., 2003

Easy Algorithm Animation on the Web.
Multim. Tools Appl., 2003

A visualisation tool as a demonstration aid.
Comput. Educ., 2003

Alternative Algorithms for Bit-Parallel String Matching.
Proceedings of the String Processing and Information Retrieval, 2003

Processing of Huffman Compressed Texts with a Super-Alphabet.
Proceedings of the String Processing and Information Retrieval, 2003

Tuning String Matching for Huge Pattern Sets.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
Concept Gaming.
Proceedings of the International Conference on Computers in Education, 2002

String Matching with Stopper Compression.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

String Matching with Stopper Encoding and Code Splitting.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Indexing Methods for Approximate String Matching.
IEEE Data Eng. Bull., 2001

On Compression of Parse Trees.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

Versatile concept map viewing on the Web.
Proceedings of the 6th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2001

Understanding Algorithms by Means of Visualized Path Testing.
Proceedings of the Software Visualization, 2001

Perspectives on Program Animation with Jeliot.
Proceedings of the Software Visualization, 2001

2000
Detecting Monophonic Patterns within Polyphonic Sources.
Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 2000

How a visualization tool can be used: Evaluating a tool in a research & development project.
Proceedings of the 12th Annual Workshop of the Psychology of Programming Interest Group, 2000

Boyer-Moore String Matching over Ziv-Lempel Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Indexing Text with Approximate q-Grams.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1998
Automated Animation of Algorithms with Eliot.
J. Vis. Lang. Comput., 1998

Visualization and imagery in teaching programming.
Proceedings of the 10th Annual Workshop of the Psychology of Programming Interest Group, 1998

Resources, tools, and techniques for problem based learning in computing.
Proceedings of the Working Group Reports of the 3rd Annual SIGCSE/SIGCUE ITiCSE Conference on Integrating Technology into Computer Science Education, 1998

On animation features of Excel.
Proceedings of the 6th Annual Conference on the Teaching of Computing and the 3rd Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 1998

Combining Algorithmic and Creative Problem Solving On the Web.
Proceedings of the Teleteaching '98 - Distance Learning, 1998

1997
String Matching in the DNA Alphabet.
Softw. Pract. Exp., 1997

Animation of User Algorithms on the Web.
Proceedings of the Proceedings 1997 IEEE Symposium on Visual Languages, 1997

Object-Oriented Visualization of Program Logic.
Proceedings of the TOOLS 1997: 23rd International Conference on Technology of Object-Oriented Languages and Systems, July 28, 1997

Excel as an algorithm animation environment.
Proceedings of the 2nd Annual Conference on Integrating Technology into Computer Science Education, 1997

Using the WWW as the delivery mechanism for interactive, visualization-based instructional modules (report of the ITiCSE 1997 working group on visualization).
Proceedings of the supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings, 1997

CLAP: teaching data structures in a creative way.
Proceedings of the 2nd Annual Conference on Integrating Technology into Computer Science Education, 1997

Animation of algorithms with Eliot and Jeliot (demonstration).
Proceedings of the supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings, 1997

Impacts of interdisciplinary dialogue to computer science education.
Proceedings of the Informatics in Higher Education, 1997

1996
A Comparison of Approximate String Matching Algorithms.
Softw. Pract. Exp., 1996

A sublinear algorithm for two-dimensional string matching.
Pattern Recognit. Lett., 1996

On Distinguishing Unique Combinations in Biological Sequences.
J. Comput. Biol., 1996

Filtration with q-Samples in Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
On Using q-Gram Locations in Approximate String Matching.
Proceedings of the Algorithms, 1995

1993
Approximate Boyer-Moore String Matching.
SIAM J. Comput., 1993

1991
Attribute Evaluation and Parsing.
Proceedings of the Attribute Grammars, 1991

1990
Uncle-Atrributed Grammars.
BIT, 1990

The Hierarchy of LR-Attributed Grammars.
Proceedings of the Attribute Grammars and their Applications, 1990

Boyer-Moore Approach to Approximate String Matching (Extended Abstract).
Proceedings of the SWAT 90, 1990

1988
A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings.
Theor. Comput. Sci., 1988

Looping LR Parsers.
Inf. Process. Lett., 1988

A Compiler Generator for Attributive Evaluation During LR Parsing.
Proceedings of the Compiler Compilers and High Speed Compilation, 1988

1986
A globalizing transformation for attribute grammars.
Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, 1986

A Greedy Algorithm for Constructing Shortest Common Superstrings.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1983
Algorithms for Some String Matching Problems Arising in Molecular Genetics.
Proceedings of the Information Processing 83, 1983

1982
LR Parsing of Some Ambiguous Grammars.
Inf. Process. Lett., 1982


  Loading...