000 05855nam a22006495i 4500
001 978-3-642-16321-0
003 DE-He213
005 20240730192922.0
007 cr nn 008mamaa
008 101005s2010 gw | s |||| 0|eng d
020 _a9783642163210
_9978-3-642-16321-0
024 7 _a10.1007/978-3-642-16321-0
_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] :
_b17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings /
_cedited by Edgar Chavez, Stefano Lonardi.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIV, 408 p. 81 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 ;
_v6393
505 0 _aCrowdsourcing and Recommendation -- Querying the Web Graph -- Incremental Algorithms for Effective and Efficient Query Recommendation -- Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis -- On Tag Spell Checking -- Indexes and Compressed Indexes -- Compressed Self-indices Supporting Conjunctive Queries on Document Collections -- String Retrieval for Multi-pattern Queries -- Colored Range Queries and Document Retrieval -- Range Queries over Untangled Chains -- Theory -- Multiplication Algorithms for Monge Matrices -- Why Large Closest String Instances Are Easy to Solve in Practice -- A PTAS for the Square Tiling Problem -- On the Hardness of Counting and Sampling Center Strings -- String Algorithms I -- Counting and Verifying Maximal Palindromes -- Identifying SNPs without a Reference Genome by Comparing Raw Reads -- Dynamic Z-Fast Tries -- Improved Fast Similarity Search in Dictionaries -- Compression -- Training Parse Trees for Efficient VF Coding -- Algorithms for Finding a Minimum Repetition Representation of a String -- Faster Compressed Dictionary Matching -- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval -- Querying and Search User Experience -- Standard Deviation as a Query Hardness Estimator -- Using Related Queries to Improve Web Search Results Ranking -- Evaluation of Query Performance Prediction Methods by Range -- Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy -- String Algorithms II -- Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems -- Restricted LCS -- Extracting Powers and Periods in a String from Its Runs Structure -- On Shortest Common Superstring and Swap Permutations -- Document Analysis and Comparison -- A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles -- Temporal Analysis of Document Collections: Framework and Applications -- Text Comparison Using Soft Cardinality -- Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval -- Compressed Indexes -- Dual-Sorted Inverted Lists -- CST++ -- Succinct Representations of Dynamic Strings -- Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes -- The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching -- String Matching -- Parameterized Searching with Mismatches for Run-Length Encoded Strings -- Fast Bit-Parallel Matching for Network and Regular Expressions -- String Matching with Variable Length Gaps -- Approximate String Matching with Stuck Address Bits -- Erratum -- Erratum to: Range Queries over Untangled Chains.
520 _aThis book constitutes the proceedings of the 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010, held in Los Cabos, Mexico, in October 2010. The 26 long and 13 short papers presented were carefully reviewed and selected from 109 submissions. The volume also contains 2 invited talks. The papers are structured in topical sections on crowdsourcing and recommendation; indexes and compressed indexes; theory; string algorithms; compressions; querying and search user experience; document analysis and comparison; compressed indexes; and string matching.
650 0 _aInformation storage and retrieval systems.
_922213
650 0 _aBioinformatics.
_99561
650 0 _aData mining.
_93907
650 0 _aDatabase management.
_93157
650 0 _aPattern recognition systems.
_93953
650 0 _aMultimedia systems.
_911575
650 1 4 _aInformation Storage and Retrieval.
_923927
650 2 4 _aComputational and Systems Biology.
_931619
650 2 4 _aData Mining and Knowledge Discovery.
_9151789
650 2 4 _aDatabase Management.
_93157
650 2 4 _aAutomated Pattern Recognition.
_931568
650 2 4 _aMultimedia Information Systems.
_931575
700 1 _aChavez, Edgar.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151790
700 1 _aLonardi, Stefano.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151791
710 2 _aSpringerLink (Online service)
_9151792
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642163203
776 0 8 _iPrinted edition:
_z9783642163227
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6393
_9151793
856 4 0 _uhttps://doi.org/10.1007/978-3-642-16321-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94504
_d94504