000			05388nam a22006735i 4500
001			978-3-642-03784-9
003			DE-He213
005			20240423125937.0
007			cr nn 008mamaa
008			100301s2009 gw | s |||| 0|eng d
020			_a9783642037849 _9978-3-642-03784-9
024	7		_a10.1007/978-3-642-03784-9 _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] : _b16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings / _cedited by Jussi Karlgren, Jorma Tarhio, Heikki Hyyrö.
250			_a1st ed. 2009.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009.
300			_aXIII, 354 p. _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 ; _v5721
505	0		_aAlgorithms on Trees -- Range Quantile Queries: Another Virtue of Wavelet Trees -- Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees -- k2-Trees for Compact Web Graph Representation -- On-Line Construction of Parameterized Suffix Trees -- Compressed Indexes -- Succinct Text Indexing with Wildcards -- A Compressed Enhanced Suffix Array Supporting Fast String Matching -- Compressed Suffix Arrays for Massive Data -- On Entropy-Compressed Text Indexing in External Memory -- Compression -- A Linear-Time Burrows-Wheeler Transform Using Induced Sorting -- Novel and Generalized Sort-Based Transform for Lossless Data Compression -- A Two-Level Structure for Compressing Aligned Bitexts -- Directly Addressable Variable-Length Codes -- Content Analysis -- Identifying the Intent of a User Query Using Support Vector Machines -- Syntactic Query Models for Restatement Retrieval -- Use of Co-occurrences for Temporal Expressions Annotation -- On-Demand Associative Cross-Language Information Retrieval -- A Comparison of Data-Driven Automatic Syllabification Methods -- Indexing -- Efficient Index for Retrieving Top-k Most Frequent Documents -- Fast Single-Pass Construction of a Half-Inverted Index -- Two-Dimensional Distributed Inverted Files -- Indexing Variable Length Substrings for Exact and Approximate Matching -- String Algorithms and Bioinformatics -- Expectation of Strings with Mismatches under Markov Chain Distribution -- Consensus Optimizing Both Distance Sum and Radius -- Faster Algorithms for Sampling and Counting Biological Sequences -- String Algorithms and Theory I -- Towards a Theory of Patches -- The Frequent Items Problem, under Polynomial Decay, in the Streaming Model -- Improved Approximation Results on the Shortest Common Supersequence Problem -- String Algorithms andTheory II -- Set Intersection and Sequence Matching -- Generalised Matching -- Practical Algorithms for the Longest Common Extension Problem -- Using and Understanding Usage -- A Last-Resort Semantic Cache for Web Queries -- A Task-Based Evaluation of an Aggregated Search Interface -- Efficient Language-Independent Retrieval of Printed Documents without OCR -- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems.
520			_aThis book constitutes the refereed proceedings of the 16th String Processing and Information Retrieval Symposium, SPIRE 2009 held in Saariselkä, Finland in August 2009. The 34 revised full papers were carefully reviewed and selected from 84 submissions. The papers are organized in topical sections on algorithms on trees, compressed indexes, compression, indexing, content analysis, string algorithms and bioinformatics, string algorithms and theory, and using and understanding usage.
650		0	_aInformation storage and retrieval systems.
650		0	_aComputer programming.
650		0	_aData mining.
650		0	_aArtificial intelligence _xData processing.
650		0	_aData structures (Computer science).
650		0	_aInformation theory.
650		0	_aComputer science _xMathematics.
650	1	4	_aInformation Storage and Retrieval.
650	2	4	_aProgramming Techniques.
650	2	4	_aData Mining and Knowledge Discovery.
650	2	4	_aData Science.
650	2	4	_aData Structures and Information Theory.
650	2	4	_aSymbolic and Algebraic Manipulation.
700	1		_aKarlgren, Jussi. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aTarhio, Jorma. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aHyyrö, Heikki. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783642037832
776	0	8	_iPrinted edition: _z9783642037856
830		0	_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5721
856	4	0	_uhttps://doi.org/10.1007/978-3-642-03784-9
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c183366 _d183366