000 | 05130nam a22006735i 4500 | ||
---|---|---|---|
001 | 978-3-031-43980-3 | ||
003 | DE-He213 | ||
005 | 20240207153705.0 | ||
007 | cr nn 008mamaa | ||
008 | 230919s2023 sz | s |||| 0|eng d | ||
020 |
_a9783031439803 _9978-3-031-43980-3 |
||
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
082 | 0 | 4 |
_a518.1 _223 |
245 | 1 | 0 |
_aString Processing and Information Retrieval _h[electronic resource] : _b30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings / _cedited by Franco Maria Nardini, Nadia Pisanti, Rossano Venturini. |
250 | _a1st ed. 2023. | ||
264 | 1 |
_aCham : _bSpringer Nature Switzerland : _bImprint: Springer, _c2023. |
|
300 |
_aXIX, 394 p. 60 illus., 41 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 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v14240 |
|
500 | _aAcceso multiusuario | ||
505 | 0 | _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. | |
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. | ||
541 |
_fUABC ; _cPerpetuidad |
||
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer engineering. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aNumerical analysis. | |
650 | 1 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDesign and Analysis of Algorithms. |
650 | 2 | 4 | _aComputer Engineering and Networks. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aData Structures and Information Theory. |
650 | 2 | 4 | _aNumerical Analysis. |
700 | 1 |
_aNardini, Franco Maria. _eeditor. _0(orcid)0000-0003-3183-334X _1https://orcid.org/0000-0003-3183-334X _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPisanti, Nadia. _eeditor. _0(orcid)0000-0003-3915-7665 _1https://orcid.org/0000-0003-3915-7665 _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aVenturini, Rossano. _eeditor. _0(orcid)0000-0002-9830-3936 _1https://orcid.org/0000-0002-9830-3936 _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031439797 |
776 | 0 | 8 |
_iPrinted edition: _z9783031439810 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v14240 |
|
856 | 4 | 0 |
_zLibro electrónico _uhttp://libcon.rec.uabc.mx:2048/login?url=https://doi.org/10.1007/978-3-031-43980-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cLIBRO_ELEC | ||
999 |
_c262620 _d262619 |