|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-32241-2 |
| 003 |
DE-He213 |
| 005 |
20230406033941.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100328s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540322412
|9 978-3-540-32241-2
|
| 024 |
7 |
|
|a 10.1007/11575832
|2 doi
|
| 050 |
|
4 |
|a QA76.9.D35
|
| 050 |
|
4 |
|a Q350-390
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a GPF
|2 bicssc
|
| 072 |
|
7 |
|a COM031000
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 072 |
|
7 |
|a GPF
|2 thema
|
| 082 |
0 |
4 |
|a 005.73
|2 23
|
| 082 |
0 |
4 |
|a 003.54
|2 23
|
| 245 |
1 |
0 |
|a String Processing and Information Retrieval
|h [electronic resource] :
|b 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings /
|c edited by Mariano Consens, Gonzalo Navarro.
|
| 250 |
|
|
|a 1st ed. 2005.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2005.
|
| 300 |
|
|
|a XIV, 410 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3772
|
| 505 |
0 |
|
|a String 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 Under Edit 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 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Information theory.
|
| 650 |
|
0 |
|a Information storage and retrieval systems.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Database management.
|
| 650 |
|
0 |
|a Artificial intelligence-Data processing.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
1 |
4 |
|a Data Structures and Information Theory.
|
| 650 |
2 |
4 |
|a Information Storage and Retrieval.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Database Management.
|
| 650 |
2 |
4 |
|a Data Science.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 700 |
1 |
|
|a Consens, Mariano.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Navarro, Gonzalo.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540817314
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540297406
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3772
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11575832
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
