001481106 000__ 04561cam\\22005657i\4500
001481106 001__ 1481106
001481106 003__ OCoLC
001481106 005__ 20231031003323.0
001481106 006__ m\\\\\o\\d\\\\\\\\
001481106 007__ cr\cn\nnnunnun
001481106 008__ 230926s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001481106 020__ $$a9783031439803$$q(electronic bk.)
001481106 020__ $$a3031439805$$q(electronic bk.)
001481106 020__ $$z9783031439797
001481106 0247_ $$a10.1007/978-3-031-43980-3$$2doi
001481106 035__ $$aSP(OCoLC)1399538906
001481106 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dWSU
001481106 049__ $$aISEA
001481106 050_4 $$aQA76.9.T48
001481106 08204 $$a005.7/2$$223/eng/20230926
001481106 1112_ $$aSPIRE (Symposium)$$n(30th :$$d2023 :$$cPisa, Italy)
001481106 24510 $$aString processing and information retrieval :$$b30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings /$$cFranco Maria Nardini, Nadia Pisanti, Rossano Venturini, editors.
001481106 2463_ $$aSPIRE 2023
001481106 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2023]
001481106 300__ $$a1 online resource (xix, 394 pages) :$$billustrations (some color)
001481106 336__ $$atext$$btxt$$2rdacontent
001481106 337__ $$acomputer$$bc$$2rdamedia
001481106 338__ $$aonline resource$$bcr$$2rdacarrier
001481106 4901_ $$aLecture Notes in Computer Science ;$$v14240
001481106 500__ $$aIncludes author index.
001481106 5050_ $$aLongest Common Prefix Arrays for Succinct k-Spectra -- On Suffix Tree Detection -- Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph -- Evaluating Regular Path Queries on Compressed Adjacency Matrices -- Approximate Cartesian Tree Matching: an Approach Using Swaps -- Optimal Wheeler Language Recognition -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Compressibility Measures for Two-dimensional Data -- From De Bruijn Graphs to Variation Graphs - Relationships between Pangenome Models -- CAGE: Cache-Aware Graphlet Enumeration -- Space-time Trade-offs for the LCP Array of Wheeler DFAs -- Computing all-vs-all MEMs in Grammar-compressed Text -- Sublinear Time Lempel-Ziv (LZ77) Factorization -- New Advances in Rightmost Lempel-Ziv -- Engineering a Textbook Approach to Index Massive String Dictionaries -- Count-min Sketch with Variable Number of Hash Functions: an Experimental Study -- Dynamic Compact Planar Embeddings -- A Simple Grammar-based Index for Finding Approximately Longest Common Substrings -- On the Number of Factors in the LZ-End Factorization -- Non-Overlapping Indexing in BWT-runs Bounded Space -- Efficient Parameterized Pattern Matching in Sublinear Space -- Largest Repetition Factorization of Fibonacci Words -- String Covers of a Tree Revisited -- Compacting Massive Public Transport Data -- Constant Time and Space Updates for the Sigma-Tau Problem -- Generalized Minimal Absent Words of Multiple Strings -- Frequency-Constrained Substring Complexity -- Chaining of Maximal Exact Matches in Graphs -- Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems -- Binary Mixed-digit Data Compression Codes.
001481106 506__ $$aAccess limited to authorized users.
001481106 520__ $$aThis volume LNCS 14240 constitutes the refereed proceedings of the 30th International Symposium on String Processing and Information Retrieval, SPIRE 2023, held in Pisa, Italy, during September 26–28, 2023. The 31 full papers presented were carefully reviewed and selected from 47 submissions. They cover topics such as: data structures; algorithms; constrained Substring complexity; data compression codes; succinct k-spectra; and LCP array of wheeler DFAs.
001481106 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 26, 2023).
001481106 650_0 $$aText processing (Computer science)$$vCongresses.$$vCongresses$$0(DLC)sh2008112812
001481106 650_0 $$aInformation retrieval$$vCongresses.$$0(DLC)sh 85009792
001481106 655_7 $$aConference papers and proceedings.$$2lcgft
001481106 655_0 $$aElectronic books.
001481106 7001_ $$aNardini, Franco Maria,$$eeditor.
001481106 7001_ $$aPisanti, Nadia,$$eeditor.
001481106 7001_ $$aVenturini, Rossano,$$eeditor.
001481106 830_0 $$aLecture notes in computer science ;$$v14240.
001481106 852__ $$bebk
001481106 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-43980-3$$zOnline Access$$91397441.1
001481106 909CO $$ooai:library.usi.edu:1481106$$pGLOBAL_SET
001481106 980__ $$aBIB
001481106 980__ $$aEBOOK
001481106 982__ $$aEbook
001481106 983__ $$aOnline
001481106 994__ $$a92$$bISE