000 04367nam a22006615i 4500
001 978-3-319-67428-5
003 DE-He213
005 20240423125345.0
007 cr nn 008mamaa
008 170905s2017 sz | s |||| 0|eng d
020 _a9783319674285
_9978-3-319-67428-5
024 7 _a10.1007/978-3-319-67428-5
_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] :
_b24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings /
_cedited by Gabriele Fici, Marinella Sciortino, Rossano Venturini.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXIX, 318 p. 65 illus.
_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 ;
_v10508
505 0 _aGreedy shortest common superstring approximation in compact space -- Longest common factor after one edit operation -- Distinct squares in circular words -- LZ78 Compression in Low Main Memory Space -- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.-On suffix tree breadth -- Pattern Matching on Elastic-Degenerate Text with Errors -- Succint Partial Sums and Fenwick Trees -- Tight Bounds for Top Tree Compression -- Efficient Compression and Indexing of Trajectories -- Fast Construction of Compressed Web Graphs -- Constructing a Consensus Phylogeny from a Leaf-Removal Distance -- Listing Maximal Independent Sets with Minimal Space and Bounded Delay -- Fast label extraction in the CDAWG -- Lightweight BWT and LCP Merging via the Gap algorithm -- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries -- Regular Abelian periods and longest common Abelian factors on run-length encoded strings.-Mining bit-parallel LCS-length algorithms -- Practical Implementationof Space-Efficient Dynamic Keyword Dictionaries -- Faster Practical Block Compression for Rank/Select Dictionaries -- Optimal Skeleton Huffman Trees -- Detecting Unary Patterns -- Order preserving pattern matching on trees and DAGs -- A Self-Index on Block Trees -- Counting Palindromes in Substrings -- linear-size CDAWG: new repetition-aware indexing and grammar compression. .
520 _aThis book constitutes the proceedings of the 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, held in Palermo, Italy, in September 2017. The 26 papers presented in this volume were carefully reviewed and selected from 71 submissions. They focus on fundamental studies on string processing and information retrieval, as well as on computational biology. .
650 0 _aInformation storage and retrieval systems.
650 0 _aElectronic data processing
_xManagement.
650 0 _aInformation technology
_xManagement.
650 0 _aArtificial intelligence.
650 0 _aDatabase management.
650 0 _aComputer vision.
650 1 4 _aInformation Storage and Retrieval.
650 2 4 _aIT Operations.
650 2 4 _aComputer Application in Administrative Data Processing.
650 2 4 _aArtificial Intelligence.
650 2 4 _aDatabase Management.
650 2 4 _aComputer Vision.
700 1 _aFici, Gabriele.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSciortino, Marinella.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aVenturini, Rossano.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319674278
776 0 8 _iPrinted edition:
_z9783319674292
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10508
856 4 0 _uhttps://doi.org/10.1007/978-3-319-67428-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c177056
_d177056