2nd Workshop on Compression, Text, and Algorithms 2007

November 9, 2007

Nov 1, Auditorium DCC (Blanco Encalada 2120, 3rd floor, crossing the street from SPIRE/LAWEB venue). Organization: Gonzalo Navarro, Center for Web Research, DCC, Univ. Chile

Preliminary Program

Session 1: Pattern Matching

  • 9:00- 9:45 Keynote speech, Amihood Amir (Bar-Ilan Univ., Israel) Asynchronous Pattern Matching – Address Errors
  • 9:45-10:15 Mohamed Abouelhoda (Univ. Ulm, Germany) Chaining Algorithms Simplified
  • 10:15-10:45 Leena Salmela (Helsinki Univ. Tech., Finland, PhD student of Jorma Tarhio) Multi-Pattern String Matching with Very Large Pattern Sets
  • 10:45-11:00 *** coffee & cookie break

Session 2: Memory-Hierarchy-Friendly Data Structures

  • 11:00-11:30 Diego Arroyuelo (Univ. Chile, PhD student of Gonzalo) An Improved Succinct Dynamic k-Ary Tree Representation
  • 11:30-12:00 Joaquin Adiego (Univ. Valladolid, Spain) XPath Queries on Compressed XML
  • 12:00-12:30 Francisco Claude (Univ. Chile, MSc student of Gonzalo) Extended-Functionality Compressed Web Graphs
  • 12:30-13:00 Rodrigo Paredes (Univ. Chile, PhD student of Gonzalo) Quickheaps
  • 13:00-15:00 *** lunch

Session 3: Complex Text Searching

  • 15:00-15:30 Johannes Fischer (Munich Univ., Germany) An RMQ-based Variant of Compressed Suffix Trees
  • 15:30-16:00 Luis Russo (Tech. Univ. Lisbon, Portugal) Fully Compressed Suffix Trees
  • 16:00-16:30 Veli Makinen (Univ. Helsinki, Finland) Space-Efficient Text Mining
  • 16:30-16:45 *** coffee & cookie break

Session 4: Compressing Sequences

  • 16:45-17:15 Rodrigo González (Univ. Chile, PhD student of Gonzalo) Improved Dynamic Compressed Sequences
  • 17:15-17:45 Antonio Fariña (Univ. Coruña, Spain) A Compressed Self-Index on Words
  • 17:45-18:30 Gonzalo Navarro (Univ. Chile) Re-Pair Re-Visited