| 2010 | ||
|---|---|---|
| c20 | Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga: Dynamic Edit Distance Table under a General Weighted Cost Function. SOFSEM 2010: 515-527 | |
| 2009 | ||
| c19 | ||
| e1 | Jussi Karlgren, Jorma Tarhio, Heikki Hyyrö (Eds.): String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, Saariselkä, Finland, August 25-27, 2009, Proceedings. Lecture Notes in Computer Science 5721, Springer 2009, isbn 978-3-642-03783-2 | |
| 2008 | ||
| j8 | Heikki Hyyrö: Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching. Inf. Process. Lett. 108(5): 313-319 (2008) | |
| c18 | ||
| c17 | Heikki Hyyrö: An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper). SPIRE 2008: 155-163 | |
| 2006 | ||
| j7 | Heikki Hyyrö, Gonzalo Navarro: Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights. Int. J. Found. Comput. Sci. 17(6): 1325-1344 (2006) | |
| c16 | ||
| 2005 | ||
| j6 | Heikki Hyyrö, Gonzalo Navarro: Bit-Parallel Witnesses and Their Applications to Approximate String Matching. Algorithmica 41(3): 203-231 (2005) | |
| j5 | Heikki Hyyrö, Martti Juhola, Mauno Vihinen: On exact string matching of unique oligonucleotides. Comp. in Bio. and Med. 35(2): 173-181 (2005) | |
| j4 | Heikki Hyyrö: Bit-parallel approximate string matching algorithms with transposition. J. Discrete Algorithms 3(2-4): 215-229 (2005) | |
| j3 | Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro: Increased bit-parallelism for approximate and multiple string matching. ACM Journal of Experimental Algorithmics 10 (2005) | |
| c15 | Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara: Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. SOFSEM 2005: 380-384 | |
| c14 | Heikki Hyyrö: Restricted Transposition Invariant Approximate String Matching Under Edit Distance. SPIRE 2005: 256-266 | |
| c13 | Heikki Hyyrö, Gonzalo Navarro: Bit-parallel computation of local similarity score matrices with unitary weights. Stringology 2005: 95-108 | |
| c12 | Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara: New Bit-Parallel Indel-Distance Algorithm. WEA 2005: 380-390 | |
| 2004 | ||
| j2 | Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 159-170 (2004) | |
| c11 | Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda: On Bit-Parallel Processing of Multi-byte Text. AIRS 2004: 289-300 | |
| c10 | Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. Discovery Science 2004: 32-46 | |
| c9 | Heikki Hyyrö: An Improvement and an Extension on the Hybrid Index for Approximate String Matching. SPIRE 2004: 208-209 | |
| c8 | ||
| c7 | Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Patterns. WABI 2004: 450-462 | |
| c6 | Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro: Increased Bit-Parallelism for Approximate String Matching. WEA 2004: 285-298 | |
| 2003 | ||
| j1 | Heikki Hyyrö: A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances. Nord. J. Comput. 10(1): 29-39 (2003) | |
| c5 | Heikki Hyyrö: Bit-Parallel Approximate String Matching Algorithms with Transposition. SPIRE 2003: 95-107 | |
| c4 | ||
| 2002 | ||
| c3 | ||
| c2 | Heikki Hyyrö: A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances. Stringology 2002: 44-54 | |
| 2001 | ||
| c1 | Heikki Hyyrö: On Using Two-Phase Filtering in Indexed Approximate String Matching with Application to Searching Unique Oligonucleotides. SPIRE 2001: 84-95 | |
Colors in the list of coauthors
Last update Thu May 23 04:32:16 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page