researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
[-]
OR
AND
NOT
1
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
Filter by Tag
[+]
OR
AND
NOT
1
C++
Meta-Environment
XML
XML Schema
analysis
caching
context-aware
data-flow
design
e-science
edit distance
graph-rewriting
information retrieval
meta-model
partitioning
pattern matching
rewriting
rule-based
search
systematic-approach
Filter by Author
[+]
OR
AND
NOT
1
Amihood Amir
Ayumi Shinohara
Costas S. Iliopoulos
Ely Porat
Gad M. Landau
Giovanni Manzini
Gonzalo Navarro
Hideo Bannai
Jakub Radoszewski
Masayuki Takeda
Nieves R. Brisaboa
Nivio Ziviani
Ricardo A. Baeza-Yates
Sharma V. Thankachan
Shunsuke Inenaga
Simon J. Puglisi
Solon P. Pissis
Tomasz Walen
Travis Gagie
Yuto Nakashima
Filter by Top terms
[+]
OR
AND
NOT
1
algorithm
algorithms
approximate
common
compressed
distance
efficient
fast
information
longest
matching
pattern
processing
retrieval
spire
string
suffix
text
using
web
SPIRE (spire)
Editions
Publications
Viewing Publication 1 - 100 from 841
2023
Chaining of Maximal Exact Matches in Graphs
Nicola Rizzo 0001
,
Manuel Cáceres
,
Veli Mäkinen
.
spire 2023
:
353-366
[doi]
Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems
Lusheng Wang 0001
,
Binhai Zhu
.
spire 2023
:
367-380
[doi]
Longest Common Prefix Arrays for Succinct k-Spectra
Jarno N. Alanko
,
Elena Biagi 0002
,
Simon J. Puglisi
.
spire 2023
:
1-13
[doi]
On Suffix Tree Detection
Amihood Amir
,
Eitan Kondratovsky
,
Avivit Levy
.
spire 2023
:
14-27
[doi]
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
Hiroki Arimura
,
Shunsuke Inenaga
,
Yasuaki Kobayashi
,
Yuto Nakashima
,
Mizuki Sue
.
spire 2023
:
28-34
[doi]
Evaluating Regular Path Queries on Compressed Adjacency Matrices
Diego Arroyuelo
,
Adrián Gómez-Brandón
,
Gonzalo Navarro
.
spire 2023
:
35-48
[doi]
Approximate Cartesian Tree Matching: An Approach Using Swaps
Bastien Auvray
,
Julien David
,
Richard Groult
,
Thierry Lecroq
.
spire 2023
:
49-61
[doi]
Optimal Wheeler Language Recognition
Ruben Becker
,
Davide Cenzato
,
Sung-Hwan Kim
,
Bojana Kodric
,
Alberto Policriti
,
Nicola Prezza
.
spire 2023
:
62-74
[doi]
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem
Guillaume Blin
,
Alexandru Popa 0001
,
Mathieu Raffinot
,
Raluca Uricaru
.
spire 2023
:
75-88
[doi]
Data Structures for SMEM-Finding in the PBWT
Paola Bonizzoni
,
Christina Boucher
,
Davide Cozzi
,
Travis Gagie
,
Dominik Köppl
,
Massimiliano Rossi 0001
.
spire 2023
:
89-101
[doi]
Compressibility Measures for Two-Dimensional Data
Lorenzo Carfagna
,
Giovanni Manzini
.
spire 2023
:
102-113
[doi]
From de Bruijn Graphs to Variation Graphs - Relationships Between Pangenome Models
Adam Cicherski
,
Norbert Dojer
.
spire 2023
:
114-128
[doi]
CAGE: Cache-Aware Graphlet Enumeration
Alessio Conte
,
Roberto Grossi
,
Davide Rucci
.
spire 2023
:
129-142
[doi]
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs
Nicola Cotumaccio
,
Travis Gagie
,
Dominik Köppl
,
Nicola Prezza
.
spire 2023
:
143-156
[doi]
Computing All-vs-All MEMs in Grammar-Compressed Text
Diego DÃaz-DomÃnguez
,
Leena Salmela
.
spire 2023
:
157-170
[doi]
New Advances in Rightmost Lempel-Ziv
Jonas Ellert
,
Johannes Fischer 0001
,
Max Rishøj Pedersen
.
spire 2023
:
188-202
[doi]
Sublinear Time Lempel-Ziv (LZ77) Factorization
Jonas Ellert
.
spire 2023
:
171-187
[doi]
Engineering a Textbook Approach to Index Massive String Dictionaries
Paolo Ferragina
,
Mariagiovanna Rotundo
,
Giorgio Vinciguerra
.
spire 2023
:
203-217
[doi]
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings
Travis Gagie
,
Sana Kashgouli
,
Gonzalo Navarro
.
spire 2023
:
246-252
[doi]
Dynamic Compact Planar Embeddings
Travis Gagie
,
Meng He 0001
,
Michael St Denis
.
spire 2023
:
233-245
[doi]
On the Number of Factors in the LZ-End Factorization
Pawel Gawrychowski
,
Maria Kosche
,
Florin Manea
.
spire 2023
:
253-259
[doi]
Non-overlapping Indexing in BWT-Runs Bounded Space
Daniel Gibney
,
Paul Macnichol
,
Sharma V. Thankachan
.
spire 2023
:
260-270
[doi]
Efficient Parameterized Pattern Matching in Sublinear Space
Haruki Ideguchi
,
Diptarama Hendrian
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
spire 2023
:
271-283
[doi]
Largest Repetition Factorization of Fibonacci Words
Kaisei Kishi
,
Yuto Nakashima
,
Shunsuke Inenaga
.
spire 2023
:
284-296
[doi]
String Covers of a Tree Revisited
Lukasz Kondraciuk
.
spire 2023
:
297-309
[doi]
Compacting Massive Public Transport Data
BenjamÃn Letelier
,
Nieves R. Brisaboa
,
Pablo Gutiérrez-Asorey
,
José R. Paramá
,
Tirso V. Rodeiro
.
spire 2023
:
310-322
[doi]
Constant Time and Space Updates for the Sigma-Tau Problem
Zsuzsanna Lipták
,
Francesco Masillo
,
Gonzalo Navarro
,
Aaron Williams
.
spire 2023
:
323-330
[doi]
String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings
Franco Maria Nardini
,
Nadia Pisanti
,
Rossano Venturini
, editors,
Volume 14240 of
Lecture Notes in Computer Science
, Springer,
2023.
[doi]
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings
Kouta Okabe
,
Takuya Mieno
,
Yuto Nakashima
,
Shunsuke Inenaga
,
Hideo Bannai
.
spire 2023
:
331-344
[doi]
Frequency-Constrained Substring Complexity
Solon P. Pissis
,
Michael Shekelyan
,
Chang Liu
,
Grigorios Loukides
.
spire 2023
:
345-352
[doi]
Binary Mixed-Digit Data Compression Codes
Igor O. Zavadskyi
,
Maksym Kovalchuk
.
spire 2023
:
381-392
[doi]
Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study
Éric Fusy
,
Gregory Kucherov
.
spire 2023
:
218-232
[doi]
2022
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays
Amihood Amir
,
Concettina Guerra
,
Eitan Kondratovsky
,
Gad M. Landau
,
Shoshana Marcus
,
Dina Sokol
.
spire 2022
:
55-69
[doi]
String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings
Diego Arroyuelo
,
Barbara Poblete
, editors,
Volume 13617 of
Lecture Notes in Computer Science
, Springer,
2022.
[doi]
Maximal Closed Substrings
Golnaz Badkobeh
,
Alessandro De Luca 0002
,
Gabriele Fici
,
Simon J. Puglisi
.
spire 2022
:
16-23
[doi]
The Complexity of the Co-occurrence Problem
Philip Bille
,
Inge Li Gørtz
,
Tord Stordalen
.
spire 2022
:
38-52
[doi]
Compressed String Dictionaries via Data-Aware Subtrie Compaction
Antonio Boffa
,
Paolo Ferragina
,
Francesco Tosoni
,
Giorgio Vinciguerra
.
spire 2022
:
233-249
[doi]
-1-Forest
Christina Boucher
,
Dominik Köppl
,
Herman Perera
,
Massimiliano Rossi 0001
.
spire 2022
:
86-98
[doi]
Subsequence Covers of Words
Panagiotis Charalampopoulos
,
Solon P. Pissis
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Walen
,
Wiktor Zuba
.
spire 2022
:
3-15
[doi]
On the Hardness of Computing the Edit Distance of Shallow Trees
Panagiotis Charalampopoulos
,
Pawel Gawrychowski
,
Shay Mozes
,
Oren Weimann
.
spire 2022
:
290-302
[doi]
Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs
Parisa Darbari
,
Daniel Gibney
,
Sharma V. Thankachan
.
spire 2022
:
303-314
[doi]
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries
Rathish Das
,
Meng He 0001
,
Eitan Kondratovsky
,
J. Ian Munro
,
Kaiyu Wu
.
spire 2022
:
217-232
[doi]
Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads
Diego DÃaz-DomÃnguez
,
Simon J. Puglisi
,
Leena Salmela
.
spire 2022
:
198-213
[doi]
Sorting Genomes by Prefix Double-Cut-and-Joins
Guillaume Fertin
,
Géraldine Jean
,
Anthony Labarre
.
spire 2022
:
178-190
[doi]
How Train-Test Leakage Affects Zero-Shot Retrieval
Maik Fröbe
,
Christopher Akiki
,
Martin Potthast
,
Matthias Hagen
.
spire 2022
:
147-161
[doi]
On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs
Travis Gagie
.
spire 2022
:
250-256
[doi]
KATKA: A KRAKEN-Like Tool with k Given at Query Time
Travis Gagie
,
Sana Kashgouli
,
Ben Langmead
.
spire 2022
:
191-197
[doi]
Matching Patterns with Variables Under Edit Distance
Pawel Gawrychowski
,
Florin Manea
,
Stefan Siemer
.
spire 2022
:
275-289
[doi]
Pattern Matching Under rmDTW Distance
Garance Gourdel
,
Anne Driemel
,
Pierre Peterlongo
,
Tatiana Starikovskaya
.
spire 2022
:
315-330
[doi]
Computing the Parameterized Burrows-Wheeler Transform Online
Daiki Hashimoto
,
Diptarama Hendrian
,
Dominik Köppl
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
spire 2022
:
70-85
[doi]
Substring Complexities on Run-Length Compressed Strings
Akiyoshi Kawamoto
,
Tomohiro I
.
spire 2022
:
132-143
[doi]
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
Florian Kurpicz
.
spire 2022
:
257-272
[doi]
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions
Laurentius Leonard
,
Shunsuke Inenaga
,
Hideo Bannai
,
Takuya Mieno
.
spire 2022
:
24-37
[doi]
Balancing Run-Length Straight-Line Programs
Gonzalo Navarro
,
Francisco Olivares
,
Cristian Urbina
.
spire 2022
:
117-131
[doi]
On the Optimisation of the GSACA Suffix Array Construction Algorithm
Jannik Olbrich
,
Enno Ohlebusch
,
Thomas Büchler
.
spire 2022
:
99-113
[doi]
Genome Comparison on Succinct Colored de Bruijn Graphs
Lucas P. Ramos
,
Felipe A. Louza
,
Guilherme P. Telles
.
spire 2022
:
165-177
[doi]
2021
Grammar Index by Induced Suffix Sorting
Tooru Akagi
,
Dominik Köppl
,
Yuto Nakashima
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
.
spire 2021
:
85-99
[doi]
Improved Topic Modeling in Twitter Through Community Pooling
Federico Albanese
,
Esteban Feuerstein
.
spire 2021
:
209-216
[doi]
A Separation of γ and b via Thue-Morse Words
Hideo Bannai
,
Mitsuru Funakoshi
,
Tomohiro I
,
Dominik Köppl
,
Takuya Mieno
,
Takaaki Nishimoto
.
spire 2021
:
167-178
[doi]
r-Indexing the eBWT
Christina Boucher
,
Davide Cenzato
,
Zsuzsanna Lipták
,
Massimiliano Rossi 0001
,
Marinella Sciortino
.
spire 2021
:
3-12
[doi]
Computing the Original eBWT Faster, Simpler, and with Less Memory
Christina Boucher
,
Davide Cenzato
,
Zsuzsanna Lipták
,
Massimiliano Rossi 0001
,
Marinella Sciortino
.
spire 2021
:
129-142
[doi]
TSXor: A Simple Time Series Compression Algorithm
Andrea Bruno
,
Franco Maria Nardini
,
Giulio Ermanno Pibiri
,
Roberto Trani
,
Rossano Venturini
.
spire 2021
:
217-223
[doi]
An LMS-Based Grammar Self-index with Local Consistency Properties
Diego DÃaz-DomÃnguez
,
Gonzalo Navarro
,
Alejandro Pacheco
.
spire 2021
:
100-113
[doi]
Longest Common Rollercoasters
Kosuke Fujita
,
Yuto Nakashima
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
.
spire 2021
:
21-32
[doi]
Minimal Unique Palindromic Substrings After Single-Character Substitution
Mitsuru Funakoshi
,
Takuya Mieno
.
spire 2021
:
33-46
[doi]
Lower Bounds for the Number of Repetitions in 2D Strings
Pawel Gawrychowski
,
Samah Ghazawi
,
Gad M. Landau
.
spire 2021
:
179-192
[doi]
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree
Tomohiro I
,
Robert W. Irving
,
Dominik Köppl
,
Lorna Love
.
spire 2021
:
143-150
[doi]
On the Approximation Ratio of LZ-End to LZ77
Takumi Ideue
,
Takuya Mieno
,
Mitsuru Funakoshi
,
Yuto Nakashima
,
Shunsuke Inenaga
,
Masayuki Takeda
.
spire 2021
:
114-126
[doi]
Permutation-Constrained Common String Partitions with Applications
Manuel Lafond
,
Binhai Zhu
.
spire 2021
:
47-60
[doi]
String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
Thierry Lecroq
,
Hélène Touzet
, editors,
Volume 12944 of
Lecture Notes in Computer Science
, Springer,
2021.
[doi]
Unicode at Gigabytes per Second
Daniel Lemire
.
spire 2021
:
13-18
[doi]
Exploiting Pseudo-locality of Interchange Distance
Avivit Levy
.
spire 2021
:
227-240
[doi]
On Stricter Reachable Repetitiveness Measures
Gonzalo Navarro
,
Cristian Urbina
.
spire 2021
:
193-206
[doi]
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent
Maksim S. Nikolaev
.
spire 2021
:
61-67
[doi]
Position Heaps for Cartesian-Tree Matching on Strings and Tries
Akio Nishimoto
,
Noriki Fujisato
,
Yuto Nakashima
,
Shunsuke Inenaga
.
spire 2021
:
241-254
[doi]
String Covers of a Tree
Jakub Radoszewski
,
Wojciech Rytter
,
Juliusz Straszynski
,
Tomasz Walen
,
Wiktor Zuba
.
spire 2021
:
68-82
[doi]
findere: Fast and Precise Approximate Membership Query
Lucas Robidou
,
Pierre Peterlongo
.
spire 2021
:
151-163
[doi]
2020
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction
Ramtin Afshar
,
Amihood Amir
,
Michael T. Goodrich
,
Pedro Matias
.
spire 2020
:
155-174
[doi]
Pre-indexing Pruning Strategies
Soner Altin
,
Ricardo Baeza-Yates
,
Berkant Barla Cambazoglu
.
spire 2020
:
177-193
[doi]
Approximating the Anticover of a String
Amihood Amir
,
Itai Boneh
,
Eitan Kondratovsky
.
spire 2020
:
99-114
[doi]
Multidimensional Period Recovery
Amihood Amir
,
Ayelet Butman
,
Eitan Kondratovsky
,
Avivit Levy
,
Dina Sokol
.
spire 2020
:
115-130
[doi]
Lyndon Words, the Three Squares Lemma, and Primitive Squares
Hideo Bannai
,
Takuya Mieno
,
Yuto Nakashima
.
spire 2020
:
265-273
[doi]
Smaller Fully-Functional Bidirectional BWT Indexes
Djamal Belazzougui
,
Fabio Cunial
.
spire 2020
:
42-59
[doi]
String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings
Christina Boucher
,
Sharma V. Thankachan
, editors,
Volume 12303 of
Lecture Notes in Computer Science
, Springer,
2020.
[doi]
Efficient Enumeration of Distinct Factors Using Package Representations
Panagiotis Charalampopoulos
,
Tomasz Kociumaka
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Walen
,
Wiktor Zuba
.
spire 2020
:
247-261
[doi]
Tailoring r-index for Document Listing Towards Metagenomics Applications
Dustin Cobas
,
Veli Mäkinen
,
Massimiliano Rossi 0001
.
spire 2020
:
291-306
[doi]
Internal Quasiperiod Queries
Maxime Crochemore
,
Costas S. Iliopoulos
,
Jakub Radoszewski
,
Wojciech Rytter
,
Juliusz Straszynski
,
Tomasz Walen
,
Wiktor Zuba
.
spire 2020
:
60-75
[doi]
Measuring Controversy in Social Networks Through NLP
Juan Manuel Ortiz de Zarate
,
Marco Di Giovanni
,
Esteban Zindel Feuerstein
,
Marco Brambilla 0001
.
spire 2020
:
194-209
[doi]
Practical Random Access to SLP-Compressed Texts
Travis Gagie
,
Tomohiro I
,
Giovanni Manzini
,
Gonzalo Navarro
,
Hiroshi Sakamoto
,
Louisa Seelbach Benkner
,
Yoshimasa Takabatake
.
spire 2020
:
221-231
[doi]
An Efficient Elastic-Degenerate Text Index? Not Likely
Daniel Gibney
.
spire 2020
:
76-88
[doi]
A Comparison of Empirical Tree Entropies
Danny Hucke
,
Markus Lohrey
,
Louisa Seelbach Benkner
.
spire 2020
:
232-246
[doi]
Longest Square Subsequence Problem Revisited
Takafumi Inoue
,
Shunsuke Inenaga
,
Hideo Bannai
.
spire 2020
:
147-154
[doi]
Computing Covers Under Substring Consistent Equivalence Relations
Natsumi Kikuchi
,
Diptarama Hendrian
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
spire 2020
:
131-146
[doi]
On Repetitiveness Measures of Thue-Morse Words
Kanaru Kutsukake
,
Takuya Matsumoto
,
Yuto Nakashima
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
.
spire 2020
:
213-220
[doi]
Contextual Pattern Matching
Gonzalo Navarro
.
spire 2020
:
3-10
[doi]
Towards Efficient Interactive Computation of Dynamic Time Warping Distance
Akihiro Nishi
,
Yuto Nakashima
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
.
spire 2020
:
27-41
[doi]
Efficient Construction of Hierarchical Overlap Graphs
Sung Gwan Park
,
Bastien Cazaux
,
Kunsoo Park
,
Eric Rivals
.
spire 2020
:
277-290
[doi]
Relative Lempel-Ziv Compression of Suffix Arrays
Simon J. Puglisi
,
Bella Zhukova
.
spire 2020
:
89-96
[doi]
Navigating Forest Straight-Line Programs in Constant Time
Carl Philipp Reh
,
Kurt Sieber
.
spire 2020
:
11-26
[doi]
2019
Position Bias Estimation for Unbiased Learning-to-Rank in eCommerce Search
Grigor Aslanyan
,
Utkarsh Porwal
.
spire 2019
:
47-64
[doi]
Sign in
or
sign up
to see more results.