default search action
Kimmo Fredriksson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j29]Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson:
Suffix Arrays with a Twist. Comput. Informatics 38(3): 555-574 (2019) - [j28]Robert Susik
, Szymon Grabowski, Kimmo Fredriksson:
Revisiting Multiple Pattern Matching. Comput. Informatics 38(4): 937-962 (2019) - 2016
- [j27]Kimmo Fredriksson, Pekka Kilpeläinen:
Practically efficient array initialization. Softw. Pract. Exp. 46(4): 435-467 (2016) - [i7]Kimmo Fredriksson:
Geometric Near-neighbor Access Tree (GNAT) revisited. CoRR abs/1605.05944 (2016) - [i6]Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson, Marcin Raniszewski:
Suffix arrays with a twist. CoRR abs/1607.08176 (2016) - 2015
- [j26]Kimmo Fredriksson, Billy Braithwaite:
Quicker range- and k-NN joins in metric spaces. Inf. Syst. 52: 189-204 (2015) - 2014
- [j25]Kimmo Fredriksson, Emanuele Giaquinta
On a compact encoding of the swap automaton. Inf. Process. Lett. 114(7): 392-396 (2014) - [j24]Emanuele Giaquinta
Motif matching using gapped patterns. Theor. Comput. Sci. 548: 1-13 (2014) - [c30]Robert Susik, Szymon Grabowski, Kimmo Fredriksson:
Multiple Pattern Matching Revisited. Stringology 2014: 59-70 - [i5]Robert Susik
Multiple pattern matching revisited. CoRR abs/1405.5483 (2014) - 2013
- [j23]Kimmo Fredriksson, Szymon Grabowski
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. Eur. J. Comb. 34(1): 38-51 (2013) - [j22]Emanuele Giaquinta
Approximate pattern matching with k-mismatches in packed text. Inf. Process. Lett. 113(19-21): 693-697 (2013) - [c29]Emanuele Giaquinta
Motif Matching Using Gapped Patterns. IWOCA 2013: 448-452 - [c28]Kimmo Fredriksson, Billy Braithwaite:
Quicker Similarity Joins in Metric Spaces. SISAP 2013: 127-140 - [i4]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. CoRR abs/1306.2483 (2013) - [i3]Kimmo Fredriksson, Emanuele Giaquinta:
On a compact encoding of the swap automaton. CoRR abs/1307.0099 (2013) - 2012
- [i2]Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson:
Approximate pattern matching with k-mismatches in packed text. CoRR abs/1211.5433 (2012) - 2010
- [j21]Kimmo Fredriksson:
On building minimal automaton for subset matching queries. Inf. Process. Lett. 110(24): 1093-1098 (2010) - [c27]Kimmo Fredriksson:
From Nondeterministic Suffix Automaton to Lazy Suffix Tree. Algorithms and Applications 2010: 114-129 - [i1]Kimmo Fredriksson:
On building minimal automaton for subset matching queries. CoRR abs/1004.0902 (2010)
2000 – 2009
- 2009
- [j20]Kimmo Fredriksson, Fedor Nikitin:
Simple Random Access Compression. Fundam. Informaticae 92(1-2): 63-81 (2009) - [j19]Kimmo Fredriksson, Szymon Grabowski
Average-optimal string matching. J. Discrete Algorithms 7(4): 579-594 (2009) - [c26]Kimmo Fredriksson, Szymon Grabowski
Fast Convolutions and Their Applications in Approximate String Matching. IWOCA 2009: 254-265 - [c25]Kimmo Fredriksson, Szymon Grabowski
Nested Counters in Bit-Parallel String Matching. LATA 2009: 338-349 - [c24]Karina Figueroa, Kimmo Fredriksson:
Speeding Up Permutation Based Indexing with Indexing. SISAP 2009: 107-114 - 2008
- [j18]Kimmo Fredriksson, Szymon Grabowski
Efficient Algorithms for (delta, gamma, alpha) and (delta, kDelta, alpha)-Matching. Int. J. Found. Comput. Sci. 19(1): 163-183 (2008) - [j17]Szymon Grabowski
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. Inf. Process. Lett. 105(5): 182-187 (2008) - [j16]Kimmo Fredriksson, Szymon Grabowski
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr. 11(4): 335-357 (2008) - [j15]Kimmo Fredriksson:
Succinct backward-DAWG-matching. ACM J. Exp. Algorithmics 13 (2008) - 2007
- [j14]Kimmo Fredriksson, Veli Mäkinen
Rotation and lighting invariant template matching. Inf. Comput. 205(7): 1096-1113 (2007) - [j13]Kimmo Fredriksson:
Engineering efficient metric indexes. Pattern Recognit. Lett. 28(1): 75-84 (2007) - [c23]Kimmo Fredriksson, Fedor Nikitin:
Simple Compression Code Supporting Random Access and Fast String Matching. WEA 2007: 203-216 - [c22]Karina Figueroa, Kimmo Fredriksson:
Simple Space-Time Trade-Offs for AESA. WEA 2007: 229-241 - 2006
- [j12]Kimmo Fredriksson:
On-line Approximate String Matching in Natural Language. Fundam. Informaticae 72(4): 453-466 (2006) - [j11]Kimmo Fredriksson, Veli Mäkinen
Flexible Music Retrieval in Sublinear Time. Int. J. Found. Comput. Sci. 17(6): 1345-1364 (2006) - [j10]Kimmo Fredriksson, Maxim Mozgovoy
Efficient parameterized string matching. Inf. Process. Lett. 100(3): 91-96 (2006) - [j9]Kimmo Fredriksson, Szymon Grabowski
A general compression algorithm that supports fast searching. Inf. Process. Lett. 100(6): 226-232 (2006) - [c21]Kimmo Fredriksson, Szymon Grabowski:
Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. SPIRE 2006: 267-278 - [c20]Kimmo Fredriksson, Szymon Grabowski:
Efficient algorithms for (delta, gamma, alpha)-matching. Stringology 2006: 29-40 - [c19]Kimmo Fredriksson, Szymon Grabowski:
Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. WEA 2006: 170-181 - 2005
- [j8]Kimmo Fredriksson:
Exploiting distance coherence to speed up range queries in metric indexes. Inf. Process. Lett. 95(1): 287-292 (2005) - [j7]Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro:
Increased bit-parallelism for approximate and multiple string matching. ACM J. Exp. Algorithmics 10 (2005) - [j6]Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
Sequential and indexed two-dimensional combinatorial template matching allowing rotations. Theor. Comput. Sci. 347(1-2): 239-275 (2005) - [c18]Maxim Mozgovoy
Fast Plagiarism Detection System. SPIRE 2005: 267-270 - [c17]Kimmo Fredriksson, Szymon Grabowski
Practical and Optimal String Matching. SPIRE 2005: 376-387 - [c16]Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Flexible music retrieval in sublinear time. Stringology 2005: 174-189 - 2004
- [j5]Kimmo Fredriksson, Jorma Tarhio:
Efficient String Matching in Huffman Compressed Texts. Fundam. Informaticae 63(1): 1-16 (2004) - [j4]Kimmo Fredriksson, Gonzalo Navarro:
Average-optimal single and multiple approximate string matching. ACM J. Exp. Algorithmics 9 (2004) - [j3]Gonzalo Navarro, Kimmo Fredriksson:
Average complexity of exact and approximate multiple string matching. Theor. Comput. Sci. 321(2-3): 283-290 (2004) - [c15]Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen:
Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps. 3DPVT 2004: 979-986 - [c14]Kimmo Fredriksson, Gonzalo Navarro:
Improved Single and Multiple Approximate String Matching. CPM 2004: 457-471 - [c13]Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Rotation and Lighting Invariant Template Matching. LATIN 2004: 39-48 - [c12]Kimmo Fredriksson:
Metric Indexes for Approximate String Matching in a Dictionary. SPIRE 2004: 212-213 - [c11]Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro:
Increased Bit-Parallelism for Approximate String Matching. WEA 2004: 285-298 - 2003
- [j2]Kimmo Fredriksson:
Shift-or string matching with super-alphabets. Inf. Process. Lett. 87(4): 201-204 (2003) - [c10]Kimmo Fredriksson, Gonzalo Navarro
Average-Optimal Multiple Approximate String Matching. CPM 2003: 109-128 - [c9]Kimmo Fredriksson:
Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm. SPIRE 2003: 66-79 - [c8]Kimmo Fredriksson, Jorma Tarhio
Processing of Huffman Compressed Texts with a Super-Alphabet. SPIRE 2003: 108-121 - 2002
- [c7]Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. CPM 2002: 235-248 - [c6]Kimmo Fredriksson:
Faster String Matching with Super-Alphabets. SPIRE 2002: 44-57 - 2001
- [c5]Kimmo Fredriksson, Esko Ukkonen:
Faster template matching without FFT. ICIP (1) 2001: 678-681 - 2000
- [c4]Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
An Index for Two Dimensional String Matching Allowing Rotations. IFIP TCS 2000: 59-75 - [c3]Kimmo Fredriksson, Esko Ukkonen:
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. SPIRE 2000: 96-104 - [c2]Kimmo Fredriksson:
Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images. SPIRE 2000: 105-115
1990 – 1999
- 1999
- [j1]Kimmo Fredriksson, Esko Ukkonen:
Combinatorial methods for approximate image matching under translations and rotations. Pattern Recognit. Lett. 20(11-13): 1249-1258 (1999) - 1998
- [c1]Kimmo Fredriksson, Esko Ukkonen:
A Rotation Invariant Filter for Two-Dimensional String Matching. CPM 1998: 118-125
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: