LEADER 07297nam 22008055 450 001 9910144031803321 005 20200702131411.0 010 $a3-540-39984-4 024 7 $a10.1007/b14038 035 $a(CKB)1000000000212218 035 $a(SSID)ssj0000326970 035 $a(PQKBManifestationID)11297557 035 $a(PQKBTitleCode)TC0000326970 035 $a(PQKBWorkID)10298437 035 $a(PQKB)10503493 035 $a(DE-He213)978-3-540-39984-1 035 $a(MiAaPQ)EBC3087841 035 $a(PPN)155170813 035 $a(EXLCZ)991000000000212218 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aString Processing and Information Retrieval $e10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings /$fedited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (CCCXCVI, 384 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2857 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20177-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Papers -- Patterns on the Web -- Current Challenges in Bioinformatics -- Web Algorithms -- What?s Changed? Measuring Document Change in Web Crawling for Search Engines -- Link Information as a Similarity Measure in Web Classification -- A Three Level Search Engine Index Based in Query Log Distribution -- Bit-Parallel Algorithms -- Row-wise Tiling for the Myers? Bit-Parallel Approximate String Matching Algorithm -- Alternative Algorithms for Bit-Parallel String Matching -- Bit-Parallel Approximate String Matching Algorithms with Transposition -- Compression -- Processing of Huffman Compressed Texts with a Super-Alphabet -- (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases -- Linear-Time Off-Line Text Compression by Longest-First Substitution -- SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases -- Categorization and Ranking -- Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model -- An Empirical Comparison of Text Categorization Methods -- Improving Text Retrieval in Medical Collections Through Automatic Categorization -- Music Retrieval -- A Bit-Parallel Suffix Automaton Approach for (?,?)-Matching in Music Retrieval -- Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval -- Multilingual Information Retrieval -- FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm -- Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants -- The Implementation and Evaluation of a Lexicon-Based Stemmer -- French Noun Phrase Indexing and Mining for an Information Retrieval System -- Subsequences and Distributed Algorithms -- New Refinement Techniques for Longest Common Subsequence Algorithms -- The Size of Subsequence Automaton -- Distributed Query Processing Using Suffix Arrays -- Algorithms on Strings and Trees -- BFT: Bit Filtration Technique for Approximate String Join in Biological Databases -- A Practical Index for Genome Searching -- Using WordNet for Word Sense Disambiguation to Support Concept Map Construction -- Memory-Adaptative Dynamic Spatial Approximation Trees -- Large Edit Distance with Multiple Block Operations. 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 10th International Symposium on String Processing and Information Retrieval, SPIRE 2003, held in Manaus, Brazil. SPIRE 2003 received 54 full submissions from 17 countries, namely: - gentina(2), Australia(2), Brazil(9),Canada(1),Chile (4),Colombia(2),Czech Republic (1), Finland (10), France (1), Japan (2), Korea (5), Malaysia (1), P- tugal (2), Spain (6), Turkey (1), UK (1), USA (4) ? the numbers in parentheses indicate the number of submissions from that country. In the nontrivial task of selecting the papers to be published in these proceedings we were fortunate to count on a very international program committee with 43 members, represe- ing all continents but one. These people, in turn, used the help of 40 external referees. During the review processall but a few papers had four reviewsinstead of the usual three, and at the end 21 submissions were accepted to be p- lished as full papers, yielding an acceptance rate of about 38%. An additional set of six short papers was also accepted. The technical program spans over the two well-de?ned scopes of SPIRE (string processing and information retrieval) with a number of papers also focusing on important application domains such as bioinformatics. SPIRE 2003 also features two invited speakers: Krishna Bharat (Google, Inc. ) and Joa ?o Meidanis (State Univ. of Campinas and Scylla Bioinformatics). 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2857 606 $aSoftware engineering 606 $aInformation storage and retrieval 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aDatabase management 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024 615 0$aSoftware engineering. 615 0$aInformation storage and retrieval. 615 0$aData structures (Computer science). 615 0$aAlgorithms. 615 0$aDatabase management. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aInformation Storage and Retrieval. 615 24$aData Structures. 615 24$aData Structures and Information Theory. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDatabase Management. 676 $a005.74 702 $aNascimento$b Mario A$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMoura$b Edleno S. de$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOliveira$b Arlindo L$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSPIRE 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144031803321 996 $aString Processing and Information Retrieval$92569423 997 $aUNINA