LEADER 04303nam  22007935  450 
001 996465646703316
005 20230406032040.0
010   $a3-540-75530-6
024 7 $a10.1007/978-3-540-75530-2
035   $a(CKB)1000000000491006
035   $a(SSID)ssj0000320229
035   $a(PQKBManifestationID)11244801
035   $a(PQKBTitleCode)TC0000320229
035   $a(PQKBWorkID)10348177
035   $a(PQKB)11153750
035   $a(DE-He213)978-3-540-75530-2
035   $a(MiAaPQ)EBC3068464
035   $a(PPN)123165563
035   $a(EXLCZ)991000000000491006
100   $a20100301d2007      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aString Processing and Information Retrieval$b[electronic resource] $e14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings /$fedited by Nivio Ziviani, Ricardo Baeza-Yates
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (XII, 311 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4726
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-75529-2 
320   $aIncludes bibliographical references and index.
327   $aA Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences -- Edge-Guided Natural Language Text Compression -- Local Transpositions in Alignment of Polyphonic Musical Sequences -- Efficient Computations of ?1 and ???? Rearrangement Distances -- Generalized LCS -- Exploiting Genre in Focused Crawling -- Admission Policies for Caches of Search Engine Results -- A Pocket Guide to Web History -- Jump-Matching with Errors -- Estimating Number of Citations Using Author Reputation -- A Fast and Compact Web Graph Representation -- A Filtering Algorithm for k-Mismatch with Don?t Cares -- Compact Set Representation for Information Retrieval -- Approximate Swap and Mismatch Edit Distance -- Approximating Constrained LCS -- Tuning Approximate Boyer-Moore for Gene Sequences -- Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage -- Indexing a Dictionary for Subset Matching Queries -- Extending Weighting Models with a Term Quality Measure -- Highly Frequent Terms and Sentence Retrieval -- Implicit Compression Boosting with Applications to Self-indexing -- A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees -- Enhancing Educational-Material Retrieval Using Authored-Lesson Metadata -- Approximate String Matching with Lempel-Ziv Compressed Indexes -- Algorithms for Weighted Matching -- Efficient Text Proximity Search -- Prefix-Shuffled Geometric Suffix Tree.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4726
606   $aData structures (Computer science)
606   $aInformation theory
606   $aData mining
606   $aArtificial intelligence
606   $aDatabase management
606   $aArtificial intelligence?Data processing
606   $aCoding theory
606   $aData Structures and Information Theory
606   $aData Mining and Knowledge Discovery
606   $aArtificial Intelligence
606   $aDatabase Management
606   $aData Science
606   $aCoding and Information Theory
615  0$aData structures (Computer science).
615  0$aInformation theory.
615  0$aData mining.
615  0$aArtificial intelligence.
615  0$aDatabase management.
615  0$aArtificial intelligence?Data processing.
615  0$aCoding theory.
615 14$aData Structures and Information Theory.
615 24$aData Mining and Knowledge Discovery.
615 24$aArtificial Intelligence.
615 24$aDatabase Management.
615 24$aData Science.
615 24$aCoding and Information Theory.
676   $a005.52
702   $aZiviani$b Nivio$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aBaeza-Yates$b Ricardo$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aSPIRE 2007
906   $aBOOK
912   $a996465646703316
996   $aString Processing and Information Retrieval$92569423
997   $aUNISA