SPIRE 2017 is the 24th edition of the annual Symposium on String Processing and Information Retrieval. SPIRE has its origins in the South American Workshop on String Processing, which was first held in Belo Horizonte, Brazil, in 1993. Since 1998 the focus of the workshop has also included information retrieval, due to its increasing relevance to and inter-relationship with string processing.
SPIRE 2017 will be held in Palermo, Italy.
As in past editions, the proceedings of SPIRE 2017 will be published by Springer in the Lecture Notes in Computer Science (LNCS) series.
Free access to the conference proceedings from here.
A Best Paper Award, sponsored by Springer, will be given to the author(s) of the most outstanding work included in the proceedings of SPIRE 2017 and presented at the event.
The main conference will be 26th September to 28th September 2017. The Workshop on Compression, Text and Algorithms (WCTA) will be held on September 29th. The venue will be the same of SPIRE.
SPIRE 2017 covers research in all aspects of string processing, information retrieval, computational biology, and related applications. Typical topics of interest include (but are not limited to):
Palermo is a city of Southern Italy. The city is noted for its history, culture, architecture and gastronomy. Palermo is located in the northwest of the island of Sicily, right by the Gulf of Palermo in the Mediterranean sea.
Central Palermo is well connected and has many transport options; there is a fast and frequent bus connection to the airport. Weather in Palermo at the end of September is generally warm and sunny, with an average daytime temperature around 25°C.
The hotel is located just near the Quattro Canti square (at the crossing of the main streets of Palermo historical center: via Maqueda and via Vittorio Emanuele). The square is at the core of the UNESCO’s World Heritage "Arab-Norman Palermo and the Cathedral Churches of Cefalù and Monreale".
The easiest way to reach Palermo is by flight. The international airport Falcone-Borsellino (Palermo, Punta Raisi) is 30 Km away from the town and is connected to Palermo by the motorway A29. The airport website indicates flight schedules and connections.
For the airport-city connections, there are two main options:
Sapienza Università di Roma
Flavio Chierichetti is an associate professor in the Computer Science department at Sapienza Università di Roma. His interests intersect algorithmics, data mining and data modeling. Flavio obtained his PhD in Computer Science from Sapienza University; after his PhD, he held a post-doctoral position at Cornell University. Outside academia, Flavio spent various semesters as a visiting researcher at Google Mountain View. Flavio received an ERC Starting Grant, a Google Focused Research Award, and a SIR grant. He is also the recipient of the 2014 Best Young Researcher in Theoretical Computer Science award of the Italian Chapter of EATCS, and co-recipient of the 2015 KDD Best Paper Award.
Bar Ilan University
Moshe Lewenstein is a professor in the Computer Science department at Bar-Ilan University, where he conducts research on algorithms with a special emphasis on data structures, texts and hardness in P. He received his Ph.D. from Bar-Ilan University in 2000 and spent the year 2000 in New York University as a visiting assistant professor. During the years of 2001 and 2002 he was with IBM Research in Yorktown Heights, NY in the department of Mathematical Sciences as the recipient of the prestigious Herman Goldstine postdoctoral fellowship. In late 2002 he joined the faculty of the Computer Science department in Bar Ilan University, where he is a full Professor since 2012. From 2007-2010 he served as the department chair. During the year 2012-2013 he was a visiting professor in the Computer Science department of the University of Waterloo, Canada. Since 2015 he is dean of Exact Sciences in Bar Ilan University. He has graduated numerous Ph.D. and M.Sc. students, co-authored over 70 papers, edited several books, serves as an editor of JDA and served on numerous PC committees, co-chairing CPM 2016, SPIRE 2013 and CPM 2006.
CNRS & Université Paris-Est Marne-la-Vallée
Stéphane Vialette is a CNRS senior researcher in the Gaspard-Monge Computer Science lab (LIGM UMR 8049) at Paris-Est Marne-la-Vallée University, where he conducts research on algorithms. He received his Ph.D. under the supervision of Christian Choffrut from Paris 7 University in 2001. During the years of 2002 and 2003, he was a postdoc researcher in the Biology department at Ecole Normale Supérieure. From late 2003 to 2007, he was an assistant professor in the Computer Science lab (LRI UMR 8623) at Paris-Sud University. In late 2007, he joined the Gaspard-Monge Computer Science lab (LIGM UMR 8049) in Paris-Est Marne-la-Vallée University as a CNRS researcher and he took the head of the algorithmic team (MoA) in 2011. Since 2015 he is a scientific project manager at INS2I CNRS (Institut des Sciences de l'Information et de leurs Interactions). He has graduated 4 Ph.D., co-authored over 45 journal papers and 1 book, and served on numerous PC committees.
|Monday, 25 September 2017|
|19:00-21:00||Welcome cocktail at Eurostars Centrale Palace.|
|Tuesday, 26 September 2017|
|9:00-9:30||Opening and WelcomeFabrizio Micari, Rector of the University of Palermo and Ricardo Baeza-Yates, CTO of NTENT|
|Invited talk 1||Chair: Gabriele Fici|
|9:30-10:30||Invited talkMoshe Lewenstein Conditional Lower Bounds for String Problems|
|Session 1||Chair: TBA|
|11:00-11:25||Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis and Jakub RadoszewskiLongest common factor after one edit operation|
|11:25-11:50||Giulia Bernardini, Nadia Pisanti, Solon P. Pissis and Giovanna RosonePattern Matching on Elastic-Degenerate Text with Errors|
|11:50-12:15||Lavinia Egidi and Giovanni ManziniLightweight BWT and LCP Merging via the Gap algorithm|
|12:15-12:30||Tenma Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki TakedaOrder preserving pattern matching on trees and DAGs(Short paper)|
|Session 2||Chair: TBA|
|14:30-14:55||Johannes Fischer and Dominik KöpplPractical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries|
|14:55-15:20||Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov and Simon PuglisiOn Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation|
|15:20-15:45||Diego Arroyuelo, Rodrigo Canovas, Gonzalo Navarro and Rajeev RamanLZ78 Compression in Low Main Memory Space|
|15:45-16:00||Yusaku KanetaFaster Practical Block Compression for Rank/Select Dictionaries(Short paper)|
|Session 3||Chair: TBA|
|16:30-16:55||Gonzalo NavarroA Self-Index on Block Trees|
|16:55-17:20||Shmuel Tomi Klein, Tamar C Serebro and Dana ShapiraOptimal Skeleton Huffman Trees|
|17:20-17:35||Philip Bille, Anders Roy Christiansen, Nicola Prezza and Frederik Rye SkjoldjensenSuccint Partial Sums and Fenwick Trees(Short paper)|
|Wednesday, 27 September 2017|
|Invited Talk 2||Chair: Rossano Venturini|
|9:30-10:30||Invited talkFlavio Chierichetti Locality Sensitive Hashing, Similarities and Distortion|
|Session 4||Chair: TBA|
|11:00-11:25||Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga and Hiroki ArimuraLinear-size CDAWG: new repetition-aware indexing and grammar compression|
|11:25-11:50||Djamal Belazzougui and Fabio CunialFast label extraction in the CDAWG|
|11:50-12:15||Nieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón, Gonzalo Navarro and Jose R. ParamaEfficient Compression and Indexing of Trajectories|
|12:15-12:30||Golnaz Badkobeh, Juha Kärkkäinen, Simon Puglisi and Bella ZhukovaOn suffix tree breadth(Short paper)|
|Thursday, 28 September 2017|
|Invited Talk 3||Chair: Marinella Sciortino|
|9:30-10:30||Invited talkStéphane Vialette Permutationology: Stringology for Permutations|
|Session 5||Chair: TBA|
|11:00-11:25||Dmitry Kosolobov, Florin Manea and Dirk NowotkaDetecting One-variable Patterns|
|11:25-11:50||Mikhail Rubinchik and Arseny ShurCounting Palindromes in Substrings|
|11:50-12:15||Mika Amit and Pawel GawrychowskiDistinct squares in circular words|
|12:15-12:30||Szymon GrabowskiRegular Abelian periods and longest common Abelian factors on run-length encoded strings(Short paper)|
|Session 6||Chair: TBA|
|14:30-14:55||Shunsuke Kanda, Kazuhiro Morita and Masao FuketaPractical Implementation of Space-Efficient Dynamic Keyword Dictionaries|
|14:55-15:20||Cedric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca and Mathias WellerConstructing a Consensus Phylogeny from a Leaf-Removal Distance|
|15:20-15:45||Jarno Alanko and Tuukka NorriGreedy shortest common superstring approximation in compact space|
|15:45-16:00||Heikki HyyröMining bit-parallel LCS length algorithms(Short paper)|
|Session 7||Chair: TBA|
|16:30-16:55||Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno and Luca VersariListing Maximal Independent Sets with Minimal Space and Bounded Delay|
|16:55-17:20||Jan Broß, Simon Gog, Matthias Hauck and Marcus ParadiesFast Construction of Compressed Web Graphs|
|17:20-17:35||Philip Bille, Finn Fernstrøm and Inge Li GørtzTight Bounds for Top Tree Compression(Short paper)|
|Early||July 29th, 2017||€ 390||€ 250|
|Late||September 11th, 2017||€ 460||€ 300|