For many years Esko Ukkonen has played a major role in the advancement of computer science in Finland. He was the key person in the development of the school of algorithmic research and has contributed considerably to post-graduate education in his country. Esko Ukkonen has over the years worked within many areas of computer science, including numerical methods, complexity theory, theoretical aspects of compiler construction, and logic programming. However, the main focus of his research has been on algorithms and their applications. This Festschrift volume, published to honor Esko Ukkonen on his 60th birthday, includes 18 refereed contributions by his former PhD students and colleagues, with whom he has cooperated closely during the course of his career. The Festschrift was presented to Esko during a festive symposium organized at the University of Helsinki to celebrate his birthday. The essays primarily present research on computational pattern matching and string algorithms, two areas that have benefited significantly from the work of Esko Ukonen.
Author(s): Amihood Amir, Avivit Levy (auth.), Tapio Elomaa, Heikki Mannila, Pekka Orponen (eds.)
Series: Lecture Notes in Computer Science 6060 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 261
Tags: Pattern Recognition; Artificial Intelligence (incl. Robotics); Algorithm Analysis and Problem Complexity; Information Systems Applications (incl.Internet); Data Mining and Knowledge Discovery; User Interfaces and Human Computer Interacti
Front Matter....Pages -
String Rearrangement Metrics: A Survey....Pages 1-33
Maximal Words in Sequence Comparisons Based on Subword Composition....Pages 34-44
Fast Intersection Algorithms for Sorted Sequences....Pages 45-61
Indexing and Searching a Mass Spectrometry Database....Pages 62-76
Extended Compact Web Graph Representations....Pages 77-91
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k -mismatches....Pages 92-101
Covering Analysis of the Greedy Algorithm for Partial Cover....Pages 102-113
From Nondeterministic Suffix Automaton to Lazy Suffix Tree....Pages 114-129
Clustering the Normalized Compression Distance for Influenza Virus Data....Pages 130-146
An Evolutionary Model of DNA Substring Distribution....Pages 147-157
Indexing a Dictionary for Subset Matching Queries....Pages 158-169
Transposition and Time-Scale Invariant Geometric Music Retrieval....Pages 170-181
Unified View of Backward Backtracking in Short Read Mapping....Pages 182-195
Some Applications of String Algorithms in Human-Computer Interaction....Pages 196-209
Approximate String Matching with Reduced Alphabet....Pages 210-220
ICT4D: A Computer Science Perspective....Pages 221-231
Searching for Linear Dependencies between Heart Magnetic Resonance Images and Lipid Profiles....Pages 232-243
The Support Vector Tree....Pages 244-259
Back Matter....Pages -
