Special issue on string processing and information retrieval

Alberto H.F. Laender, Arlindo L. Oliveira
2004 Journal of Discrete Algorithms  
Editorial Special issue on string processing and information retrieval We are pleased to bring you this special issue of the Journal of Discrete Algorithms based upon a set of selected papers presented at the 9th International Symposium on String Processing and Information Retrieval, SPIRE 2002, which was held in Lisbon, Portugal, on 11-13 September 2002. SPIRE has its origins in the South American Workshop on String Processing which was first held in Belo Horizonte, Brazil, in 1993. Starting
more » ... 1998, the focus of the symposium was broadened to include the area of information retrieval due to its increasing relevance and its inter-relationship with the area of string processing. This special issue includes four of the best papers presented at the symposium which were selected based on the technical value of their contributions and the interest of these contributions for readers of this journal. Each one of them is an extended and revised version of the symposium original paper and went through a careful reviewing process, before being accepted for inclusion in this special issue. In addition, this special issue also includes two invited papers which, together with the four selected ones, give a clear view of some of the current issues being addressed in the areas of string processing and information retrieval. Algorithms for string processing have historically been of great theoretical and practical importance. The applications of the techniques described in the contributions in this special issue range from bioinformatics to information retrieval and XML data management. The first invited paper, Some string matching problems from Bioinformatics which still need better solutions by Gaston Gonnet, surveys the application area of bioinformatics and draws a map of open, interesting, problems in this field. The second invited paper, From Searching Text to Querying XML Streams by Dan Suciu, addresses applications in XML stream querying, a very actual and high impact topic. One of the most important data structures used in string processing is the suffix tree. The paper by Inenaga et al., Compact Directed Acyclic Word Graphs for a Sliding Window, proposes an improvement to suffix graphs, an evolution of suffix trees, that makes it possible to maintain a suffix graph for a sliding window. The paper by Abouelhoda, Ohlebusch, and Kurtz, Replacing suffix trees with enhanced suffix arrays, also proposes an improvement for suffix arrays, a space effective variation of suffix trees, that, when applied, yields a very effective data structure for string manipulation.
doi:10.1016/s1570-8667(03)00061-3 fatcat:kjny7bnihjbd7jeflulberauzu