String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings
Edleno Silva de Moura, Maxime Crochemore (Editors)
- Anthology ID:
- 2014.spire_conference-2014
- Year:
- 2014
- Venue:
- spire_conference
- Publisher:
- Springer
- URL:
- https://doi.org/10.1007/978-3-319-11918-2
- DOI:
- 10.1007/978-3-319-11918-2
- DBLP:
- conf/spire/2014
Strategic Pattern Search in Factor-Compressed Text
Simon Gog
|
Alistair Moffat
|
Matthias Petri
Relative Lempel-Ziv with Constant-Time Random Access
Héctor Ferrada
|
Travis Gagie
|
Simon Gog
|
Simon J. Puglisi
Efficient Compressed Indexing for Approximate Top-k String Retrieval
Héctor Ferrada
|
Gonzalo Navarro
Grammar Compressed Sequences with Rank/Select Support
Gonzalo Navarro
|
Alberto Ordóñez Pereira
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings
Amihood Amir
|
Alberto Apostolico
|
Tirza Hirst
|
Gad M. Landau
|
Noa Lewenstein
|
Liat Rozenberg
Relative FM-Indexes
Djamal Belazzougui
|
Travis Gagie
|
Simon Gog
|
Giovanni Manzini
|
Jouni Sirén
Efficient Indexing and Representation of Web Access Logs
Francisco Claude
|
Roberto Konow
|
Gonzalo Navarro
A Compressed Suffix-Array Strategy for Temporal-Graph Indexing
Nieves R. Brisaboa
|
Diego Caro
|
Antonio Fariña
|
M. Andrea Rodríguez
Succinct Indexes for Reporting Discriminating and Generic Words
Sudip Biswas
|
Manish Patil
|
Rahul Shah
|
Sharma V. Thankachan
Fast Construction of Wavelet Trees
J. Ian Munro
|
Yakov Nekrich
|
Jeffrey Scott Vitter
Order Preserving Prefix Tables
Md. Mahbubul Hasan
|
A. S. M. Sohidull Islam
|
Mohammad Saifur Rahman
|
M. Sohel Rahman
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time
Enno Ohlebusch
|
Timo Beller
A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task
Regina Beretta Mazaro
|
Leandro Ishi Soares de Lima
|
Said Sadique Adi
Improved Filters for the Approximate Suffix-Prefix Overlap Problem
Gregory Kucherov
|
Dekel Tsur
Sequence Decision Diagrams
Hind Alhakami
|
Gianfranco Ciardo
|
Marek Chrobak
Shortest Unique Queries on Strings
Xiaocheng Hu
|
Jian Pei
|
Yufei Tao
Online Multiple Palindrome Pattern Matching
Hwee Kim
|
Yo-Sub Han
Indexed Matching Statistics and Shortest Unique Substrings
Djamal Belazzougui
|
Fabio Cunial
I/O-Efficient Dictionary Search with One Edit Error
Chin-Wan Chung
|
Yufei Tao
|
Wei Wang
Online Pattern Matching for String Edit Distance with Moves
Yoshimasa Takabatake
|
Yasuo Tabei
|
Hiroshi Sakamoto
K 2-Treaps: Range Top-k Queries in Compact Space
Nieves R. Brisaboa
|
Guillermo de Bernardo
|
Roberto Konow
|
Gonzalo Navarro
Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections
Gabriel Tolosa
|
Luca Becchetti
|
Esteban Feuerstein
|
Alberto Marchetti-Spaccamela
Information-Theoretic Term Selection for New Item Recommendation
Thales F. Costa
|
Anísio Lacerda
|
Rodrygo L. T. Santos
|
Nivio Ziviani
On the String Consensus Problem and the Manhattan Sequence Consensus Problem
Tomasz Kociumaka
|
Jakub W. Pachocki
|
Jakub Radoszewski
|
Wojciech Rytter
|
Tomasz Walen
Context-Aware Deal Size Prediction
Anísio Lacerda
|
Adriano Veloso
|
Rodrygo L. T. Santos
|
Nivio Ziviani
Simple and Efficient String Algorithms for Query Suggestion Metrics Computation
Alexander Loptev
|
Anna Selugina
|
Tatiana Starikovskaya