000 04097nam a22006015i 4500
001 978-3-030-86692-1
003 DE-He213
005 20240423125405.0
007 cr nn 008mamaa
008 210927s2021 sz | s |||| 0|eng d
020 _a9783030866921
_9978-3-030-86692-1
024 7 _a10.1007/978-3-030-86692-1
_2doi
050 4 _aQA75.5-76.95
072 7 _aUNH
_2bicssc
072 7 _aUND
_2bicssc
072 7 _aCOM030000
_2bisacsh
072 7 _aUNH
_2thema
072 7 _aUND
_2thema
082 0 4 _a025.04
_223
245 1 0 _aString Processing and Information Retrieval
_h[electronic resource] :
_b28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings /
_cedited by Thierry Lecroq, Hélène Touzet.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aX, 255 p. 47 illus., 29 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12944
505 0 _aInvited papers -- r-indexing the eBWT -- Unicode at Gigabytes per Second -- Combinatorics -- Longest Common Rollercoasters -- Minimal unique palindromic substrings after single-character substitution -- Permutation-constrained Common String Partitions with Applications -- All instantiations of the greedy algorithm for the shortest superstring problem are equivalent -- String Covers of a Tree -- Compression -- Grammar Index By Induced Suffix Sorting -- An LMS-based Grammar Self-index with Local Consistency Properties -- On the approximation ratio of LZ-End to LZ77 -- Data Structures -- Computing the original eBWT faster, simpler, and with less memory -- Extracting the Sparse Longest Common Pre x Array from the Suffix Binary Search Tree -- findere: fast and precise approximate membership query -- Repeats -- Improved Topic Modeling in Twitter through Community Pooling -- Lower Bounds for the Number of Repetitions in 2D Strings -- On Stricter Reachable Repetitiveness Measures -- Information Retrieval -- Improved Topic modeling in Twitter through Community Pooling -- TSXor: A Simple Time Series Compression Algorithm -- Pattern Matching -- Exploiting Pseudo-Locality of Interchange Distance -- Position Heaps for Cartesian-tree Matching on Strings and Tries.
520 _aThis book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.* The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology. *The symposium was held virtually.
650 0 _aInformation storage and retrieval systems.
650 0 _aArtificial intelligence.
650 0 _aApplication software.
650 0 _aComputer science
_xMathematics.
650 1 4 _aInformation Storage and Retrieval.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer and Information Systems Applications.
650 2 4 _aMathematics of Computing.
700 1 _aLecroq, Thierry.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aTouzet, Hélène.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030866914
776 0 8 _iPrinted edition:
_z9783030866938
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12944
856 4 0 _uhttps://doi.org/10.1007/978-3-030-86692-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c177407
_d177407