LEADER 06351nam 22007935 450 001 9910143891903321 005 20200706212342.0 010 $a3-540-45735-6 024 7 $a10.1007/3-540-45735-6 035 $a(CKB)1000000000211863 035 $a(SSID)ssj0000326969 035 $a(PQKBManifestationID)11263388 035 $a(PQKBTitleCode)TC0000326969 035 $a(PQKBWorkID)10297819 035 $a(PQKB)10217614 035 $a(DE-He213)978-3-540-45735-0 035 $a(MiAaPQ)EBC3071633 035 $a(PPN)155236369 035 $a(EXLCZ)991000000000211863 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aString Processing and Information Retrieval $e9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings /$fedited by Alberto H.F. Laender, Arlindo L. Oliveira 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XII, 344 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2476 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-44158-1 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives -- From Searching Text to Querying XML Streams -- String Matching Problems from Bioinformatics Which Still Need Better Solutions -- String Matching -- Optimal Exact String Matching Based on Suffix Arrays -- Faster String Matching with Super-Alphabets -- On the Size of DASG for Multiple Texts -- String Processing -- Sorting by Prefix Transpositions -- Efficient Computation of Long Similar Subsequences -- Stemming Galician Texts -- Firing Policies for an Arabic Rule-Based Stemmer -- Web Ranking and Link Analysis -- Enhancing the Set-Based Model Using Proximity Information -- Web Structure, Dynamics and Page Quality -- A Theoretical Analysis of Google?s PageRank -- Machine Learning Approach for Homepage Finding Task -- Pattern Matching -- Tree Pattern Matching for Linear Static Terms -- Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts -- Pattern Matching over Multi-attribute Data Streams -- Digital Libraries and Applications -- Java MARIAN: From an OPAC to a Modern Digital Library System -- A Framework for Generating Attribute Extractors for Web Data Sources -- Multiple Example Queries in Content-Based Image Retrieval -- Focussed Structured Document Retrieval -- Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms -- Approximate Searching -- Fully Dynamic Spatial Approximation Trees -- String Matching with Metric Trees Using an Approximate Distance -- Probabilistic Proximity Searching Algorithms Based on Compact Partitions -- Indexing Techniques -- t-Spanners as a Data Structure for Metric Space Searching -- Compact Directed Acyclic Word Graphs for a Sliding Window -- Indexing Text Using the Ziv-Lempel Trie. 330 $aThis volume of the Lecture Notes in Computer Science series provides a c- prehensive, state-of-the-art survey of recent advances in string processing and information retrieval. It includes invited and research papers presented at the 9th International Symposium on String Processing and Information Retrieval, SPIRE2002, held in Lisbon, Portugal. SPIREhas its origins in the South Am- ican Workshop on String Processing which was ?rst held in Belo Horizonte, Brazil, in 1993. Starting in 1998, the focus of the workshop was broadened to include the area of information retrieval due to its increasing relevance and its inter-relationship with the area of string processing. The call for papers for SPIRE2002 resulted in the submission of 54 papers from researchers around the world. Of these, 19 were selected for inclusion in the program (an acceptance rate of 35%). In addition, the Program Committee decided to accept six other papers, considered as describing interesting ongoing research, in the form of short papers. The authors of these 25 papers came from 18 di?erent countries (Argentina, Australia, Brazil, Canada, Czech Republic, Chile, Colombia, Finland, France, Germany, Japan, Italy, Mexico, Saudi Arabia, Switzerland, Spain, United Kingdom, and USA). 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2476 606 $aDatabase management 606 $aInformation storage and retrieval 606 $aAlgorithms 606 $aArtificial intelligence 606 $aData structures (Computer science) 606 $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aDatabase management. 615 0$aInformation storage and retrieval. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aData structures (Computer science). 615 14$aDatabase Management. 615 24$aInformation Storage and Retrieval. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aArtificial Intelligence. 615 24$aData Structures and Information Theory. 615 24$aData Structures. 676 $a005 702 $aLaender$b Alberto H.F$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOliveira$b Arlindo L$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSPIRE 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143891903321 996 $aString Processing and Information Retrieval$92569423 997 $aUNINA