000 | 05372nam a22006735i 4500 | ||
---|---|---|---|
001 | 978-3-540-32241-2 | ||
003 | DE-He213 | ||
005 | 20240730192838.0 | ||
007 | cr nn 008mamaa | ||
008 | 100328s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540322412 _9978-3-540-32241-2 |
||
024 | 7 |
_a10.1007/11575832 _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] : _b12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings / _cedited by Mariano Consens, Gonzalo Navarro. |
250 | _a1st ed. 2005. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
300 |
_aXIV, 410 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 ; _v3772 |
|
505 | 0 | _aString Processing and Information Retrieval 2005 -- Enhanced Byte Codes with Restricted Prefix Properties -- Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences -- Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups -- XML Retrieval with a Natural Language Interface -- Recommending Better Queries from Click-Through Data -- A Bilingual Linking Service for the Web -- Evaluating Hierarchical Clustering of Search Results -- Counting Suffix Arrays and Strings -- Towards Real-Time Suffix Tree Construction -- Rank-Sensitive Data Structures -- Cache-Conscious Collision Resolution in String Hash Tables -- Measuring the Difficulty of Distance-Based Indexing -- N-Gram Similarity and Distance -- Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces -- Classifying Sentences Using Induced Structure -- Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity -- Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity -- Lydia: A System for Large-Scale News Analysis -- Composite Pattern Discovery for PCR Application -- Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array -- Linear Time Algorithm for the Generalised Longest Common Repeat Problem -- Application of Clustering Technique in Multiple Sequence Alignment -- Stemming Arabic Conjunctions and Prepositions -- XML Multimedia Retrieval -- Retrieval Status Values in Information Retrieval Evaluation -- A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting -- Necklace Swap Problem for Rhythmic Similarity Measures -- Faster Generation of Super Condensed Neighbourhoods Using Finite Automata -- Restricted Transposition Invariant Approximate String Matching UnderEdit Distance -- Fast Plagiarism Detection System -- A Model for Information Retrieval Based on Possibilistic Networks -- Comparison of Representations of Multiple Evidence Using a Functional Framework for IR -- Deriving TF-IDF as a Fisher Kernel -- Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem -- Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty -- L 1 Pattern Matching Lower Bound -- Approximate Matching in the L ??? Metric -- An Edit Distance Between RNA Stem-Loops -- A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison -- Normalized Similarity of RNA Sequences -- A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees -- Practical and Optimal String Matching -- A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's -- A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching. | |
650 | 0 |
_aData structures (Computer science). _98188 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 0 |
_aInformation storage and retrieval systems. _922213 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aDatabase management. _93157 |
|
650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 1 | 4 |
_aData Structures and Information Theory. _931923 |
650 | 2 | 4 |
_aInformation Storage and Retrieval. _923927 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aDatabase Management. _93157 |
650 | 2 | 4 |
_aData Science. _934092 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
700 | 1 |
_aConsens, Mariano. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9151497 |
|
700 | 1 |
_aNavarro, Gonzalo. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9151498 |
|
710 | 2 |
_aSpringerLink (Online service) _9151499 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540297406 |
776 | 0 | 8 |
_iPrinted edition: _z9783540817314 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3772 _9151500 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11575832 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c94464 _d94464 |