15. SPIRE 2008:
Melbourne,
Australia
Amihood Amir, Andrew Turpin, Alistair Moffat (Eds.):
String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings.
Lecture Notes in Computer Science 5280 Springer 2008, ISBN 978-3-540-89096-6 BibTeX
- David Hawking:
"Search Is a Solved Problem" and Other Annoying Fallacies.
1
Electronic Edition (link) BibTeX
- Gad M. Landau:
Approximate Runs - Revisited.
2
Electronic Edition (link) BibTeX
- Juha Kärkkäinen, Tommi Rantala:
Engineering Radix Sort for Strings.
3-14
Electronic Edition (link) BibTeX
- Roman Kolpakov, Mathieu Raffinot:
Faster Text Fingerprinting.
15-26
Electronic Edition (link) BibTeX
- Shirou Maruyama, Yohei Tanaka, Hiroshi Sakamoto, Masayuki Takeda:
Context-Sensitive Grammar Transform: Compression and Pattern Matching.
27-38
Electronic Edition (link) BibTeX
- Shmuel Tomi Klein, Dana Shapira:
Improved Variable-to-Fixed Length Codes.
39-50
Electronic Edition (link) BibTeX
- Vo Ngoc Anh, Raymond Wan, Alistair Moffat:
Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring.
51-62
Electronic Edition (link) BibTeX
- Laurence A. F. Park, Kotagiri Ramamohanarao:
The Effect of Weighted Term Frequencies on Probabilistic Latent Semantic Term Relationships.
63-74
Electronic Edition (link) BibTeX
- Anni Järvelin, Antti Järvelin:
Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation.
75-86
Electronic Edition (link) BibTeX
- Francisco Claude, Gonzalo Navarro, Hannu Peltola, Leena Salmela, Jorma Tarhio:
Speeding Up Pattern Matching by Text Sampling.
87-98
Electronic Edition (link) BibTeX
- Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild:
Mismatch Sampling.
99-108
Electronic Edition (link) BibTeX
- Martin Senft, Tomás Dvorák:
Sliding CDAWG Perfection.
109-120
Electronic Edition (link) BibTeX
- Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, Ángeles S. Places, Eduardo Rodríguez:
Self-indexing Natural Language.
121-132
Electronic Edition (link) BibTeX
- William F. Smyth, Shu Wang:
New Perspectives on the Prefix Array.
133-143
Electronic Edition (link) BibTeX
- Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Indexed Hierarchical Approximate String Matching.
144-154
Electronic Edition (link) BibTeX
- Heikki Hyyrö:
An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper).
155-163
Electronic Edition (link) BibTeX
- Jouni Sirén, Niko Välimäki, Veli Mäkinen, Gonzalo Navarro:
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.
164-175
Electronic Edition (link) BibTeX
- Francisco Claude, Gonzalo Navarro:
Practical Rank/Select Queries over Arbitrary Sequences.
176-187
Electronic Edition (link) BibTeX
- Alexandre P. Francisco, Ricardo A. Baeza-Yates, Arlindo L. Oliveira:
Clique Analysis of Query Log Graphs.
188-199
Electronic Edition (link) BibTeX
- Frederik Transier, Peter Sanders:
Out of the Box Phrase Indexing.
200-211
Electronic Edition (link) BibTeX
- Ohad Lipsky, Ely Porat:
Approximated Pattern Matching with the L1, L2 and Linfinit Metrics.
212-223
Electronic Edition (link) BibTeX
- Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange Rearrangement: The Element-Cost Model.
224-235
Electronic Edition (link) BibTeX
- Inbok Lee, Juan Mendivelso, Yoan J. Pinzon:
delta-gamma-Parameterized Matching.
236-248
Electronic Edition (link) BibTeX
- Benny Porat, Ely Porat, Asaf Zur:
Pattern Matching with Pair Correlation Distance.
249-256
Electronic Edition (link) BibTeX
- Vadim G. Timkovsky:
Some Approximations for Shortest Common Nonsubsequences and Supersequences.
257-268
Electronic Edition (link) BibTeX
- Christina Boucher, Daniel G. Brown, Stephane Durocher:
On the Structure of Small Motif Recognition Instances.
269-281
Electronic Edition (link) BibTeX
- Gary Benson, Denise Y. F. Mak:
Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection.
282-293
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:42:15 2009
by Michael Ley (ley@uni-trier.de)