.

Research interest

  • Text and strings processing algorithms
  • Simulation of nondeterministic finite automata
  • Exact and approximate pattern matching
  • Multiple string matching
  • Data compression
  • Pattern matching on compressed texts
  • Combinatorial algorithms on graphs
  • Privacy preserving text processing

Talks given

[30]

Speeding Up String Matching by Weak Factor Recognition
Prague Stringology Conference 2017

Prague, Czech Republic, Given on August 28–30, 2017

[29]

Verifiable Pattern Matching on Outsourced Texts
London Stringology Days (LSD) & London Algorithmic Workshop (LAW) 2017

King's College, London, UK, Given on February 2017

[28]

A Very Fast String Matching Algorithm Based on Condensed Alphabets
Eleventh International Conference on Algorithmic Aspects in Information and Management (AAIM 2016)

Bergamo, Italy, Given on July 18-20 2016

[27]

Efficient Algorithms for the Order Preserving Pattern Matching Problem
Eleventh International Conference on Algorithmic Aspects in Information and Management (AAIM 2016)

Bergamo, Italy, Given on July 18-20 2016

[26]

Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences
3rd International Conference on Algorithms for Computational Biology (AlCoB 2016)

Trujillo, Spain, Given on June 21-22, 2016

[25]

Prior Polarity Lexical Resources for the Italian Language
12th International Workshop on Natural Language Processing and Cognitive Science (NLPCS 2015)

Krakow, Poland, Given on September 22-24, 2015

[24]

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem
Prague Stringology Conference 2015

Prague, Czech Republic, Given on 24-26 August 2015

[23]

Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata
Prague Stringology Conference 2014

Prague, Czech Republic, Given on 4-6 September 2014

[22]

Automatic Extraction of Semantic Relations by Using Web Statistical Information
21st International Conferences on Conceptual Structures (ICCS 2014)

Iasi, Romania, Given on 27 - 30 July 2014

[21]

Swap Matching in Strings by Simulating Reactive Automata
Prague Stringology Conference 2013

Prague, Czech Republic, Given on 2-4 September 2013

[20]

Fast Searching in Biological Sequences Using Multiple Hash Functions
IEEE 12th International Conference on BioInformatics and BioEngineering (BIBE'12)

Larnaca, Ciprus, Given on 11-13 November 2013

[19]

A Fast Suffix Automata Based Algorithm for Exact Online String Matching
17th International Conference on Implementation and Application of Automata (CIAA'12)

Porto, Portugal, Given on 17-20 July 2012

[18]

Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions
22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)

Palermo, Italy, Given on 27-29 June 2011

[17]

Compact Representations of Nondeterministic Automata for the Bit-Parallel Approach
London Stringology Days (LSD) & London Algorithmic Workshop (LAW) 2011

King's College, London, UK, Given on February 2011

[16]

Approximate String Matching Allowing for Inversions and Translocations
the Prague Stringology Conference 2010

Prague, Czech Republic, Given on Septempber 2010

[15]

A Space-Efficient Implementation of the Good-Suffix Heuristic
the Prague Stringology Conference 2010

Prague, Czech Republic, Given on September 2010

[14]

Bit-(Parallelism)^2: Getting to the Next Level of Parallelism
Fifth International Conference on Fun With Algorithms

Ischia, Italy, Given on June 2010

[13]

On the Bit-Parallel Simulation of the Nondeterministic Aho-Corasick Trie
London Stringology Days (LSD) & London Algorithmic Workshop (LAW) 2010

Ischia, Italy, Given on February 2010

[12]

Pattern Matching with Swaps for Short Patterns in Linear Time
35th International Conference on Current Trends in Theory and Practice of Computer Science

Spindleruv Mlyn, Czech Republic, Given on January 2009

[11]

A New Algorithm for Efficient Pattern Matching with Swaps
20th International Workshop on Combinatorial Algorithms

Hradec nad Moravicí, Czech Republic, Given on June 2009

[10]

Efficient Variants of the Backward-Oracle-Matching Algorithm
the 13th Prague Stringology Conference 2008

Prague, Czech Republic, Given on September 2008

[9]

New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps
the 13th Prague Stringology Conference 2008

Prague, Czech Republic, Given on September 2008

[8]

A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem
University of Rouen

Rouen, France, Given on September 2007

[7]

A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem
the Prague Stringology Conference 2005

Prague, Czech Republic, Given on September 2005

[6]

Searching for a substring with constant extra space complexity
Third International Conference on FUN with Algorithms

Elba Island, Itlay, Given on May 2004

[5]

Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm
Cologne-Twente Workshop on Graphs and Combinatorial Optimization

Milano, Itlay, Given on May 2004

[4]

Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences
the Prague Stringology Conference 2004

Prague, Czech Republic, Given on September, 2004

[3]

Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm
Second International Workshop on Experimental Algorithms

Ascona, Switzerland, Given on May 2003

[2]

Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm
the Prague Stringology Conference 2003

Prague, Czech Republic, Given on September 2003

[1]

On the Frequency of Characters in Natural Language Texts
II AMAST Workshop On Language Processing

Verona, Italy, Given on August 2003