default search action
Journal of Discrete Algorithms, Volume 18
Volume 18, January 2013
- Roberto Grossi, Fabrizio Sebastiani
, Fabrizio Silvestri:
Editorial. 1-2 - Djamal Belazzougui, Gonzalo Navarro, Daniel Valenzuela:
Improved compressed indexes for full-text document retrieval. 3-13 - Djamal Belazzougui, Mathieu Raffinot:
Approximate regular expression matching with multi-strings. 14-21 - Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the longest common prefix array based on the Burrows-Wheeler transform. 22-31 - Dany Breslauer, Giuseppe F. Italiano
Near real-time suffix tree construction via the fringe marked ancestor problem. 32-48 - Georges Dupret, Benjamin Piwowarski
Model Based Comparison of Discounted Cumulative Gain and Average Precision. 49-62 - Pedram Ghodsnia, Kamran Tirdad, J. Ian Munro, Alejandro López-Ortiz:
A novel approach for leveraging co-occurrence to improve the false positive error in signature files. 63-74 - Veronica Gil-Costa
Modelling efficient novelty-based search result diversification in metric spaces. 75-88 - Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram mining on SLP compressed strings. 89-99 - Shirou Maruyama, Masaya Nakahara, Naoya Kishiue, Hiroshi Sakamoto:
ESP-index: A compressed index based on edit-sensitive parsing. 100-112 - Chris Thachuk:
Indexing hypertext. 113-122
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 2024-12-31 21:33 CET 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: