default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15. SPIRE 2008: Melbourne, Australia
- Amihood Amir, Andrew Turpin, Alistair Moffat
:
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 - David Hawking:
"Search Is a Solved Problem" and Other Annoying Fallacies. 1 - Gad M. Landau:
Approximate Runs - Revisited. 2 - Juha Kärkkäinen, Tommi Rantala:
Engineering Radix Sort for Strings. 3-14 - Roman Kolpakov, Mathieu Raffinot:
Faster Text Fingerprinting. 15-26 - Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda:
Context-Sensitive Grammar Transform: Compression and Pattern Matching. 27-38 - Shmuel Tomi Klein, Dana Shapira:
Improved Variable-to-Fixed Length Codes. 39-50 - Vo Ngoc Anh, Raymond Wan, Alistair Moffat:
Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring. 51-62 - Laurence Anthony F. Park, Kotagiri Ramamohanarao:
The Effect of Weighted Term Frequencies on Probabilistic Latent Semantic Term Relationships. 63-74 - Anni Järvelin, Antti Järvelin:
Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation. 75-86 - Francisco Claude, Gonzalo Navarro, Hannu Peltola, Leena Salmela, Jorma Tarhio:
Speeding Up Pattern Matching by Text Sampling. 87-98 - Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild:
Mismatch Sampling. 99-108 - Martin Senft, Tomás Dvorák:
Sliding CDAWG Perfection. 109-120 - Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, Ángeles Saavedra Places, Eduardo Rodríguez:
Self-indexing Natural Language. 121-132 - William F. Smyth, Shu Wang:
New Perspectives on the Prefix Array. 133-143 - Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Indexed Hierarchical Approximate String Matching. 144-154 - Heikki Hyyrö:
An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper). 155-163 - 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 - Francisco Claude, Gonzalo Navarro:
Practical Rank/Select Queries over Arbitrary Sequences. 176-187 - Alexandre P. Francisco, Ricardo Baeza-Yates, Arlindo L. Oliveira:
Clique Analysis of Query Log Graphs. 188-199 - Frederik Transier, Peter Sanders:
Out of the Box Phrase Indexing. 200-211 - Ohad Lipsky, Ely Porat:
Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. 212-223 - Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange Rearrangement: The Element-Cost Model. 224-235 - Inbok Lee, Juan Mendivelso, Yoan J. Pinzón:
delta-gamma-Parameterized Matching. 236-248 - Benny Porat, Ely Porat, Asaf Zur:
Pattern Matching with Pair Correlation Distance. 249-256 - Vadim G. Timkovsky:
Some Approximations for Shortest Common Nonsubsequences and Supersequences. 257-268 - Christina Boucher, Daniel G. Brown, Stephane Durocher:
On the Structure of Small Motif Recognition Instances. 269-281 - Gary Benson, Denise Y. F. Mak:
Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection. 282-293
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-03 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
