Heikki Hyyrö

Orcid: 0009-0004-3932-064X

According to our database1, Heikki Hyyrö authored at least 35 papers between 2001 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
BeLLE: Multinational Research Collaboration on Bebras & ViLLE.
Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 2, 2023

2018
A hardness result and new algorithm for the longest common palindromic subsequence problem.
Inf. Process. Lett., 2018

Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions.
Int. J. Found. Comput. Sci., 2018

GQA: Grammatical Question Answering for RDF Data.
Proceedings of the Semantic Web Challenges, 2018

Computing longest common square subsequences.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Mining Bit-Parallel LCS-length Algorithms.
Proceedings of the String Processing and Information Retrieval, 2017

2016
Compacting a Dynamic Edit Distance Table by RLE Compression.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
Dynamic edit distance table under a general weighted cost function.
J. Discrete Algorithms, 2015

Signal analysis and classification methods for the calcium transient data of stem cell-derived cardiomyocytes.
Comput. Biol. Medicine, 2015

2014
On computation of calcium cycling anomalies in cardiomyocytes data.
Proceedings of the 36th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2014

2009
An Input Sensitive Online Algorithm for LCS Computation.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching.
Inf. Process. Lett., 2008

An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper).
Proceedings of the String Processing and Information Retrieval, 2008

Notes on generating completely condensed d-neighborhoods.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2006
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights.
Int. J. Found. Comput. Sci., 2006

Tighter Packed Bit-Parallel NFA for Approximate String Matching.
Proceedings of the Implementation and Application of Automata, 2006

2005
Increased bit-parallelism for approximate and multiple string matching.
ACM J. Exp. Algorithmics, 2005

Bit-parallel approximate string matching algorithms with transposition.
J. Discrete Algorithms, 2005

On exact string matching of unique oligonucleotides.
Comput. Biol. Medicine, 2005

Bit-Parallel Witnesses and Their Applications to Approximate String Matching.
Algorithmica, 2005

New Bit-Parallel Indel-Distance Algorithm.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Restricted Transposition Invariant Approximate String Matching Under Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2005

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

2004
An O(N<sup>2</sup>) Algorithm for Discovering Optimal Boolean Pattern Pairs.
IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Increased Bit-Parallelism for Approximate String Matching.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Finding Optimal Pairs of Patterns.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

A Note on Bit-Parallel Alignment Computation.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

An Improvement and an Extension on the Hybrid Index for Approximate String Matching.
Proceedings of the String Processing and Information Retrieval, 2004

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Proceedings of the Discovery Science, 7th International Conference, 2004

On Bit-Parallel Processing of Multi-byte Text.
Proceedings of the Information Retrieval Technology, Asia Information Retrieval Symposium, 2004

2003
A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.
Nord. J. Comput., 2003

A Practical Index for Genome Searching.
Proceedings of the String Processing and Information Retrieval, 2003

2002
Faster Bit-Parallel Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
On Using Two-Phase Filtering in Indexed Approximate String Matching with Application to Searching Unique Oligonucleotides.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

On Approximate String Matching of Unique Oligonucleotides.
Proceedings of the MEDINFO 2001, 2001


  Loading...