String Processing and Information Retrieval字符串处理与信息检索：SPIRE 2005/会议录

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.

The LNAI series reports state-of-the-art results in artificial intelligence re-search， development， and education， at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community， with numerous individuals， as well as with prestigious organizations and societies，LNAI has grown into the most comprehensive artificial intelligence research forum available.
The scope of LNAI spans the whole range of artificial intelligence and intelli-gent information processing including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on PhD work）.

String Processing and Inromation Retrieval 2005
Enhanced Byte Codes with Restricted Prefix Porperties
J.Shane Culpepper, Alistair Moffat
Experimental Analysis of a Fast Intersection Algorithm for Srted Sequences
Ricardo Baeza-Yates, Alejandro Salinger
Compressed Perfect Embedded Skip Lists for Quick Liverted-Index Lookups
Paolo Boldi, Sebastiano Vigna
XML Rrtrieval with a Natural Languge Interface
Xavier Tannir, Shlomo Geva
Recommending Btter Queries from Click-Through Data
Georges Dupret, Marcelo Mendoza
A Bilingual Lingking Service for the Wed
Alessandra Alaniz Macedo, Jose Antonio Camacho-Gureero, Maria da Graca Campos Pimentel
Evaluting Hierarchical Clustering of Search Results
Juan M. Cigarran, Anselmo penas, Julio Gonzalo, Felisa Verdejo
Counting SUffx Arrays and Strings
Klaus-Bernd Schiirmann, Jens Stoye
Twards Real-Time Suffixe Tree Construction
Amihood Amir, Tsui Kopelowitz, Moshe Lewenstein, Nao Lewenstein
Rank-Sensitive Data Structures
Iwona Bialynicka-Birula, Robreto Grossi
Cache-Conscious Collision Resolution in String Hash Tables
Nikolas Askitis, Justin Zobel
Measuring the Difficulty of Distance-Based Indexing
Matthew Skala
N-Gram Sinilarity and Distance
Using the K-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Claaifying 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-Scal News Analysis
Composite pattern Discovery for PCR Application
Lossless Filter for Finding Long Multiple Approxymate Repetitions Using a New Data Structure, the Bi-factor Array
Linear Time Algorithm for the Generalised Longest Common Repeat Problem
Appilcation of Clustering Technique in Multiple Sequence Alingnment
Stemming Aranic Conjunctons and Prepositions
XML Multimedia Rtrieval
Retrieval Status Values in Information Rtrieval Evaluation
……
Author Index