String processing and information retrieval. 11th international conference, SPIRE 2004, Padova, Italy, October 5--8, 2004. Proceedings.
The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1028.00032). Indexed articles: \textit{Amir, Amihood; Butman, Ayelet; Lewenstein, Moshe; Porat, Ely; Tsur, Dekel}, Efficient one dimensional real scaled matching, 1-9 [Zbl 1111.68754] \textit{Lee, Inbok; Iliopoulos, Costas S.; Park, Kunsoo}, Linear time algorithm for the longest common repeat problem, 10-17 [Zbl 1111.68772] \textit{Cleophas, Loek; Watson, Bruce W.; Zwaan, Gerard}, Automaton-based sublinear keyword pattern matching, 18-29 [Zbl 1111.68428] \textit{Billerbeck, Bodo; Zobel, Justin}, Techniques for efficient query expansion, 30-42 [Zbl 1111.68425] \textit{He, Ben; Ounis, Iadh}, Inferring query performance using pre-retrieval predictors, 43-54 [Zbl 1111.68433] \textit{Bernstein, Yaniv; Zobel, Justin}, A scalable system for identifying co-derivative documents, 55-67 [Zbl 1111.68424] \textit{Klein, Shmuel T.; Shalom, Riva}, Searching for a set of correlated patterns, 68-69 [Zbl 1111.68758] \textit{He, Longtao; Fang, Binxing}, Linear nondeterministic dawg string matching algorithm (abstract), 70-71 [Zbl 1111.68757] \textit{Butman, Ayelet; Eres, Revital; Landau, Gad M.}, Permuted and scaled string matching, 72-73 [Zbl 1111.68755] \textit{Lemström, Kjell; Navarro, Gonzalo; Pinzon, Yoan}, Bit-parallel branch and bound algorithm for transposition invariant LCS, 74-75 [Zbl 1111.68761] \textit{Backofen, Rolf; Siebert, Sven}, Fast detection of common sequence structure patterns in RNAs, 79-92 [Zbl 1111.68765] \textit{Kosowski, Adrian}, An efficient algorithm for the longest tandem scattered subsequence problem, 93-100 [Zbl 1111.68759] \textit{Bang, Sun Lee; Yang, Hyung Jeong; Yang, Jae Dong}, Automatic document categorization based on k-NN and object-based thesauri, 101-112 [Zbl 1111.68423] \textit{Butarbutar, Manonton; McRoy, Susan}, Indexing text documents based on topic identification, 113-124 [Zbl 1111.68426] \textit{Kim, Dong Kyue; Jeon, Jeong Eun; Park, Heejin}, An efficient index data structure with the capabilities of suffix trees and suffix arrays for alphabets of non-negligible size, 138-149 [Zbl 1111.68435] \textit{Ferragina, Paolo; Manzini, Giovanni; Mäkinen, Veli; Navarro, Gonzalo}, An alphabet-friendly FM-index, 150-160 [Zbl 1111.68429] \textit{Pollari-Malmi, Kerttu; Soisalon-Soininen, Eljas}, Concurrency control and I/O-optimality in bulk insertion, 161-170 [Zbl 1111.68439] \textit{Pôssas, Bruno; Ziviani, Nivio; Ribeiro-Neto, Berthier; Meira, Wagner jun.}, Processing conjunctive and phrase queries with the set-based model, 171-182 [Zbl 1111.68440] \textit{Skopal, Tomáš; Moravec, Pavel; Pokorný, Jaroslav; Snášel, Václav}, Metric indexing for the vector model in text retrieval, 183-195 [Zbl 1111.68442] \textit{Losada, David E.; Barreiro, Alvaro}, Negations and document length in logical retrieval, 196-207 [Zbl 1111.68437] \textit{Hyyrö, Heikki}, An improvement and an extension on the hybrid index for approximate string matching, 208-209 [Zbl 1111.68434] \textit{Grabowski, Szymon; Mäkinen, Veli; Navarro, Gonzalo}, First Huffman, then Burrows-Wheeler: A simple alphabet-independent FM-index, 210-211 [Zbl 1111.68432] \textit{Fredriksson, Kimmo}, Metric indexes for approximate string matching in a dictionary, 212-213 [Zbl 1111.68756] \textit{Na, Joong Chae; Park, Kunsoo}, Simple implementation of String B-trees, 214-215 [Zbl 1111.68438] \textit{Landau, Gad M.; Levi, Ofer; Skiena, Steven}, Alphabet permutation for differentially encoding text, 216-217 [Zbl 1111.68760] \textit{Sakamoto, Hiroshi; Kida, Takuya; Shimozono, Shinichi}, A space-saving linear-time algorithm for grammar-based compression, 218-229 [Zbl 1111.68486] \textit{Brisaboa, Nieves R.; Fariña, Antonio; Navarro, Gonzalo; Paramá, José R.}, Simple, fast, and efficient natural language adaptive compression, 230-241 [Zbl 1111.68718] \textit{Sauvagnat, Karen; Boughanem, Mohand; Chrisment, Claude}, Searching XML documents using relevance propagation, 242-254 [Zbl 1111.68441] \textit{Vilares, Jesús; Alonso, Miguel A.}, Dealing with syntactic variation through a locality-based approach, 255-266 [Zbl 1111.68443] \textit{Carvalho, Alexandra M.; Freitas, Ana T.; Oliveira, Arlindo L.; Sagot, Marie-France}, Efficient extraction of structured motifs using box-links, 267-268 [Zbl 1111.68404] \textit{García-Mochales, Pedro; Fúster-Sabater, Amparo}, Efficient computation of balancedness in binary sequence generators, 269-270 [Zbl 1111.94330] \textit{Satya, Ravi Vijaya; Mukherjee, Amar}, New algorithms for finding monad patterns in DNA sequences, 273-285 [Zbl 1111.68773] \textit{Iliopoulos, Costas S.; Perdikuri, Katerina; Theodoridis, Evangelos; Tsakalidis, Athanasios; Tsichlas, Kostas}, Motif extraction from weighted sequences, 286-297 [Zbl 1111.68770] \textit{Crochemore, Maxime; Giancarlo, Raffaele; Sagot, Marie-France}, Longest motifs with a functionally equivalent central block, 298-309 [Zbl 1111.68768] \textit{Behzadi, Behshad; Steyaert, Jean-Marc}, On the transformation distance problem, 310-320 [Zbl 1111.68766] \textit{Soisalon-Soininen, Eljas; Ylönen, Tatu}, On classification of strings, 321-330 [Zbl 1111.68489]
scientific article; zbMATH DE number 2135268