000			04987nam a22006015i 4500
001			978-3-642-03784-9
003			DE-He213
005			20160624102134.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	_aQA76.9.D343
072		7	_aUNF _2bicssc
072		7	_aUYQE _2bicssc
072		7	_aCOM021030 _2bisacsh
082	0	4	_a006.312 _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ö.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _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		_aLecture Notes in Computer Science, _x0302-9743 ; _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 and Theory 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	_aComputer science.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aAlgebra _xData processing.
650		0	_aData mining.
650		0	_aOptical pattern recognition.
650	1	4	_aComputer Science.
650	2	4	_aData Mining and Knowledge Discovery.
650	2	4	_aData Structures.
650	2	4	_aData Structures, Cryptology and Information Theory.
650	2	4	_aSymbolic and Algebraic Manipulation.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aPattern Recognition.
700	1		_aKarlgren, Jussi. _eeditor.
700	1		_aTarhio, Jorma. _eeditor.
700	1		_aHyyrö, Heikki. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642037832
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v5721
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-03784-9
942			_2EBK8701 _cEBK
999			_c37995 _d37995