000 04437nam a22005655i 4500
001 978-3-319-02432-5
003 DE-He213
005 20200421112048.0
007 cr nn 008mamaa
008 130930s2013 gw | s |||| 0|eng d
020 _a9783319024325
_9978-3-319-02432-5
024 7 _a10.1007/978-3-319-02432-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUNH
_2bicssc
072 7 _aUND
_2bicssc
072 7 _aCOM030000
_2bisacsh
082 0 4 _a025.04
_223
245 1 0 _aString Processing and Information Retrieval
_h[electronic resource] :
_b20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings /
_cedited by Oren Kurland, Moshe Lewenstein, Ely Porat.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2013.
300 _aXII, 312 p. 62 illus.
_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,
_x0302-9743 ;
_v8214
505 0 _aConsolidating and Exploring information via Textual Inference -- Pattern Discovery and Listing in Graphs -- Efficient Approximation of Edit Distance -- Nowcasting with Google Trends -- Space-efficient Construction of the Burrows-Wheeler Transform -- Using Mutual Inuence to Improve Recommendations -- Position-Restricted Substring Searching Over Small Alphabets -- Simulation Study of Multi-threading in Web Search Engine Processors -- Query Processing in Highly-Loaded Search Engines -- Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs -- Adaptive Data Structures for Permutations and Binary Relations -- Document Listing on Versioned Documents -- Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes -- Compact Querieable Representations of Raster Data -- Top-k Color Queries On Tree Paths -- A Lempel-Ziv Compressed Structure for Document Listing -- Minimal Discriminating Words Problem Revisited -- Adding Compression and Blended Search to a Compact Two-Level Suffix Array -- You are what you eat: learning user tastes for rating prediction -- Discovering dense subgraphs in parallel for compressing Web and Social networks -- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text -- Lossless compression of rotated maskless lithography images -- Learning URL Normalization Rules using Multiple Alignment of Sequences -- On Two-Dimensional Lyndon Words -- Fully-Online Grammar Compression -- Solving Graph Isomorphism using Parameterized Matching -- Suffix Array of Alignment: A Practical Index for Similar Data -- Faster Top-k Document Retrieval in Optimal Space -- Faster Range LCP Queries -- Learning to Schedule Webpage Updates Using Genetic Programming -- Accurate Profiling of Microbial Communities from Massively Parallel Sequencing using Convex Optimization -- Distributed Query Processing on Compressed Graphs using K2-Trees.
520 _aThis book constitutes the refereed proceedings of the 20th International Symposium on String Processing and Information Retrieval, SPIRE 2013, held in Jerusalem, Israel, in October 2013. The 18 full papers, 10 short papers were carefully reviewed and selected from 60 submissions. The program also featured 4 keynote speeches. The following topics are covered: fundamentals algorithms in string processing and information retrieval; SP and IR techniques as applied to areas such as computational biology, DNA sequencing, and Web mining.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aData mining.
650 0 _aInformation storage and retrieval.
650 0 _aPattern recognition.
650 1 4 _aComputer Science.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aPattern Recognition.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Mining and Knowledge Discovery.
700 1 _aKurland, Oren.
_eeditor.
700 1 _aLewenstein, Moshe.
_eeditor.
700 1 _aPorat, Ely.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319024318
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8214
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-02432-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c57042
_d57042