The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Esko Ukkonen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gösta Grahne, Matti Nykänen, Esko Ukkonen
    Reasoning about Strings in Databases. [Citation Graph (8, 8)][DBLP]
    PODS, 1994, pp:303-312 [Conf]
  2. Heikki Mannila, Esko Ukkonen
    Flow Analysis of Prolog Programs. [Citation Graph (2, 0)][DBLP]
    SLP, 1987, pp:205-214 [Conf]
  3. Esko Ukkonen
    On-Line Construction of Suffix Trees. [Citation Graph (2, 0)][DBLP]
    Algorithmica, 1995, v:14, n:3, pp:249-260 [Journal]
  4. Esko Ukkonen
    Finding Approximate Patterns in Strings. [Citation Graph (2, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:132-137 [Journal]
  5. Esko Ukkonen
    Approximate String Matching with q-grams and Maximal Matches. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:191-211 [Journal]
  6. Kai Korpimies, Esko Ukkonen
    Searching for General Documents. [Citation Graph (1, 0)][DBLP]
    FQAS, 1998, pp:203-214 [Conf]
  7. Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen
    Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps. [Citation Graph (0, 0)][DBLP]
    3DPVT, 2004, pp:979-986 [Conf]
  8. Kai Korpimies, Esko Ukkonen
    Term Weighting in Query-Based Document Clustering (Extended Abstract). [Citation Graph (0, 3)][DBLP]
    ADBIS, 1998, pp:151-153 [Conf]
  9. Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pasi Rastas, Esko Ukkonen
    Hidden Markov Modelling Techniques for Haplotype Analysis. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:37-52 [Conf]
  10. Mikko Koivisto, Pasi Rastas, Esko Ukkonen
    Recombination Systems. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:159-169 [Conf]
  11. Esko Ukkonen, Kjell Lemström, Veli Mäkinen
    Sweepline the Music! [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:330-342 [Conf]
  12. Juho Rousu, Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Katja Saarela, Esko Ukkonen
    A Method for Estimating Metabolic Fluxes from Incomplete Isotopomer Information. [Citation Graph (0, 0)][DBLP]
    CMSB, 2003, pp:88-103 [Conf]
  13. Juha Kärkkäinen, Esko Ukkonen
    Sparse Suffix Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:219-230 [Conf]
  14. Kai Korpimies, Esko Ukkonen
    Term Frequency-Based Identification of FAQ-Articles. [Citation Graph (0, 0)][DBLP]
    CoLIS, 1999, pp:- [Conf]
  15. Jyrki Kivinen, Heikki Mannila, Esko Ukkonen
    Learning Hierarchical Rule Sets. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:37-44 [Conf]
  16. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
    Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:235-248 [Conf]
  17. Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
    Approximate String Matching over Ziv-Lempel Compressed Text. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:195-209 [Conf]
  18. Kimmo Fredriksson, Esko Ukkonen
    A Rotation Invariant Filter for Two-Dimensional String Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1998, pp:118-125 [Conf]
  19. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
    Approximate Matching of Run-Length Compressed Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:31-49 [Conf]
  20. Veli Mäkinen, Esko Ukkonen
    Local Similarity Based Point-Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:115-132 [Conf]
  21. Esko Ukkonen
    Approximate String-Matching over Suffix Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:228-242 [Conf]
  22. Kimmo Palin, Esko Ukkonen, Alvis Brazma, Jaak Vilo
    Correlating gene promoters and expression in gene disruption experiments. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:172-180 [Conf]
  23. Tapio Elomaa, Esko Ukkonen
    A Geometric Approach to Feature Selection. [Citation Graph (0, 0)][DBLP]
    ECML, 1994, pp:351-354 [Conf]
  24. Jyrki Kivinen, Heikki Mannila, Esko Ukkonen, Jaak Vilo
    An ALgorithm for Learning Hierarchical Classifiers. [Citation Graph (0, 0)][DBLP]
    ECML, 1994, pp:375-378 [Conf]
  25. Pekka Kilpeläinen, Heikki Mannila, Esko Ukkonen
    MDL learning of unions of simple pattern languages from positive examples. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:252-260 [Conf]
  26. Taneli Mielikäinen, Esko Ukkonen
    The Complexity of Maximum Matroid-Greedoid Intersection. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:535-540 [Conf]
  27. Esko Ukkonen
    On Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:487-495 [Conf]
  28. Pentti Vataja, Esko Ukkonen
    Finding Temporary Terms in Prolog Programs. [Citation Graph (0, 0)][DBLP]
    FGCS, 1984, pp:275-282 [Conf]
  29. Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen
    Predicting gene regulatory elements from their expression data in the complete yeast genome. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1998, pp:- [Conf]
  30. Alvis Brazma, Jaak Vilo, Esko Ukkonen
    Finding transcription factor binding site combinations in the yeast genome. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1997, pp:57-59 [Conf]
  31. Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen
    Planning isotopomer measurements for estimation of metabolic fluxes. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 2005, pp:177-191 [Conf]
  32. Heikki Mannila, Esko Ukkonen
    The Set Union Problem with Backtracking. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:236-243 [Conf]
  33. Kari-Jouko Räihä, Esko Ukkonen
    On the Optimal Assignment of Attributes to Passes in Multi-Pass Attribute Evaluators. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:500-511 [Conf]
  34. Eljas Soisalon-Soininen, Esko Ukkonen
    A Characterization of LL(k) Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:20-30 [Conf]
  35. Esko Ukkonen
    On Size Bounds for Deterministic Parsers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:218-228 [Conf]
  36. Esko Ukkonen
    A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:646-658 [Conf]
  37. Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
    The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science, 2004, pp:231-238 [Conf]
  38. Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen
    Pattern Discovery in Biosequences. [Citation Graph (0, 0)][DBLP]
    ICGI, 1998, pp:257-270 [Conf]
  39. Kimmo Fredriksson, Esko Ukkonen
    Faster template matching without FFT. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 2001, pp:678-681 [Conf]
  40. Heikki Mannila, Esko Ukkonen
    On the Complexity of Unification Sequences. [Citation Graph (0, 0)][DBLP]
    ICLP, 1986, pp:122-133 [Conf]
  41. Hannu Peltola, Hans Söderlund, Jorma Tarhio, Esko Ukkonen
    Algorithms for Some String Matching Problems Arising in Molecular Genetics. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:59-64 [Conf]
  42. Kari-Jouko Räihä, Esko Ukkonen
    Balancing Syntactic and Semantic Power in Compiler Specification. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1980, pp:65-70 [Conf]
  43. Esko Ukkonen
    Constructing Suffix Trees On-Line in Linear Time. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:484-492 [Conf]
  44. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
    An Index for Two Dimensional String Matching Allowing Rotations. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:59-75 [Conf]
  45. Alvis Brazma, Esko Ukkonen, Jaak Vilo
    Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:95-104 [Conf]
  46. Alvis Brazma, Inge Jonassen, Esko Ukkonen, Jaak Vilo
    Discovering Patterns and Subfamilies in Biosequences. [Citation Graph (0, 0)][DBLP]
    ISMB, 1996, pp:34-43 [Conf]
  47. Alvis Brazma, Jaak Vilo, Esko Ukkonen, Kimmo Valtonen
    Data Mining for Regulatory Elements in Yeast Genome. [Citation Graph (0, 0)][DBLP]
    ISMB, 1997, pp:65-74 [Conf]
  48. Teemu Kivioja, Mikko Arvas, Kari Kataja, Merja Penttilä, Hans Söderlund, Esko Ukkonen
    Assigning probes into a small number of pools separable by electrophoresis. [Citation Graph (0, 0)][DBLP]
    ISMB, 2002, pp:199-206 [Conf]
  49. Jaak Vilo, Alvis Brazma, Inge Jonassen, Alan J. Robinson, Esko Ukkonen
    Mining for Putative Regulatory Elements in the Yeast Genome Using Gene Expression Data. [Citation Graph (0, 0)][DBLP]
    ISMB, 2000, pp:384-394 [Conf]
  50. Kjell Lemström, Veli Mäkinen, Anna Pienimäki, M. Turkia, Esko Ukkonen
    The C-BRAHMS project. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2003, pp:- [Conf]
  51. Esko Ukkonen, Kjell Lemström, Veli Mäkinen
    Geometric algorithms for transposition invariant content based music retrieval. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2003, pp:- [Conf]
  52. Petteri Jokinen, Esko Ukkonen
    Two Algorithms for Approximate String Matching in Static Texts. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:240-248 [Conf]
  53. Enno Ohlebusch, Esko Ukkonen
    On the Equivalence Problem for E-Pattern Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:457-468 [Conf]
  54. Jorma Tarhio, Esko Ukkonen
    A Greedy Algorithm for Constructing Shortest Common Substrings. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:602-610 [Conf]
  55. Esko Ukkonen
    Tranformations to Produce Certain Covering Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1978, pp:516-525 [Conf]
  56. Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen
    Implementing a Declarative String Query Language with String Restructuring. [Citation Graph (0, 0)][DBLP]
    PADL, 1999, pp:179-195 [Conf]
  57. Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen
    Finding Feasible Pathways in Metabolic Networks. [Citation Graph (0, 0)][DBLP]
    Panhellenic Conference on Informatics, 2005, pp:123-133 [Conf]
  58. Mikko Koivisto, Markus Perola, T. Varilo, W. Hennah, J. Ekelund, M. Lukk, L. Peltonen, Esko Ukkonen, Heikki Mannila
    An MDL Method for Finding Haplotype Blocks and for Estimating the Strength of Haplotype Block Boundaries. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2003, pp:502-513 [Conf]
  59. Heikki Mannila, Esko Ukkonen
    Timestamped Term Representation for Implementing Prolog. [Citation Graph (0, 0)][DBLP]
    SLP, 1986, pp:159-165 [Conf]
  60. Juha Kärkkäinen, Esko Ukkonen
    Two and Higher Dimensional Pattern Matching in Optimal Expected Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:715-723 [Conf]
  61. Kimmo Fredriksson, Esko Ukkonen
    Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:96-104 [Conf]
  62. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
    Algorithms for Transposition Invariant String Matching. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:191-202 [Conf]
  63. Matti Nykänen, Esko Ukkonen
    Finding Paths with the Right Cost. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:345-355 [Conf]
  64. Esko Ukkonen
    A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:29-38 [Conf]
  65. Esko Ukkonen, Eljas Soisalon-Soininen
    LALR(k) Testing is PSPACE-Complete [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:202-206 [Conf]
  66. Heikki Mannila, Esko Ukkonen
    Time Parameter and Arbitrary Deunions in the Set Union Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:34-42 [Conf]
  67. Jorma Tarhio, Esko Ukkonen
    Boyer-Moore Approach to Approximate String Matching (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:348-359 [Conf]
  68. Esko Ukkonen
    Toward Complete Genome Data Mining in Computational Biology. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:20-21 [Conf]
  69. Esko Ukkonen
    Remarks on the Nonexistence of some Covering Grammars. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:298-309 [Conf]
  70. Pasi Rastas, Mikko Koivisto, Heikki Mannila, Esko Ukkonen
    A Hidden Markov Technique for Haplotype Reconstruction. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:140-151 [Conf]
  71. Esko Ukkonen
    Finding Founder Sequences from a Set of Recombinants. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:277-286 [Conf]
  72. Hellis Tamm, Matti Nykänen, Esko Ukkonen
    Size Reduction of Multitape Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:329-330 [Conf]
  73. Hellis Tamm, Matti Nykänen, Esko Ukkonen
    Size Reduction of Multitape Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:307-318 [Conf]
  74. Hellis Tamm, Esko Ukkonen
    Bideterministic Automata and Minimal Representations of Regular Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:61-71 [Conf]
  75. Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
    Fast Search Algorithms for Position Specific Scoring Matrices. [Citation Graph (0, 0)][DBLP]
    BIRD, 2007, pp:239-250 [Conf]
  76. Eljas Soisalon-Soininen, Esko Ukkonen
    A Method for Transforming Grammars into LL(k) Form. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1979, v:12, n:, pp:339-369 [Journal]
  77. Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro
    Approximate Matching of Run-Length Compressed Strings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:4, pp:347-369 [Journal]
  78. Esko Ukkonen
    A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:3, pp:313-323 [Journal]
  79. Esko Ukkonen, Derick Wood
    Approximate String Matching with Suffix Automata. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:5, pp:353-364 [Journal]
  80. Teemu Kivioja, Mikko Arvas, Markku Saloheimo, Merja Penttilä, Esko Ukkonen
    Optimization of cDNA-AFLP experiments using genomic sequence data. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2005, v:21, n:11, pp:2573-2579 [Journal]
  81. Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen
    Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:10, pp:1198-1206 [Journal]
  82. Heikki Mannila, Esko Ukkonen
    Unifications, Deunifications, and Their Complexity. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:4, pp:599-619 [Journal]
  83. Esko Ukkonen
    Exponential Lower Bounds for Some NP-Complete Problems in a Restricted Linear Decision Tree Model. [Citation Graph (0, 0)][DBLP]
    BIT, 1983, v:23, n:2, pp:181-192 [Journal]
  84. Taneli Mielikäinen, Esko Ukkonen
    The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  85. Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
    The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  86. Taneli Mielikäinen, Esko Ukkonen
    The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization, . [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:4, pp:684-691 [Journal]
  87. Esko Ukkonen
    Algorithms for Approximate String Matching [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:64, n:1-3, pp:100-118 [Journal]
  88. Amihood Amir, Gad M. Landau, Esko Ukkonen
    Online timestamped text indexing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:5, pp:253-259 [Journal]
  89. Heikki Mannila, Esko Ukkonen
    A Simple Linear-Time Algorithm for in Situ Merging. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:4, pp:203-208 [Journal]
  90. Matti Nykänen, Esko Ukkonen
    Finding Lowest Common Ancestors in Arbitrarily Directed Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:6, pp:307-310 [Journal]
  91. Esko Ukkonen
    The Nonexistence of Some Covering Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:187-192 [Journal]
  92. Esko Ukkonen
    Upper Bounds on the Size of LR(k) Parsers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:2, pp:99-103 [Journal]
  93. Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen
    Design and implementation of a string database query language. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 2003, v:28, n:4, pp:311-337 [Journal]
  94. Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen
    The Complexity of LALR(k) Testing [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:2, pp:259-270 [Journal]
  95. Esko Ukkonen
    The equivalence problem for some non-real-time deterministic pushdown automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:4, pp:1166-1181 [Journal]
  96. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
    Transposition invariant string matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:2, pp:124-153 [Journal]
  97. Matti Nykänen, Esko Ukkonen
    The Exact Path Length Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:41-53 [Journal]
  98. Gösta Grahne, Matti Nykänen, Esko Ukkonen
    Reasoning about Strings in Databases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:1, pp:116-162 [Journal]
  99. Esko Ukkonen
    Lower Bounds on the Size of Deterministic Parsers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:2, pp:153-170 [Journal]
  100. Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
    Approximate string matching on Ziv-Lempel compressed text. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:313-338 [Journal]
  101. Hannu Peltola, Hans Söderlund, Esko Ukkonen
    SEQAID: a DNA sequence assembling program based on a mathematical model. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 1984, v:12, n:1, pp:307-321 [Journal]
  102. Hannu Peltola, Hans Söderlund, Esko Ukkonen
    Algorithms for the search of amino acid patterns in nucleic acid sequences. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 1986, v:14, n:1, pp:99-107 [Journal]
  103. Esko Ukkonen
    Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:1, pp:1-2 [Journal]
  104. Kimmo Fredriksson, Esko Ukkonen
    Combinatorial methods for approximate image matching under translations and rotations. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1999, v:20, n:11-13, pp:1249-1258 [Journal]
  105. Juha Kärkkäinen, Esko Ukkonen
    Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:571-589 [Journal]
  106. Kari-Jouko Räihä, Esko Ukkonen
    Minimizing the Number of Evaluation Passes for Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:772-786 [Journal]
  107. Jorma Tarhio, Esko Ukkonen
    Approximate Boyer-Moore String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:243-260 [Journal]
  108. Esko Ukkonen
    Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:580-587 [Journal]
  109. Petteri Jokinen, Jorma Tarhio, Esko Ukkonen
    A Comparison of Approximate String Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1996, v:26, n:12, pp:1439-1458 [Journal]
  110. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
    Sequential and indexed two-dimensional combinatorial template matching allowing rotations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:239-275 [Journal]
  111. Enno Ohlebusch, Esko Ukkonen
    On the Equivalence Problem for E-Pattern Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:186, n:1-2, pp:231-248 [Journal]
  112. Kari-Jouko Räihä, Esko Ukkonen
    The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:187-198 [Journal]
  113. Hellis Tamm, Matti Nykänen, Esko Ukkonen
    On size reduction techniques for multitape automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:234-246 [Journal]
  114. Hellis Tamm, Esko Ukkonen
    Bideterministic automata and minimal representations of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:328, n:1-2, pp:135-149 [Journal]
  115. Jorma Tarhio, Esko Ukkonen
    A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:57, n:, pp:131-145 [Journal]
  116. Esko Ukkonen
    Structure Preserving Elimination of Null Productions from Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:43-54 [Journal]
  117. Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Juho Rousu, Esko Ukkonen
    Equivalence of Metabolite Fragments and Flow Analysis of Isotopomer Distributions for Flux Estimation. [Citation Graph (0, 0)][DBLP]
    , 2006, v:, n:, pp:198-220 [Journal]
  118. Esko Ukkonen
    Structural Analysis of Gapped Motifs of a String. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:681-690 [Conf]
  119. Pasi Rastas, Esko Ukkonen
    Haplotype Inference Via Hierarchical Genotype Parsing. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:85-97 [Conf]

  120. A Computational Method for Reconstructing Gapless Metabolic Networks. [Citation Graph (, )][DBLP]


  121. Motif Construction from High-Throughput SELEX Data. [Citation Graph (, )][DBLP]


  122. The BREW workshop series: a stimulating experience in PhD education. [Citation Graph (, )][DBLP]


  123. MOODS: fast search for position weight matrix matches in DNA sequences. [Citation Graph (, )][DBLP]


  124. An analytic and systematic framework for estimating metabolic flux ratios from 13C tracer experiments. [Citation Graph (, )][DBLP]


  125. Probabilistic modeling and machine learning in structural and systems biology. [Citation Graph (, )][DBLP]


  126. On the complexity of finding gapped motifs [Citation Graph (, )][DBLP]


Search in 0.084secs, Finished in 0.091secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002