My Account Log in

1 option

String Processing and Information Retrieval : 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings / edited by Mariano Consens, Gonzalo Navarro.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Consens, Mariano, editor.
Navarro, Gonzalo, 1969- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3772.
Theoretical Computer Science and General Issues ; 3772
Language:
English
Subjects (All):
Data structures (Computer science).
Information storage and retrieval.
Artificial intelligence.
Database management.
Algorithms.
Data Structures and Information Theory.
Information Storage and Retrieval.
Artificial Intelligence.
Database Management.
Data Structures.
Algorithm Analysis and Problem Complexity.
Local Subjects:
Data Structures and Information Theory.
Information Storage and Retrieval.
Artificial Intelligence.
Database Management.
Data Structures.
Algorithm Analysis and Problem Complexity.
Physical Description:
1 online resource (XIV, 410 pages).
Edition:
First edition 2005.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
System Details:
text file PDF
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-32241-2
9783540322412
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account