On Approximate String Matching of Unique Oligonucleotides. - Heikki Hyyrö; Mauno Vihinen; Martti Juhola (MedInfo, 2001)

On Using Two-Phase Filtering in Indexed Approximate String Matching with Application to Searching Unique Oligonucleotides. - Heikki Hyyrö (SPIRE, 2001)

Faster Bit-Parallel Approximate String Matching. - Heikki Hyyrö; Gonzalo Navarro 001 (CPM, 2002)

A Practical Index for Genome Searching. - Heikki Hyyrö; Gonzalo Navarro 001 (SPIRE, 2003)

A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances. - Heikki Hyyrö (Nord. J. Comput., 2003)

Practical Methods for Approximate String Matching. - Heikki Hyyrö (2003)

On Bit-Parallel Processing of Multi-byte Text. - Heikki Hyyrö; Jun Takaba; Ayumi Shinohara; Masayuki Takeda (AIRS, 2004)

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. - Shunsuke Inenaga; Hideo Bannai; Heikki Hyyrö; Ayumi Shinohara; Masayuki Takeda; Kenta Nakai; Satoru Miyano (Discovery Science, 2004)

An Improvement and an Extension on the Hybrid Index for Approximate String Matching. - Heikki Hyyrö (SPIRE, 2004)

A Note on Bit-Parallel Alignment Computation. - Heikki Hyyrö (Stringology, 2004)

Finding Optimal Pairs of Patterns. - Hideo Bannai; Heikki Hyyrö; Ayumi Shinohara; Masayuki Takeda; Kenta Nakai; Satoru Miyano (WABI, 2004)

Increased Bit-Parallelism for Approximate String Matching. - Heikki Hyyrö; Kimmo Fredriksson; Gonzalo Navarro 001 (WEA, 2004)

An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. - Hideo Bannai; Heikki Hyyrö; Ayumi Shinohara; Masayuki Takeda; Kenta Nakai; Satoru Miyano (IEEE ACM Trans. Comput. Biol. Bioinform., 2004)

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. - Heikki Hyyrö; Yoan J. Pinzón; Ayumi Shinohara (SOFSEM, 2005)

Restricted Transposition Invariant Approximate String Matching Under Edit Distance. - Heikki Hyyrö (SPIRE, 2005)

New Bit-Parallel Indel-Distance Algorithm. - Heikki Hyyrö; Yoan J. Pinzón; Ayumi Shinohara (WEA, 2005)

Bit-Parallel Witnesses and Their Applications to Approximate String Matching. - Heikki Hyyrö; Gonzalo Navarro 001 (Algorithmica, 2005)

On exact string matching of unique oligonucleotides. - Heikki Hyyrö; Martti Juhola; Mauno Vihinen (Comput. Biol. Medicine, 2005)

Bit-parallel approximate string matching algorithms with transposition. - Heikki Hyyrö (J. Discrete Algorithms, 2005)

Increased bit-parallelism for approximate and multiple string matching. - Heikki Hyyrö; Kimmo Fredriksson; Gonzalo Navarro 001 (ACM J. Exp. Algorithmics, 2005)

Tighter Packed Bit-Parallel NFA for Approximate String Matching. - Heikki Hyyrö (CIAA, 2006)

Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights. - Heikki Hyyrö; Gonzalo Navarro 001 (Int. J. Found. Comput. Sci., 2006)

Notes on generating completely condensed d-neighborhoods. - Heikki Hyyrö (IWOCA, 2008)

An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper). - Heikki Hyyrö (SPIRE, 2008)

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

An Input Sensitive Online Algorithm for LCS Computation. - Heikki Hyyrö (Stringology, 2009)

On computation of calcium cycling anomalies in cardiomyocytes data. - Martti Juhola; Henry Joutsijoki; Kirsi Varpa; Jyri Saarikoski; Jyrki Rasku; Kati Iltanen; Jorma Laurikkala; Heikki Hyyrö; Jorge Avalos-Salguero; Harri Siirtola; Kirsi Penttinen; Katriina Aalto-Setälä (EMBC, 2014)

Signal analysis and classification methods for the calcium transient data of stem cell-derived cardiomyocytes. - Martti Juhola; Kirsi Penttinen; Henry Joutsijoki; Kirsi Varpa; Jyri Saarikoski; Jyrki Rasku; Harri Siirtola; Kati Iltanen; Jorma Laurikkala; Heikki Hyyrö; Jari A. K. Hyttinen; Katriina Aalto-Setälä (Comput. Biol. Medicine, 2015)

Dynamic edit distance table under a general weighted cost function. - Heikki Hyyrö; Kazuyuki Narisawa; Shunsuke Inenaga (J. Discrete Algorithms, 2015)

Compacting a Dynamic Edit Distance Table by RLE Compression. - Heikki Hyyrö; Shunsuke Inenaga (SOFSEM, 2016)

Mining Bit-Parallel LCS-length Algorithms. - Heikki Hyyrö (SPIRE, 2017)

Computing longest common square subsequences. - Takafumi Inoue; Shunsuke Inenaga; Heikki Hyyrö; Hideo Bannai; Masayuki Takeda (CPM, 2018)

GQA: Grammatical Question Answering for RDF Data. - Elizaveta Zimina; Jyrki Nummenmaa; Kalervo Järvelin; Jaakko Peltonen; Kostas Stefanidis; Heikki Hyyrö (SemWebEval@ESWC, 2018)

Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions. - Heikki Hyyrö; Shunsuke Inenaga (Int. J. Found. Comput. Sci., 2018)

A hardness result and new algorithm for the longest common palindromic subsequence problem. - Shunsuke Inenaga; Heikki Hyyrö (Inf. Process. Lett., 2018)

BeLLE: Multinational Research Collaboration on Bebras & ViLLE. - Heidi Kaarto; Heikki Hyyrö; Marika Parviainen (ITiCSE (2), 2023)