000 04026nam a22006735i 4500
001 978-3-540-75530-2
003 DE-He213
005 20240730181650.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540755302
_9978-3-540-75530-2
024 7 _a10.1007/978-3-540-75530-2
_2doi
050 4 _aQA76.9.D35
050 4 _aQ350-390
072 7 _aUMB
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM021000
_2bisacsh
072 7 _aUMB
_2thema
072 7 _aGPF
_2thema
082 0 4 _a005.73
_223
082 0 4 _a003.54
_223
245 1 0 _aString Processing and Information Retrieval
_h[electronic resource] :
_b14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings /
_cedited by Nivio Ziviani, Ricardo Baeza-Yates.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXII, 311 p.
_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 ;
_v4726
505 0 _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.
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aData mining.
_93907
650 0 _aArtificial intelligence.
_93407
650 0 _aDatabase management.
_93157
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aCoding theory.
_94154
650 1 4 _aData Structures and Information Theory.
_931923
650 2 4 _aData Mining and Knowledge Discovery.
_9125705
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aDatabase Management.
_93157
650 2 4 _aData Science.
_934092
650 2 4 _aCoding and Information Theory.
_9125706
700 1 _aZiviani, Nivio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9125707
700 1 _aBaeza-Yates, Ricardo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9125708
710 2 _aSpringerLink (Online service)
_9125709
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540755296
776 0 8 _iPrinted edition:
_z9783540844808
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4726
_9125710
856 4 0 _uhttps://doi.org/10.1007/978-3-540-75530-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91013
_d91013