About this event

Abstract: 

Pattern matching is a fundamental problem in theoretical computer science. Apart from its theoretical interest, it has many applications in other areas where textual data representations are used, such as computational biology, information retrieval, text mining, and pattern recognition. It has been well studied in the past decades and it is well understood. The same problem for uncertain texts has been much less explored. These representations are becoming very common in a wide range of applications where data measurements with imprecise sensor measurements are considered or when flexible sequence modelling is required. In this talk, we will visit some recent results on this topic.