Order and disorder in fiction labyrinths: the librarians` representations in some contemporary cultural productions

This paper, first result of a larger research, proposes a query about some aspects of social representation of libraries and librarians, as they appear in literary and cinematographic productions. Little by little, this query, which arose from purposes of organizing catalogues, revealed elements that established different series, in which the narrative genre (literary or cinematographic) has no relevance to either libraries or librarians` representations. The presence of these elements seems to show some expectations and utopias in relation to the common knowledge, independently from narratives being located in the past, in the present or in the future, stimulating reflection on some medieval and baroque traditions about the library universe and its main characters, the librarians. The cinematographic material selected for research was The time machine, Farenheit 451, The day after tomorrow, Star Wars - episode II and the novels Martin Eden, The man without qualities, The time machine and La sombra del viento.

An all-substrings common subsequence algorithm

Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.