This book constitutes the refereed proceedings of the 12th International Conference on String Processing and Information Retrieval, SPIRE 2005, held in Buenos Aires, Argentina in November 2005.
The 27 revised full papers and 17 revised short papers presented were carefully reviewed and selected from 102 submissions. The papers address current issues in all aspects of string processing, information retrieval, pattern matching, computational biology, semi-structured data, and related applications.
Author(s): J. Shane Culpepper, Alistair Moffat (auth.), Mariano Consens, Gonzalo Navarro (eds.)
Series: Lecture Notes in Computer Science 3772 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005
Language: English
Pages: 410
Tags: Information Storage and Retrieval; Artificial Intelligence (incl. Robotics); Database Management; Data Structures; Algorithm Analysis and Problem Complexity
Front Matter....Pages -
Enhanced Byte Codes with Restricted Prefix Properties....Pages 1-12
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences....Pages 13-24
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups....Pages 25-28
XML Retrieval with a Natural Language Interface....Pages 29-40
Recommending Better Queries from Click-Through Data....Pages 41-44
A Bilingual Linking Service for the Web....Pages 45-48
Evaluating Hierarchical Clustering of Search Results....Pages 49-54
Counting Suffix Arrays and Strings....Pages 55-66
Towards Real-Time Suffix Tree Construction....Pages 67-78
Rank-Sensitive Data Structures....Pages 79-90
Cache-Conscious Collision Resolution in String Hash Tables....Pages 91-102
Measuring the Difficulty of Distance-Based Indexing....Pages 103-114
N -Gram Similarity and Distance....Pages 115-126
Using the k -Nearest Neighbor Graph for Proximity Searching in Metric Spaces....Pages 127-138
Classifying Sentences Using Induced Structure....Pages 139-150
Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity....Pages 151-154
Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity....Pages 155-160
Lydia: A System for Large-Scale News Analysis....Pages 161-166
Composite Pattern Discovery for PCR Application....Pages 167-178
Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array....Pages 179-190
Linear Time Algorithm for the Generalised Longest Common Repeat Problem....Pages 191-201
Application of Clustering Technique in Multiple Sequence Alignment....Pages 202-205
Stemming Arabic Conjunctions and Prepositions....Pages 206-217
XML Multimedia Retrieval....Pages 218-223
Retrieval Status Values in Information Retrieval Evaluation....Pages 224-227
A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting....Pages 228-233
Necklace Swap Problem for Rhythmic Similarity Measures....Pages 234-245
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata....Pages 246-255
Restricted Transposition Invariant Approximate String Matching Under Edit Distance....Pages 256-266
Fast Plagiarism Detection System....Pages 267-270
A Model for Information Retrieval Based on Possibilistic Networks....Pages 271-282
Comparison of Representations of Multiple Evidence Using a Functional Framework for IR....Pages 283-294
Deriving TF-IDF as a Fisher Kernel....Pages 295-300
Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem....Pages 301-314
Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty....Pages 315-326
L 1 Pattern Matching Lower Bound....Pages 327-330
Approximate Matching in the L ∞ Metric....Pages 331-334
An Edit Distance Between RNA Stem-Loops....Pages 335-347
A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison....Pages 348-359
Normalized Similarity of RNA Sequences....Pages 360-369
A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees....Pages 370-375
Practical and Optimal String Matching....Pages 376-387
A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC’s....Pages 388-398
A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching....Pages 399-404
Back Matter....Pages -
