Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > String Processing and Information Retrieval: 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings > Tight Bound for the Number of Distinct Palindromes in a Tree
String Processing and Information Retrieval: 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings |
Costas Iliopoulos; Simon Puglisi; Emine Yilmaz
Springer International Publishing
String Processing and Information Retrieval: 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings
Tight Bound for the Number of Distinct Palindromes in a Tree
Authors

Paweł Gawrychowski; Tomasz Kociumaka; Wojciech Rytter; Tomasz Waleń

ARI Id

1664698860958_2782990

Access

Not Available Free

Pages

270-276

DOI

10.1007/978-3-319-23826-5_26

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-23826-5_26

Table of Contents of Book
Showing 1 to 20 of 36 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XVII
Faster Exact Search Using Document Clustering
Jonathan Dimond; Peter Sanders
1-12
Fast Online Lempel-Ziv Factorization in Compressed Space
Alberto Policriti; Nicola Prezza
13-20
Adaptive Computation of the Swap-Insert Correction Distance
Jérémy Barbay; Pablo Pérez-Lantero
21-32
Transforming XML Streams with References
Sebastian Maneth; Alberto Ordóñez; Helmut Seidl
33-45
Efficient Term Set Prediction Using the Bell-Wigner Inequality
Massimo Melucci
46-53
On Prefix/Suffix-Square Free Words
Marius Dumitran; Florin Manea; Dirk Nowotka
54-66
Temporal Analysis of CHAVE Collection
Olga Craveiro; Joaquim Macedo; Henrique Madeira
67-74
DeShaTo: Describing the Shape of Cumulative Topic Distributions to Rank Retrieval Systems Without Relevance Judgments
Radu Tudor Ionescu; Adrian-Gabriel Chifu; Josiane Mothe
75-82
Induced Sorting Suffixes in External Memory with Better Design and Less Space
Wei Jun Liu; Ge Nong; Wai Hong Chan; Yi Wu
83-94
Efficient Algorithms for Longest Closed Factor Array
Hideo Bannai; Shunsuke Inenaga; Tomasz Kociumaka; Arnaud Lefebvre; Jakub Radoszewski; Wojciech Rytter et al.
95-102
A Compact RDF Store Using Suffix Arrays
Nieves R. Brisaboa; Ana Cerdeira-Pena; Antonio Fariña; Gonzalo Navarro
103-115
Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract)
Julien Allali; Cedric Chauve; Laetitia Bourgeade
116-123
A Faster Algorithm for Computing Maximal \(\alpha \) -gapped Repeats in a String
Yuka Tanimura; Yuta Fujishige; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
124-136
Selective Labeling and Incomplete Label Mitigation for Low-Cost Evaluation
Kai Hui; Klaus Berberich
137-148
Relative Select
Christina Boucher; Alexander Bowe; Travis Gagie; Giovanni Manzini; Jouni Sirén
149-155
Temporal Query Classification at Different Granularities
Dhruv Gupta; Klaus Berberich
156-164
Prefix and Suffix Reversals on Strings
Guillaume Fertin; Loïc Jankowiak; Géraldine Jean
165-176
Filtration Algorithms for Approximate Order-Preserving Matching
Tamanna Chhabra; Emanuele Giaquinta; Jorma Tarhio
177-187
Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly
Vladimír Boža; Jakub Jursa; Broňa Brejová; Tomáš Vinař
188-198
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 36 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings