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