default search action
21. SPIRE 2014: Ouro Preto, Brazil
- Edleno Silva de Moura, Maxime Crochemore:
String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings. Lecture Notes in Computer Science 8799, Springer 2014, ISBN 978-3-319-11917-5
Compression
- Simon Gog, Alistair Moffat, Matthias Petri:
Strategic Pattern Search in Factor-Compressed Text. 1-12 - Héctor Ferrada, Travis Gagie, Simon Gog, Simon J. Puglisi:
Relative Lempel-Ziv with Constant-Time Random Access. 13-17 - Héctor Ferrada, Gonzalo Navarro:
Efficient Compressed Indexing for Approximate Top-k String Retrieval. 18-30 - Gonzalo Navarro, Alberto Ordóñez Pereira:
Grammar Compressed Sequences with Rank/Select Support. 31-44
Indexing
- Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. 45-51 - Djamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirén:
Relative FM-Indexes. 52-64 - Francisco Claude, Roberto Konow, Gonzalo Navarro:
Efficient Indexing and Representation of Web Access Logs. 65-76 - Nieves R. Brisaboa, Diego Caro, Antonio Fariña, M. Andrea Rodríguez:
A Compressed Suffix-Array Strategy for Temporal-Graph Indexing. 77-88 - Sudip Biswas, Manish Patil, Rahul Shah, Sharma V. Thankachan:
Succinct Indexes for Reporting Discriminating and Generic Words. 89-100 - J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Fast Construction of Wavelet Trees. 101-110 - Md. Mahbubul Hasan, A. S. M. Sohidull Islam, Mohammad Saifur Rahman, M. Sohel Rahman:
Order Preserving Prefix Tables. 111-116
Genome and Related Topics
- Enno Ohlebusch, Timo Beller:
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time. 117-128 - Regina Beretta Mazaro, Leandro Ishi Soares de Lima
, Said Sadique Adi:
A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task. 129-138 - Gregory Kucherov, Dekel Tsur:
Improved Filters for the Approximate Suffix-Prefix Overlap Problem. 139-148
Sequences and Strings
- Hind Alhakami, Gianfranco Ciardo
Sequence Decision Diagrams. 149-160 - Xiaocheng Hu, Jian Pei
Shortest Unique Queries on Strings. 161-172 - Hwee Kim, Yo-Sub Han:
Online Multiple Palindrome Pattern Matching. 173-178 - Djamal Belazzougui, Fabio Cunial:
Indexed Matching Statistics and Shortest Unique Substrings. 179-190
Search
- Chin-Wan Chung, Yufei Tao
I/O-Efficient Dictionary Search with One Edit Error. 191-202 - Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Online Pattern Matching for String Edit Distance with Moves. 203-214 - Nieves R. Brisaboa, Guillermo de Bernardo, Roberto Konow, Gonzalo Navarro:
K 2-Treaps: Range Top-k Queries in Compact Space. 215-226 - Gabriel Tolosa, Luca Becchetti, Esteban Feuerstein, Alberto Marchetti-Spaccamela:
Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections. 227-235
Mining and Recommending
- Thales F. Costa, Anísio Lacerda, Rodrygo L. T. Santos
Information-Theoretic Term Selection for New Item Recommendation. 236-243 - Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. 244-255 - Anísio Lacerda, Adriano Veloso, Rodrygo L. T. Santos
Context-Aware Deal Size Prediction. 256-267 - Alexander Loptev, Anna Selugina, Tatiana Starikovskaya:
Simple and Efficient String Algorithms for Query Suggestion Metrics Computation. 268-278
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-01-13 01:10 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: