Luís M. S. Russo

Learn More
Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like bioinformatics and information retrieval. Classical representations of suffix trees require &Theta;(<i>n</i> log <i>n</i>) bits of space, for a string of size <i>n</i>. This is considerably more than the <i>n</i> log<sub>2</sub> &sigma;(More)
Cranial magnetic resonance (MR) imaging was performed on eight consecutive patients with generalized tonic-clonic seizures caused by eclampsia. Each patient underwent serial neurologic examinations until all symptoms resolved. Six of those eight patients underwent follow-up MR imaging. These patients were compared with those in previous case reports of MR(More)
A compressed full-text self-index for a text T , of size u, is a data structure used to search patterns P , of size m, in T that requires reduced space, i.e. that depends on the empirical entropy (H k , H0) of T , and is, furthermore, able to reproduce any substring of T. In this paper we present a new compressed self-index able to locate the occurrences of(More)
The dialysis encephalopathy syndrome (DES) consists of altered mental status, communication difficulty, seizures and myoclonus. It has been attributed to elevated serum aluminium (A1) levels. Two undialysed patients with chronic renal failure who presented with the characteristic syndrome are reported. The first, a 48 year old female, had used A1 containing(More)
To determine the usefulness of cranial computed tomography (CCT) in adults with a single seizure, we prospectively examined 62 such patients who were initially seen within 24 hours of the event. Age range was 16 to 86 years. Seizure was partial in ten patients and generalized in 52. Neurologic examination results were abnormal in 28 and normal in 34.(More)
Suffix trees are by far the most important data structure in stringology, with myriads of applications in fields like bioinformatics, data compression and information retrieval. Classical representations of suffix trees require O(n log n) bits of space, for a string of size n. This is considerably more than the n log 2 σ bits needed for the string itself,(More)