420 research outputs found
c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches
Given a dynamic set of strings of total length whose characters
are drawn from an alphabet of size , a keyword dictionary is a data
structure built on that provides locate, prefix search, and update
operations on . Under the assumption that
characters fit into a single machine word , we propose a keyword dictionary
that represents in bits of space,
supporting all operations in expected time on an
input string of length in the word RAM model. This data structure is
underlined with an exhaustive practical evaluation, highlighting the practical
usefulness of the proposed data structure, especially for prefix searches - one
of the most elementary keyword dictionary operations
Herbal medicines for the treatment of cancer chemotherapy-induced side effects
Accumulating evidence suggests that Japanese herbal medicines, called Kampo, have beneficial effects on cancer chemotherapy-induced side effects. Rikkunshito ameliorates cisplatin-induced anorexia through an antagonistic effect on the 5-HT receptors and by increasing the serum ghrelin levels. Hangeshashinto improves irinotecan-induced diarrhea and chemotherapy-induced mucositis by inhibiting the activity of β-glucuronidase as well as the synthesis of prostaglandin E2. Goshajinkigan prevents oxaliplatin-induced neurotoxicity, possibly through suppressing functional alterations of the transient receptor potential (TRP) channels. In this review, we will summarize the currently available literature regarding the clinical efficacy and potential mechanisms of Kampo medicines in the treatment of cancer chemotherapy-induced side effects
Fully dynamic data structure for LCE queries in compressed space
A Longest Common Extension (LCE) query on a text of length asks for
the length of the longest common prefix of suffixes starting at given two
positions. We show that the signature encoding of size [Mehlhorn et al., Algorithmica 17(2):183-198,
1997] of , which can be seen as a compressed representation of , has a
capability to support LCE queries in time,
where is the answer to the query, is the size of the Lempel-Ziv77
(LZ77) factorization of , and is an integer that can be handled
in constant time under word RAM model. In compressed space, this is the fastest
deterministic LCE data structure in many cases. Moreover, can be
enhanced to support efficient update operations: After processing
in time, we can insert/delete any (sub)string of length
into/from an arbitrary position of in time, where . This yields
the first fully dynamic LCE data structure. We also present efficient
construction algorithms from various types of inputs: We can construct
in time from uncompressed string ; in
time from grammar-compressed string
represented by a straight-line program of size ; and in time from LZ77-compressed string with factors. On top
of the above contributions, we show several applications of our data structures
which improve previous best known results on grammar-compressed string
processing.Comment: arXiv admin note: text overlap with arXiv:1504.0695
- …