12,981,116 research outputs found
SAGA SERVICE DISCOVERY US E R S GU I D E F O R C+ + P R O G R A M M E R S
The SAGA Service Discovery API provides a way to find grid services matching particular filter
SAGA INFORMATION SYSTEM NAVIGATOR US E R S GU I D E F O R C+ + P R O G R A M M E R S
The SAGA Service Discovery API provides a way to find grid services matching particular filter
A mini-review of TAT-MyoD fused proteins: state of the art and problems to solve.
open6siopenPatruno, M; Melotti L.; Gomiero, C; Sacchetto, R; Topel, O; Martinello, T.Patruno, M; Melotti, Luca; Gomiero, C; Sacchetto, R; Topel, O; Martinello, T
Framed sheaves on projective space and Quot schemes
We prove that, given integers , and , the moduli
space of torsion free sheaves on with Chern character
that are trivial along a hyperplane
is isomorphic to the Quot scheme of -dimensional length quotients of the free sheaf
on .Comment: Minor improvement
Optimal-Time Text Indexing in BWT-runs Bounded Space
Indexing highly repetitive texts --- such as genomic databases, software
repositories and versioned text collections --- has become an important problem
since the turn of the millennium. A relevant compressibility measure for
repetitive texts is , the number of runs in their Burrows-Wheeler Transform
(BWT). One of the earliest indexes for repetitive collections, the Run-Length
FM-index, used space and was able to efficiently count the number of
occurrences of a pattern of length in the text (in loglogarithmic time per
pattern symbol, with current techniques). However, it was unable to locate the
positions of those occurrences efficiently within a space bounded in terms of
. Since then, a number of other indexes with space bounded by other measures
of repetitiveness --- the number of phrases in the Lempel-Ziv parse, the size
of the smallest grammar generating the text, the size of the smallest automaton
recognizing the text factors --- have been proposed for efficiently locating,
but not directly counting, the occurrences of a pattern. In this paper we close
this long-standing problem, showing how to extend the Run-Length FM-index so
that it can locate the occurrences efficiently within space (in
loglogarithmic time each), and reaching optimal time within
space, on a RAM machine of bits. Within
space, our index can also count in optimal time .
Raising the space to , we support count and locate in
and time, which is optimal in the
packed setting and had not been obtained before in compressed space. We also
describe a structure using space that replaces the text and
extracts any text substring of length in almost-optimal time
. (...continues...
- …