Learn More
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Examples of such collections are version control data and genome sequences of individuals, where the differences can be expressed by lists of basic edit operations. Flexible and(More)
SUMMARY XML documents consist of text data plus structured data (markup). XPath allows to query both, text and structure. Evaluating such hybrid queries is challenging. We present a system for in-memory evaluation of XPath search queries, that is, queries with text and structure predicates, yet without advanced features such as backward axes, arithmetics,(More)
Document retrieval aims at finding the most important documents where a pattern appears in a collection of strings. Traditional pattern-matching techniques yield brute-force document retrieval solutions , which has motivated the research on tailored indexes that offer near-optimal performance. However, an experimental study establishing which alternatives(More)
A repetitive sequence collection is a set of sequences which are small variations of each other. A prominent example are genome sequences of individuals of the same or close species, where the differences can be expressed by short lists of basic edit operations. Flexible and efficient data analysis on such a typically huge collection is plausible using(More)
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Examples of such collections are version control data and genome sequences of individuals, where the differences can be expressed by lists of basic edit operations. This paper is devoted(More)
BACKGROUND Laparoscopic cholecystectomy (LC) has become the treatment of choice for elective cholecystectomy, but controversy persists over use of this approach in the treatment of acute cholecystitis. We undertook a randomised comparison of the safety and outcome of LC and open cholecystectomy (OC) in patients with acute cholecystitis. METHODS 63 of 68(More)
We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA). The algorithm requires O(n log n) time in the worst case, and only O(n) bits of extra space in addition to the CSA. As the basic step, we describe an algorithm for merging two CSAs. We show that the construction algorithm can be parallelized in a symmetric(More)
Nine immunocompetent patients with acute herpes zoster encephalitis (HZE) were studied with the help of neurological investigations. All patients were treated with acyclovir. Neuropsychological performance was compared with that of a group of 16 healthy controls. Computed tomography of the head showed infarct-like hypodense lesions in two patients,(More)
Many document collections consist largely of repeated material , and several indexes have been designed to take advantage of this. There has been only preliminary work, however, on document retrieval for repetitive collections. In this paper we show how one of those indexes, the run-length compressed suffix array (RLCSA), can be extended to support document(More)
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicates can efficiently be implemented using a compressed self-index of the document's text nodes. Most queries, however, contain some parts of querying the text of the document, plus(More)