|
|
|
|
LEADER |
05462nam a2200613 4500 |
001 |
978-3-540-30213-1 |
003 |
DE-He213 |
005 |
20191026081036.0 |
007 |
cr nn 008mamaa |
008 |
121227s2004 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540302131
|9 978-3-540-30213-1
|
024 |
7 |
|
|a 10.1007/b100941
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.9.D35
|
050 |
|
4 |
|a Q350-390
|
072 |
|
7 |
|a UMB
|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
|
245 |
1 |
0 |
|a String Processing and Information Retrieval
|h [electronic resource] :
|b 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings /
|c edited by Alberto Apostolico, Massimo Melucci.
|
250 |
|
|
|a 1st ed. 2004.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2004.
|
300 |
|
|
|a XIV, 334 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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3246
|
505 |
0 |
|
|a Efficient One Dimensional Real Scaled Matching -- Linear Time Algorithm for the Longest Common Repeat Problem -- Automaton-Based Sublinear Keyword Pattern Matching -- Techniques for Efficient Query Expansion -- Inferring Query Performance Using Pre-retrieval Predictors -- A Scalable System for Identifying Co-derivative Documents -- Searching for a Set of Correlated Patterns -- Linear Nondeterministic Dawg String Matching Algorithm (Abstract) -- Permuted and Scaled String Matching -- Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS -- A New Feature Normalization Scheme Based on Eigenspace for Noisy Speech Recognition -- Fast Detection of Common Sequence Structure Patterns in RNAs -- An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem -- Automatic Document Categorization Based on k-NN and Object-Based Thesauri -- Indexing Text Documents Based on Topic Identification -- Cross-Comparison for Two-Dimensional Text Categorization -- DDOC: Overlapping Clustering of Words for Document Classification -- Evaluation of Web Page Representations by Content Through Clustering -- Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays -- Information Extraction by Embedding HMM to the Set of Induced Linguistic Features -- Finding Cross-Lingual Spelling Variants -- An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size -- An Alphabet-Friendly FM-Index -- Concurrency Control and I/O-Optimality in Bulk Insertion -- Processing Conjunctive and Phrase Queries with the Set-Based Model -- Metric Indexing for the Vector Model in Text Retrieval -- Negations and Document Length in Logical Retrieval -- An Improvement and an Extension on the Hybrid Index for Approximate String Matching -- First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index -- Metric Indexes for Approximate String Matching in a Dictionary -- Simple Implementation of String B-Trees -- Alphabet Permutation for Differentially Encoding Text -- A Space-Saving Linear-Time Algorithm for Grammar-Based Compression -- Simple, Fast, and Efficient Natural Language Adaptive Compression -- Searching XML Documents Using Relevance Propagation -- Dealing with Syntactic Variation Through a Locality-Based Approach -- Efficient Extraction of Structured Motifs Using Box-Links -- Efficient Computation of Balancedness in Binary Sequence Generators -- On Asymptotic Finite-State Error Repair -- New Algorithms for Finding Monad Patterns in DNA Sequences -- Motif Extraction from Weighted Sequences -- Longest Motifs with a Functionally Equivalent Central Block -- On the Transformation Distance Problem -- On Classification of Strings.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Information storage and retrieval.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Database management.
|
650 |
|
0 |
|a Coding theory.
|
650 |
|
0 |
|a Information theory.
|
650 |
1 |
4 |
|a Data Structures and Information Theory.
|0 http://scigraph.springernature.com/things/product-market-codes/I15009
|
650 |
2 |
4 |
|a Information Storage and Retrieval.
|0 http://scigraph.springernature.com/things/product-market-codes/I18032
|
650 |
2 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
650 |
2 |
4 |
|a Database Management.
|0 http://scigraph.springernature.com/things/product-market-codes/I18024
|
650 |
2 |
4 |
|a Data Structures.
|0 http://scigraph.springernature.com/things/product-market-codes/I15017
|
650 |
2 |
4 |
|a Coding and Information Theory.
|0 http://scigraph.springernature.com/things/product-market-codes/I15041
|
700 |
1 |
|
|a Apostolico, Alberto.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Melucci, Massimo.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662178041
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540232100
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3246
|
856 |
4 |
0 |
|u https://doi.org/10.1007/b100941
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|