


default search action
Esko Ukkonen
Person information
- affiliation: University of Helsinki, Finland
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
- [j64]Jarkko Toivonen
, Pratyush K. Das
, Jussi Taipale, Esko Ukkonen
:
MODER2: first-order Markov modeling and discovery of monomeric and dimeric binding motifs. Bioinform. 36(9): 2690-2696 (2020)
2010 – 2019
- 2018
- [c84]Esko Ukkonen:
Discovery of Regulatory Motifs in DNA. Stringology 2018: 1 - [e5]Laxmi Parida, Esko Ukkonen:
18th International Workshop on Algorithms in Bioinformatics, WABI 2018, August 20-22, 2018, Helsinki, Finland. LIPIcs 113, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-082-8 [contents] - 2017
- [j63]Janne H. Korhonen, Kimmo Palin
, Jussi Taipale, Esko Ukkonen
:
Fast motif matching revisited: high-order PWMs, SNPs and indels. Bioinform. 33(4): 514-521 (2017) - [j62]Leena Salmela
, Riku Walve, Eric Rivals
, Esko Ukkonen
:
Accurate self-correction of errors in long reads using de Bruijn graphs. Bioinform. 33(6): 799-806 (2017) - [c83]Jarkko Toivonen
, Jussi Taipale, Esko Ukkonen
:
Seed-driven Learning of Position Probability Matrices from Large Sequence Sets. WABI 2017: 25:1-25:13 - 2016
- [r3]Veli Mäkinen, Esko Ukkonen:
Point Pattern Matching. Encyclopedia of Algorithms 2016: 1589-1592 - 2015
- [j61]Tomás Flouri
, Emanuele Giaquinta
, Kassian Kobert, Esko Ukkonen
:
Longest common substrings with k mismatches. Inf. Process. Lett. 115(6-8): 643-647 (2015) - 2014
- [j60]Emanuele Giaquinta
, Kimmo Fredriksson, Szymon Grabowski
, Alexandru I. Tomescu
, Esko Ukkonen
:
Motif matching using gapped patterns. Theor. Comput. Sci. 548: 1-13 (2014) - [i4]Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen:
Longest common substrings with k mismatches. CoRR abs/1409.1694 (2014) - 2013
- [j59]Emanuele Giaquinta
, Szymon Grabowski
, Esko Ukkonen
:
Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models. J. Comput. Biol. 20(9): 621-630 (2013) - [c82]Emanuele Giaquinta
, Kimmo Fredriksson, Szymon Grabowski
, Esko Ukkonen
:
Motif Matching Using Gapped Patterns. IWOCA 2013: 448-452 - [i3]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. CoRR abs/1306.2483 (2013) - 2012
- [c81]Esko Ukkonen:
How to Reconstruct a Genome. MFCS 2012: 48 - 2011
- [j58]Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen
:
Efficient algorithms for the discovery of gapped factors. Algorithms Mol. Biol. 6: 5 (2011) - [j57]Leena Salmela
, Veli Mäkinen
, Niko Välimäki, Johannes Ylinen, Esko Ukkonen
:
Fast scaffolding with small independent mixed integer programs. Bioinform. 27(23): 3259-3265 (2011) - [j56]Gregory Kucherov
, Esko Ukkonen:
Editorial. J. Discrete Algorithms 9(1): 1 (2011) - [j55]Cinzia Pizzi, Pasi Rastas
, Esko Ukkonen
:
Finding Significant Matches of Position Weight Matrices in Linear Time. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 69-79 (2011) - [c80]Jyrki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann:
Editors' Introduction. ALT 2011: 1-13 - [e4]Jyrki Kivinen
, Csaba Szepesvári, Esko Ukkonen
, Thomas Zeugmann:
Algorithmic Learning Theory - 22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011. Proceedings. Lecture Notes in Computer Science 6925, Springer 2011, ISBN 978-3-642-24411-7 [contents] - 2010
- [j54]Morris Michael, François Nicolas, Esko Ukkonen
:
On the complexity of finding gapped motifs. J. Discrete Algorithms 8(2): 131-142 (2010) - [j53]Esko Ukkonen:
Geometric Point Pattern Matching in the Knuth-Morris-Pratt Way. J. Univers. Comput. Sci. 16(14): 1902-1911 (2010)
2000 – 2009
- 2009
- [j52]Janne H. Korhonen, Petri Martinmäki, Cinzia Pizzi, Pasi Rastas
, Esko Ukkonen
:
MOODS: fast search for position weight matrix matches in DNA sequences. Bioinform. 25(23): 3181-3182 (2009) - [j51]François Nicolas, Veli Mäkinen
, Esko Ukkonen
:
Efficient construction of maximal and minimal representations of motifs of a string. Theor. Comput. Sci. 410(30-32): 2999-3005 (2009) - [j50]Esko Ukkonen
:
Maximal and minimal representations of gapped and non-gapped motifs of a string. Theor. Comput. Sci. 410(43): 4341-4349 (2009) - [c79]Esko Ukkonen:
Motif Construction from High-Throughput SELEX Data. ISBRA 2009: 159 - [e3]Gregory Kucherov, Esko Ukkonen:
Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings. Lecture Notes in Computer Science 5577, Springer 2009, ISBN 978-3-642-02440-5 [contents] - 2008
- [j49]Robert Giegerich, Alvis Brazma
, Inge Jonassen
, Esko Ukkonen
, Martin Vingron:
The BREW workshop series: a stimulating experience in PhD education. Briefings Bioinform. 9(3): 250-253 (2008) - [j48]Ari Rantanen, Juho Rousu, Paula Jouhten
, Nicola Zamboni
, Hannu Maaheimo, Esko Ukkonen
:
An analytic and systematic framework for estimating metabolic flux ratios from 13C tracer experiments. BMC Bioinform. 9 (2008) - [j47]Esa Pitkänen
, Arto Åkerlund, Ari Rantanen, Paula Jouhten
, Esko Ukkonen:
ReMatch: a web-based tool to construct, store and share stoichiometric metabolic models with carbon maps for metabolic flux analysis. J. Integr. Bioinform. 5(2) (2008) - [j46]Cinzia Pizzi, Esko Ukkonen
:
Fast profile matching algorithms - A survey. Theor. Comput. Sci. 395(2-3): 137-157 (2008) - [c78]Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen:
A Computational Method for Reconstructing Gapless Metabolic Networks. BIRD 2008: 288-302 - [r2]Juha Kärkkäinen, Esko Ukkonen:
Multidimensional String Matching. Encyclopedia of Algorithms 2008 - [r1]Veli Mäkinen, Esko Ukkonen:
Point Pattern Matching. Encyclopedia of Algorithms 2008 - 2007
- [j45]Samuel Kaski, Juho Rousu, Esko Ukkonen
:
Probabilistic modeling and machine learning in structural and systems biology. BMC Bioinform. 8(S-2) (2007) - [c77]Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
:
Fast Search Algorithms for Position Specific Scoring Matrices. BIRD 2007: 239-250 - [c76]Esko Ukkonen
:
Structural Analysis of Gapped Motifs of a String. MFCS 2007: 681-690 - [c75]Pasi Rastas, Esko Ukkonen
:
Haplotype Inference Via Hierarchical Genotype Parsing. WABI 2007: 85-97 - 2006
- [j44]Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen
:
Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Bioinform. 22(10): 1198-1206 (2006) - [j43]Taneli Mielikäinen, Esko Ukkonen
:
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization, . Discret. Appl. Math. 154(4): 684-691 (2006) - [j42]Hellis Tamm
, Matti Nykänen, Esko Ukkonen
:
On size reduction techniques for multitape automata. Theor. Comput. Sci. 363(2): 234-246 (2006) - [j41]Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Juho Rousu, Esko Ukkonen:
Equivalence of Metabolite Fragments and Flow Analysis of Isotopomer Distributions for Flux Estimation. Trans. Comp. Sys. Biology 6: 198-220 (2006) - 2005
- [j40]Teemu Kivioja, Mikko Arvas
, Markku Saloheimo, Merja Penttilä
, Esko Ukkonen
:
Optimization of cDNA-AFLP experiments using genomic sequence data. Bioinform. 21(11): 2573-2579 (2005) - [j39]Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen:
Transposition invariant string matching. J. Algorithms 56(2): 124-153 (2005) - [j38]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) - [c74]Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen:
Planning isotopomer measurements for estimation of metabolic fluxes. German Conference on Bioinformatics 2005: 177-191 - [c73]Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen
:
Finding Feasible Pathways in Metabolic Networks. Panhellenic Conference on Informatics 2005: 123-133 - [c72]Pasi Rastas, Mikko Koivisto
, Heikki Mannila, Esko Ukkonen
:
A Hidden Markov Technique for Haplotype Reconstruction. WABI 2005: 140-151 - [c71]Hellis Tamm
, Matti Nykänen, Esko Ukkonen
:
Size Reduction of Multitape Automata. CIAA 2005: 307-318 - 2004
- [j37]Hellis Tamm
, Esko Ukkonen:
Bideterministic automata and minimal representations of regular languages. Theor. Comput. Sci. 328(1-2): 135-149 (2004) - [c70]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 - [c69]Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pasi Rastas, Esko Ukkonen:
Hidden Markov Modelling Techniques for Haplotype Analysis. ALT 2004: 37-52 - [c68]Mikko Koivisto, Pasi Rastas, Esko Ukkonen:
Recombination Systems. Theory Is Forever 2004: 159-169 - [c67]Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen:
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. International Conference on Computational Science 2004: 231-238 - [c66]Hellis Tamm, Matti Nykänen, Esko Ukkonen:
Size Reduction of Multitape Automata. CIAA 2004: 329-330 - [i2]Taneli Mielikäinen, Esko Ukkonen:
The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization. CoRR cs.DS/0405094 (2004) - [i1]Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen:
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy. CoRR cs.DS/0406043 (2004) - 2003
- [j36]Veli Mäkinen
, Esko Ukkonen
, Gonzalo Navarro:
Approximate Matching of Run-Length Compressed Strings. Algorithmica 35(4): 347-369 (2003) - [j35]Gösta Grahne, Raul Hakli
, Matti Nykänen, Hellis Tamm
, Esko Ukkonen:
Design and implementation of a string database query language. Inf. Syst. 28(4): 311-337 (2003) - [j34]Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
Approximate string matching on Ziv-Lempel compressed text. J. Discrete Algorithms 1(3-4): 313-338 (2003) - [c65]Esko Ukkonen, Kjell Lemström
, Veli Mäkinen:
Sweepline the Music! Computer Science in Perspective 2003: 330-342 - [c64]Juho Rousu, Ari Rantanen, Hannu Maaheimo, Esa Pitkänen
, Katja Saarela, Esko Ukkonen
:
A Method for Estimating Metabolic Fluxes from Incomplete Isotopomer Information. CMSB 2003: 88-103 - [c63]Kjell Lemström, Veli Mäkinen, Anna Pienimäki, Mika Turkia, Esko Ukkonen:
The C-BRAHMS project. ISMIR 2003 - [c62]Esko Ukkonen, Kjell Lemström, Veli Mäkinen:
Geometric algorithms for transposition invariant content based music retrieval. ISMIR 2003 - [c61]Mikko Koivisto, Markus Perola, T. Varilo, W. Hennah, J. Ekelund, Margus Lukk, L. Peltonen, Esko Ukkonen, Heikki Mannila:
An MDL Method for Finding Haplotype Blocks and for Estimating the Strength of Haplotype Block Boundaries. Pacific Symposium on Biocomputing 2003: 502-513 - [c60]Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen:
Algorithms for Transposition Invariant String Matching. STACS 2003: 191-202 - [c59]Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen:
Matching Numeric Strings under Noise. Stringology 2003: 99-110 - [c58]Hellis Tamm, Esko Ukkonen:
Bideterministic Automata and Minimal Representations of Regular Languages. CIAA 2003: 61-71 - 2002
- [j33]Amihood Amir, Gad M. Landau, Esko Ukkonen:
Online timestamped text indexing. Inf. Process. Lett. 82(5): 253-259 (2002) - [j32]Matti Nykänen, Esko Ukkonen:
The Exact Path Length Problem. J. Algorithms 42(1): 41-53 (2002) - [c57]Veli Mäkinen, Esko Ukkonen:
Local Similarity Based Point-Pattern Matching. CPM 2002: 115-132 - [c56]Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. CPM 2002: 235-248 - [c55]Kimmo Palin, Esko Ukkonen, Alvis Brazma, Jaak Vilo:
Correlating gene promoters and expression in gene disruption experiments. ECCB 2002: 172-180 - [c54]Teemu Kivioja, Mikko Arvas, Kari Kataja, Merja Penttilä, Hans Söderlund, Esko Ukkonen:
Assigning probes into a small number of pools separable by electrophoresis. ISMB 2002: 199-206 - [c53]Esko Ukkonen:
Finding Founder Sequences from a Set of Recombinants. WABI 2002: 277-286 - 2001
- [c52]Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen:
Approximate Matching of Run-Length Compressed Strings. CPM 2001: 31-49 - [c51]Taneli Mielikäinen, Esko Ukkonen:
The Complexity of Maximum Matroid-Greedoid Intersection. FCT 2001: 535-540 - [c50]Kimmo Fredriksson, Esko Ukkonen:
Faster template matching without FFT. ICIP (1) 2001: 678-681 - 2000
- [c49]Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
Approximate String Matching over Ziv-Lempel Compressed Text. CPM 2000: 195-209 - [c48]Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
An Index for Two Dimensional String Matching Allowing Rotations. IFIP TCS 2000: 59-75 - [c47]Jaak Vilo, Alvis Brazma, Inge Jonassen, Alan J. Robinson, Esko Ukkonen:
Mining for Putative Regulatory Elements in the Yeast Genome Using Gene Expression Data. ISMB 2000: 384-394 - [c46]Kimmo Fredriksson, Esko Ukkonen:
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. SPIRE 2000: 96-104 - [c45]Esko Ukkonen:
Toward Complete Genome Data Mining in Computational Biology. SWAT 2000: 20-21
1990 – 1999
- 1999
- [j31]Gösta Grahne, Matti Nykänen, Esko Ukkonen:
Reasoning about Strings in Databases. J. Comput. Syst. Sci. 59(1): 116-162 (1999) - [j30]Kimmo Fredriksson, Esko Ukkonen:
Combinatorial methods for approximate image matching under translations and rotations. Pattern Recognit. Lett. 20(11-13): 1249-1258 (1999) - [j29]Juha Kärkkäinen, Esko Ukkonen:
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. SIAM J. Comput. 29(2): 571-589 (1999) - [c44]Kai Korpimies, Esko Ukkonen:
Term Frequency-Based Identification of FAQ-Articles. CoLIS 1999 - [c43]Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen:
Implementing a Declarative String Query Language with String Restructuring. PADL 1999: 179-195 - [c42]Matti Nykänen, Esko Ukkonen:
Finding Paths with the Right Cost. STACS 1999: 345-355 - 1998
- [c41]Kai Korpimies, Esko Ukkonen:
Term Weighting in Query-Based Document Clustering (Extended Abstract). ADBIS 1998: 151-153 - [c40]Kimmo Fredriksson, Esko Ukkonen:
A Rotation Invariant Filter for Two-Dimensional String Matching. CPM 1998: 118-125 - [c39]Kai Korpimies, Esko Ukkonen:
Searching for General Documents. FQAS 1998: 203-214 - [c38]Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen:
Predicting gene regulatory elements from their expression data in the complete yeast genome. German Conference on Bioinformatics 1998 - [c37]Alvis Brazma
, Inge Jonassen
, Jaak Vilo, Esko Ukkonen:
Pattern Discovery in Biosequences. ICGI 1998: 257-270 - 1997
- [j28]Enno Ohlebusch, Esko Ukkonen:
On the Equivalence Problem for E-Pattern Languages. Theor. Comput. Sci. 186(1-2): 231-248 (1997) - [c36]Alvis Brazma, Jaak Vilo, Esko Ukkonen:
Finding transcription factor binding site combinations in the yeast genome. German Conference on Bioinformatics 1997: 57-59 - [c35]Markus Huttunen, Esko Ukkonen, Bertel Vehviläinen:
Using Trainable Computing Networks in the Optimization of Lake Regulation. ICONIP (2) 1997: 975-978 - [c34]Alvis Brazma, Jaak Vilo, Esko Ukkonen, Kimmo Valtonen:
Data Mining for Regulatory Elements in Yeast Genome. ISMB 1997: 65-74 - 1996
- [j27]Petteri Jokinen, Jorma Tarhio, Esko Ukkonen:
A Comparison of Approximate String Matching Algorithms. Softw. Pract. Exp. 26(12): 1439-1458 (1996) - [c33]Juha Kärkkäinen, Esko Ukkonen:
Sparse Suffix Trees. COCOON 1996: 219-230 - [c32]Alvis Brazma
, Esko Ukkonen, Jaak Vilo:
Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract). ISAAC 1996: 95-104 - [c31]Alvis Brazma, Inge Jonassen, Esko Ukkonen, Jaak Vilo:
Discovering Patterns and Subfamilies in Biosequences. ISMB 1996: 34-43 - [c30]Enno Ohlebusch, Esko Ukkonen:
On the Equivalence Problem for E-Pattern Languages. MFCS 1996: 457-468 - 1995
- [j26]Esko Ukkonen:
On-Line Construction of Suffix Trees. Algorithmica 14(3): 249-260 (1995) - [j25]Esko Ukkonen:
Editor's Foreword. Nord. J. Comput. 2(1): 1-2 (1995) - [c29]Pekka Kilpeläinen, Heikki Mannila, Esko Ukkonen:
MDL learning of unions of simple pattern languages from positive examples. EuroCOLT 1995: 252-260 - [e2]Zvi Galil, Esko Ukkonen:
Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings. Lecture Notes in Computer Science 937, Springer 1995, ISBN 3-540-60044-2 [contents] - 1994
- [j24]Matti Nykänen, Esko Ukkonen:
Finding Lowest Common Ancestors in Arbitrarily Directed Trees. Inf. Process. Lett. 50(6): 307-310 (1994) - [c28]Tapio Elomaa, Esko Ukkonen:
A Geometric Approach to Feature Selection. ECML 1994: 351-354 - [c27]Jyrki Kivinen, Heikki Mannila, Esko Ukkonen, Jaak Vilo:
An ALgorithm for Learning Hierarchical Classifiers. ECML 1994: 375-378 - [c26]Gösta Grahne, Matti Nykänen, Esko Ukkonen:
Reasoning about Strings in Databases. PODS 1994: 303-312 - [c25]Juha Kärkkäinen, Esko Ukkonen:
Two and Higher Dimensional Pattern Matching in Optimal Expected Time. SODA 1994: 715-723 - 1993
- [j23]Esko Ukkonen, Derick Wood:
Approximate String Matching with Suffix Automata. Algorithmica 10(5): 353-364 (1993) - [j22]Jorma Tarhio
, Esko Ukkonen:
Approximate Boyer-Moore String Matching. SIAM J. Comput. 22(2): 243-260 (1993) - [c24]Esko Ukkonen:
Approximate String-Matching over Suffix Trees. CPM 1993: 228-242 - [c23]Jyrki Kivinen, Heikki Mannila, Esko Ukkonen:
Learning rules with local exceptions. EuroCOLT 1993: 35-46 - 1992
- [j21]Esko Ukkonen:
Approximate String Matching with q-grams and Maximal Matches. Theor. Comput. Sci. 92(1): 191-211 (1992) - [c22]Jyrki Kivinen, Heikki Mannila, Esko Ukkonen:
Learning Hierarchical Rule Sets. COLT 1992: 37-44 - [c21]Esko Ukkonen:
Constructing Suffix Trees On-Line in Linear Time. IFIP Congress (1) 1992: 484-492 - [e1]Otto Nurmi, Esko Ukkonen:
Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings. Lecture Notes in Computer Science 621, Springer 1992, ISBN 3-540-55706-7 [contents] - 1991
- [c20]Petteri Jokinen, Esko Ukkonen:
Two Algorithms for Approximate String Matching in Static Texts. MFCS 1991: 240-248 - 1990
- [j20]Esko Ukkonen:
A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. Algorithmica 5(3): 313-323 (1990) - [j19]Heikki Mannila, Esko Ukkonen:
Unifications, Deunifications, and Their Complexity. BIT 30(4): 599-619 (1990) - [c19]Jorma Tarhio
, Esko Ukkonen:
Boyer-Moore Approach to Approximate String Matching (Extended Abstract). SWAT 1990: 348-359
1980 – 1989
- 1988
- [j18]