Los Cabos  

October 11-13 2010

Los Cabos, México

  
line decor
  
line decor
 
 
 
 
 
 
String Processing and Information Retrieval Symposium
Luis M. S. Russo . Multiplication Algorithms for Monge Matrices
Amihood Amir , Estrella Eisenberg, Orgad Keller, Avivit Levy and Ely Porat . Approximate String Matching with Stuck Address Bits
Felipe Bravo-Marquez,Gaston L'Huillier, Sebastián A. Ríos and Juan D. Velásquez . Hypergeometric Language Model and Zipf-like Scoring Function for Web Document Similarity Retrieval
Philip Bille, Inge Li Gørtz , Hjalte Wedel Vildhøj and David Kofoed Wind . String Matching with Variable Length Gaps
Maxime Crochemore , Costas Iliopoulos , Marcin Kubica , Jakub Radoszewski,Wojciech Rytter and Tomasz Walen. Extracting Powers and Periods in a String from its Runs Structure
Amihood Amir , Alberto Apostolico , Gad Landau and Oren Sar Shalom. A PTAS for the Square tiling Problem
Shanika Kuruppu, Simon J. Puglisi and Justin Zobel . Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
Maxime Crochemore and German Tischler. Gapped Suffix Arrays: a New Index Structure for Fast Approximate Matching
Yoram Bachrach and Ralf Herbrich . Fingerprinting Ratings For Collaborative Filtering — Theoretical and Empirical Analysis
Alberto Apostolico, Péter Erdős and Alpar Juttner. Parameterized Searching with Mismatches for Run-length Encoded Strings
Sergio Jiménez, Fabio A. Gonzalez and Alexander Gelbukh . Text Comparison Using Soft Cardinality
Joaquin Perez-Iglesias and Lourdes Araujo . Standard Deviation as a Query Hardness Estimator
Joaquin Perez-Iglesias and Lourdes Araujo . Evaluation of Query Performance Prediction Methods by Range
Wladmir C. Brandão , Edleno S. Moura , Altigran S. Silva and Nivio Ziviani . A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles
Christina Boucher and Mohamed Omar . On the Hardness of Counting and Sampling Center Strings
Christina Boucher and Kathleen Wilkie. Why Large Closest String Instances are Easy to Solve in Practice
Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Counting and Verifying Maximal Palindromes
Diego Arroyuelo , Senén González and Mauricio Silva Oyarzun . Compressed Self-Indices Supporting Conjunctive Queries on Document Collections
Djamal Belazzougui, Paolo Boldi and Sebastiano Vigna . Dynamic Z-Fast Tries
Daniele Broccolo, Franco Maria Nardini , Raffaele Perego , Fabrizio Silvestri and Ophir Frieder . Incremental Algorithms for Effective and Efficient Query Recommendation
Dennis Luxen , Peter Sanders and Daniel Karch. Improved Fast Similarity Search in Dictionaries
Enno Ohlebusch, Johannes Fischer and Simon Gog . CST++
Enno Ohlebusch, Simon Gog and Adrian Kügel. Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes
Pierre Peterlongo , Vincent Lacroix , Nicolas Schnel, Nadia Pisanti and Marie-France Sagot . Identifying SNPs without a reference genome by comparing raw reads
Hossein Vahabi, Franco Maria Nardini , Fabrizio Silvestri , Ophir Frieder and Pedram Vahabi. On Tag Spell Checking
Travis Gagie, Gonzalo Navarro and Simon Puglisi. Colored Range Queries and Document Retrieval
Meng He and Ian Munro . Succinct Representations of Dynamic Strings
Georges Dupret, Ricardo Zilleruelo-Ramos and Sumio Fujita. Using Related Queries to Improve Web Search Results Ranking
Sharma V. Thankachan , Wing Kai Hon , Rahul Shah and Jeff Vitter . String Retrieval for Multi-pattern Queries
Francisco Claude , J. Ian Munro and Patrick K. Nicholson . Range Queries over Untangled Chains
Zvi Gotthilf, Danny Hermelin , Moshe Lewenstein and Gad Landau . Restricted LCS
Zvi Gotthilf, Moshe Lewenstein and Alexandru Popa . On Shortest Common Superstring and Swap Permutations
Yusaku Kaneta , Shin-ichi Minato and Hiroki Arimura . Fast Bit-Parallel Matching for Network and Regular Expressions
Takashi Uemura, Takuya Kida , Satoshi Yoshida, Tatsuya Asai and Seishi Okamoto. Training Parse Trees for Efficient VF Coding
Atsuyoshi Nakamura, Tomoya Saito, Ichigaku Takigawa , Hiroshi Mamitsuka and Mineichi Kudo . Algorithms for Finding a Minimum Repetition Representation of a String
Omar Alonso , Michael Gertz and Ricardo Baeza-Yates . Temporal Analysis of Document Collections: Framework and Applications
Effat Farhana, Jannatul Ferdous, Tanaeem Moosa and M. Sohel Rahman . Algorithms for the Generalized Constrained Longest Common Subsequence Problems
Alexandre P. Francisco , Ricardo Baeza-Yates and Arlindo L. Oliveira . Mining large query log induced graphs towards a query folksonomy
Wing Kai Hon , Tsung-Han Ku, Rahul Shah , Sharma V. Thankachan and Jeff Vitter . Faster Compressed Dictionary Matching

 
 
 
 

Topics
The scope of the SPIRE series of conferences includes not only fundamental algorithms in SP and IR but also contributions in different application areas such as computational biology, DNA sequencing, WWW based IR systems, and IR related languages like SGML and XML. Given its inter-disciplinary nature, SPIRE offers a singular opportunity for researchers from computer science, information science, and engineering interested in working with problems related to these areas to meet and discuss how to collaborate towards the best solutions. Typical topics of interest include, but are not limited to

  • String Processing: Dictionary algorithms, Text searching, Pattern matching, Text and sequence compression, Automata based string processing.
  • Information Retrieval: Information retrieval models, Indexing, Ranking and filtering, Interface design, Visualization, Benchmarking.
  • Natural language processing:Text analysis, Text mining, Machine learning, Information extraction, Language models (both structural and semantic), Knowledge representation.
  • Search applications and usage: Cross-lingual information access systems, Multimedia information access, Digital libraries, Collaborative retrieval and Web related applications, Semi-structured data retrieval, Evaluation.
  • Interaction of biology and computation: DNA sequencing and applications in molecular biology, Evolution and phylogenetics, Recognition of genes and regulatory elements, Sequence driven protein structure prediction.
  • Efficient implementation of IR systems: Practical implementations with strong experimental support, toolkits for IR systems. Algorithms and data structures for IR.