International Symposium on String Processing and Information Retrieval

SPIRE

CORE rank

CORE rank (raw)

Fields of research

Data Management and Data Science

Papers indexed

857

1998–2025

Best Data Science and Information Retrieval conferences

Papers per year

199845 peak2025

Most published authors

SPIRE papers

857 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2018	Compressed Communication Complexity of Longest Common Prefixes.	Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Grtz, Eva Rotenberg
2018	Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation.	Jrmy Barbay, Andrs Olivares
2018	Adaptive Computation of the Discrete Frchet Distance.	Jrmy Barbay
2018	Longest Property-Preserved Common Factor.	Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2018	Longest Common Prefixes with k-Errors and Applications.	Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
2018	Searching for a Modified Pattern in a Changing Text.	Amihood Amir, Eitan Kondratovsky
2018	Efficient Computation of Sequence Mappability.	Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski
2018	Recoloring the Colored de Bruijn Graph.	Bahar Alipanahi, Alan Kuhnle, Christina Boucher
2017	Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression.	Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura
2017	Counting Palindromes in Substrings.	Mikhail Rubinchik, Arseny M. Shur
2017	A Self-index on Block Trees.	Gonzalo Navarro
2017	Order Preserving Pattern Matching on Trees and DAGs.	Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017	Detecting One-Variable Patterns.	Dmitry Kosolobov, Florin Manea, Dirk Nowotka
2017	Optimal Skeleton Huffman Trees.	Shmuel T. Klein, Tamar C. Serebro, Dana Shapira
2017	Faster Practical Block Compression for Rank/Select Dictionaries.	Yusaku Kaneta
2017	Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries.	Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa
2017	Mining Bit-Parallel LCS-length Algorithms.	Heikki Hyyr
2017	Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings.	Szymon Grabowski
2017	Lightweight BWT and LCP Merging via the Gap Algorithm.	Lavinia Egidi, Giovanni Manzini
2017	Listing Maximal Independent Sets with Minimal Space and Bounded Delay.	Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
2017	Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract).	Cdric Chauve, Mark Jones, Manuel Lafond, Cline Scornavacca, Mathias Weller
2017	Fast Construction of Compressed Web Graphs.	Jan Bro, Simon Gog, Matthias Hauck, Marcus Paradies
2017	Efficient Compression and Indexing of Trajectories.	Nieves R. Brisaboa, Travis Gagie, Adrin Gmez-Brandn, Gonzalo Navarro, Jos R. Param
2017	Tight Bounds for Top Tree Compression.	Philip Bille, Finn Fernstrm, Inge Li Grtz
2017	Succinct Partial Sums and Fenwick Trees.	Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen

201–225 of 857← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.