BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:3c60c253-2a2e-41f8-bf25-827a4abb24b6
X-WR-CALNAME:Séminaire BKB - Adrian Miclaus (Université de Bucarest)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20250330T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:3c60c253-2a2e-41f8-bf25-827a4abb24b6
DTSTAMP:20260412T162257Z
CLASS:PUBLIC
DESCRIPTION:Adrian Miclaus (Université de Bucarest)\n\nTitle: Faster algori
 thms for computing the hairpin completion distance and minimum ancestor\n
 \nAbstract:&nbsp\;In this paper we study two problems related to the hairp
 in completion.\nThe first problem asks the minimum number of hairpin opera
 tions necessary to transform one string into another\, number that is call
 ed the hairpin completion distance.\nFor this problem we show an algorithm
  of running time O(n^2)\, where n is the maximum length of the two strings
 .\nOur algorithm improves on the algorithm of Manea (TCS 2010)\, that has 
 running time O(n^2 log n).\nIn the minimum distance common hairpin complet
 ion ancestor problem we want to find\, for two input strings x and y\, a s
 tring w that minimizes the sum of the hairpin completion distances to x an
 d y. Similarly\, we present an algorithm with running time O(n^2) that imp
 roves by a O(log n) factor the algorithm of Manea (TCS 2010).
DTSTART;TZID=Europe/Paris:20230525T110000
DTEND;TZID=Europe/Paris:20230525T120000
LOCATION:salle 178\, LaBRI
SEQUENCE:0
SUMMARY:Séminaire BKB - Adrian Miclaus (Université de Bucarest)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
