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

    Get PDF
    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

    Get PDF
    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.

    Get PDF
    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

    Get PDF
    We prove that, given integers m3m\geq 3, r1r\geq 1 and n0n\geq 0, the moduli space of torsion free sheaves on Pm\mathbb P^m with Chern character (r,0,,0,n)(r,0,\ldots,0,-n) that are trivial along a hyperplane DPmD \subset \mathbb P^m is isomorphic to the Quot scheme QuotAm(Or,n)\mathrm{Quot}_{\mathbb A^m}(\mathscr O^{\oplus r},n) of 00-dimensional length nn quotients of the free sheaf Or\mathscr O^{\oplus r} on Am\mathbb A^m.Comment: Minor improvement

    Optimal-Time Text Indexing in BWT-runs Bounded Space

    Full text link
    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 rr, the number of runs in their Burrows-Wheeler Transform (BWT). One of the earliest indexes for repetitive collections, the Run-Length FM-index, used O(r)O(r) space and was able to efficiently count the number of occurrences of a pattern of length mm 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 rr. 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 occocc occurrences efficiently within O(r)O(r) space (in loglogarithmic time each), and reaching optimal time O(m+occ)O(m+occ) within O(rlog(n/r))O(r\log(n/r)) space, on a RAM machine of w=Ω(logn)w=\Omega(\log n) bits. Within O(rlog(n/r))O(r\log (n/r)) space, our index can also count in optimal time O(m)O(m). Raising the space to O(rwlogσ(n/r))O(r w\log_\sigma(n/r)), we support count and locate in O(mlog(σ)/w)O(m\log(\sigma)/w) and O(mlog(σ)/w+occ)O(m\log(\sigma)/w+occ) time, which is optimal in the packed setting and had not been obtained before in compressed space. We also describe a structure using O(rlog(n/r))O(r\log(n/r)) space that replaces the text and extracts any text substring of length \ell in almost-optimal time O(log(n/r)+log(σ)/w)O(\log(n/r)+\ell\log(\sigma)/w). (...continues...
    corecore