15th String Processing and Information Retrieval Symposium
Melbourne Australia, November 10-12
Accepted Papers
- Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring
Vo Anh, University of Melbourne, Australia
Raymond Wan, Kyoto University, Japan
Alistair Moffat, University of Melbourne, Australia
- Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection
Gary Benson, Boston University, USA
Denise Mak, Boston University, USA
- On the structure of small motif recognition instances
Christina Boucher, University of Waterloo, Canada
Daniel Brown, University of Waterloo, Canada
Stephane Durocher, University of Waterloo, Canada
- Self-Indexing Natural Language
Nieves R. Brisaboa, Universidade da Coruña, Spain
Antonio Fariñ, Universidade da Coruña, Spain
Gonzalo Navarro, University of Chile, Chile
Angeles S. Places, Universidade da Coruña, Spain
Eduardo Rodriguez, Universidade da Coruña, Spain
- Practical Rank/Select Queries over Arbitrary Sequences
Francisco Claude, University of Chile, Chile
Gonzalo Navarro, University of Chile, Chile
- Speeding Up Pattern Matching by Text Sampling
Francisco Claude, University of Chile, Chile
Gonzalo Navarro, University of Chile, Chile
Hannu Peltola, Helsinki University of Technology, Finland
Leena Salmela, Helsinki University of Technology, Finland
Jorma Tarhio, Helsinki University of Technology, Finland
- Mismatch sampling
Raphael Clifford, University of Bristol, UK
Klim Efremenko, Bar-Ilan University, Israel and Weizman Institute, Israel
Benny Porat, Bar-Ilan University, Israel
Ely Porat, Bar-Ilan University, Israel
Amir Rothschild, Tel-Aviv University, Israel and Bar-Ilan University, Israel
- Clique Analysis of Query Log Graphs
Alexandre P. Francisco, INESC-ID/IST, Technical University of Lisbon, Portugal
Ricardo Baeza-Yates, Yahoo! Research, Spain
Arlindo Oliveira, IST/INESC-ID and Cadence Research Laboratories, Portugal
- An efficient linear space algorithm for consecutive suffix alignment under edit distance
Heikki Hyyrö, University of Tampere, Finland
- Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation
Anni Järvelin, University of Tampere, Finland
Antti Järvelin, University of Tampere, Finland
- Engineering Radix Sort for Strings
Juha Kärkkäinen, University of Helsinki, Finland
Tommi Rantala, University of Helsinki, Finland
- Improved Variable-to-Fixed Length Codes
Shmuel Tomi Klein, Bar-Ilan University, Israel
Dana Shapira, Ashkelon Academic College, Israel
- Faster Text Fingerprinting
Roman Kolpakov, Lomonosov Moscow State University, Russia
Mathieu Raffinot, University of Paris Diderot, France
- Interchange Rearrangement: The Element-Cost Model
Oren Kapah, Bar-Ilan University, Israel
Gad Landau, University of Haifa, Israel
Avivit Levy, University of Haifa, Israel
Nitsan Oz, University of Haifa, Israel
- Delta Gamma Parameterized Matching
Inbok Lee, Hankuk Aviation University, South Korea
Juan Mendivelso, National University of Colombia, Colombia
Yoan J. Pinzón, National University of Colombia, Colombia
- Context-Sensitive Grammar Transform: Compression and Pattern Matching
Shirou Maruyama, Kyushu University, Japan
Yohei Tanaka, Kyushu Institute of Technology, Japan
Hiroshi Sakamoto, Kyushu Institute of Technology, Japan
Masayuki Takeda, Kyushu University, Japan
- The effect of weighted term frequencies on probabilistic latent semantic term relationships
Laurence Park, University of Melbourne, Australia
Kotagiri Ramamohanarao, University of Melbourne, Australia
- Approximated Pattern Matching with the L1, L2 and L∞ Metrics
Ely Porat, Bar-Ilan University, Israel
Ohad Lipsky, Bar-Ilan University, Israel
- Pattern Matching with Pair Correlation Distance
Ely Porat, Bar-Ilan University, Israel
Asaf Zur, Bar-Ilan University, Israel
Benny Porat, Bar-Ilan University, Israel
- Indexed Hierarchical Approximate String Matching
Luis M. S. Russo, FCT/INESC-ID, Portugal
Gonzalo Navarro, University of Chile, Chile
Arlindo Oliveira, IST/INESC-ID, Portugal
- Sliding CDAWG Perfection
Martin Senft, Charles University, Czech Republic
Tomáš Dvořák, Charles University, Czech Republic
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
Jouni Siren, University of Helsinki, Finland
Niko Välimäki, University of Helsinki, Finland
Veli Mäkinen, University of Helsinki, Finland
Gonzalo Navarro, University of Chile, Chile
- Some Approximations for Shortest Common Nonsubsequences and Supersequences
Vadim Timkovsky, University of Sydney, Australia
- Out of the Box Phrase Indexing
Frederik Transier, Universität Karlsruhe, Germany
Peter Sanders, Universität Karlsruhe, Germany
- New Perspectives on the Prefix Array
Shu Wang, McMaster University, Canada
William F. Smyth, McMaster University, Canada
Sponsors
