| 2008 |
|---|
| 23 | EE | Heikki Hyyrö:
An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper).
SPIRE 2008: 155-163 |
| 22 | EE | Heikki Hyyrö:
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching.
Inf. Process. Lett. 108(5): 313-319 (2008) |
| 2006 |
|---|
| 21 | EE | Heikki Hyyrö:
Tighter Packed Bit-Parallel NFA for Approximate String Matching.
CIAA 2006: 287-289 |
| 20 | EE | 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) |
| 2005 |
|---|
| 19 | EE | Heikki Hyyrö,
Yoan J. Pinzon,
Ayumi Shinohara:
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.
SOFSEM 2005: 380-384 |
| 18 | EE | Heikki Hyyrö:
Restricted Transposition Invariant Approximate String Matching Under Edit Distance.
SPIRE 2005: 256-266 |
| 17 | | Heikki Hyyrö,
Gonzalo Navarro:
Bit-parallel computation of local similarity score matrices with unitary weights.
Stringology 2005: 95-108 |
| 16 | EE | Heikki Hyyrö,
Yoan J. Pinzon,
Ayumi Shinohara:
New Bit-Parallel Indel-Distance Algorithm.
WEA 2005: 380-390 |
| 15 | EE | Heikki Hyyrö,
Kimmo Fredriksson,
Gonzalo Navarro:
Increased bit-parallelism for approximate and multiple string matching.
ACM Journal of Experimental Algorithmics 10: (2005) |
| 14 | EE | Heikki Hyyrö,
Gonzalo Navarro:
Bit-Parallel Witnesses and Their Applications to Approximate String Matching.
Algorithmica 41(3): 203-231 (2005) |
| 13 | EE | Heikki Hyyrö:
Bit-parallel approximate string matching algorithms with transposition.
J. Discrete Algorithms 3(2-4): 215-229 (2005) |
| 2004 |
|---|
| 12 | EE | Heikki Hyyrö,
Jun Takaba,
Ayumi Shinohara,
Masayuki Takeda:
On Bit-Parallel Processing of Multi-byte Text.
AIRS 2004: 289-300 |
| 11 | EE | 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 |
| 10 | EE | Heikki Hyyrö:
An Improvement and an Extension on the Hybrid Index for Approximate String Matching.
SPIRE 2004: 208-209 |
| 9 | EE | Heikki Hyyrö:
A Note on Bit-Parallel Alignment Computation.
Stringology 2004: 79-87 |
| 8 | EE | Hideo Bannai,
Heikki Hyyrö,
Ayumi Shinohara,
Masayuki Takeda,
Kenta Nakai,
Satoru Miyano:
Finding Optimal Pairs of Patterns.
WABI 2004: 450-462 |
| 7 | EE | Heikki Hyyrö,
Kimmo Fredriksson,
Gonzalo Navarro:
Increased Bit-Parallelism for Approximate String Matching.
WEA 2004: 285-298 |
| 6 | EE | 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) |
| 2003 |
|---|
| 5 | EE | Heikki Hyyrö,
Gonzalo Navarro:
A Practical Index for Genome Searching.
SPIRE 2003: 341-349 |
| 4 | EE | Heikki Hyyrö:
Bit-Parallel Approximate String Matching Algorithms with Transposition.
SPIRE 2003: 95-107 |
| 3 | | Heikki Hyyrö:
A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.
Nord. J. Comput. 10(1): 29-39 (2003) |
| 2002 |
|---|
| 2 | EE | Heikki Hyyrö,
Gonzalo Navarro:
Faster Bit-Parallel Approximate String Matching.
CPM 2002: 203-224 |
| 2001 |
|---|
| 1 | | Heikki Hyyrö:
On Using Two-Phase Filtering in Indexed Approximate String Matching with Application to Searching Unique Oligonucleotides.
SPIRE 2001: 84-95 |
