LEADER 06161nam 22007935 450 001 996465822103316 005 20230222102748.0 010 $a1-280-38975-3 010 $a9786613567673 010 $a3-642-16321-1 024 7 $a10.1007/978-3-642-16321-0 035 $a(CKB)2550000000019883 035 $a(SSID)ssj0000446805 035 $a(PQKBManifestationID)11299330 035 $a(PQKBTitleCode)TC0000446805 035 $a(PQKBWorkID)10504526 035 $a(PQKB)10696228 035 $a(DE-He213)978-3-642-16321-0 035 $a(MiAaPQ)EBC3065970 035 $a(PPN)149029667 035 $a(EXLCZ)992550000000019883 100 $a20101005d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aString Processing and Information Retrieval$b[electronic resource] $e17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings /$fedited by Edgar Chavez, Stefano Lonardi 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIV, 408 p. 81 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6393 300 $aIncludes bibliographical references and index. 311 $a3-642-16320-3 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6393 606 $aInformation storage and retrieval systems 606 $aBioinformatics 606 $aData mining 606 $aDatabase management 606 $aPattern recognition systems 606 $aMultimedia systems 606 $aInformation Storage and Retrieval 606 $aComputational and Systems Biology 606 $aData Mining and Knowledge Discovery 606 $aDatabase Management 606 $aAutomated Pattern Recognition 606 $aMultimedia Information Systems 615 0$aInformation storage and retrieval systems. 615 0$aBioinformatics. 615 0$aData mining. 615 0$aDatabase management. 615 0$aPattern recognition systems. 615 0$aMultimedia systems. 615 14$aInformation Storage and Retrieval. 615 24$aComputational and Systems Biology. 615 24$aData Mining and Knowledge Discovery. 615 24$aDatabase Management. 615 24$aAutomated Pattern Recognition. 615 24$aMultimedia Information Systems. 676 $a025.04 702 $aChavez$b Edgar$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLonardi$b Stefano$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSPIRE 2010 906 $aBOOK 912 $a996465822103316 996 $aString Processing and Information Retrieval$92569423 997 $aUNISA