Faster Queries for Longest Substring Palindrome After Block Edit

Palindromes are important objects in strings which have been extensively studied from combinatorial, algorithmic, and bioinformatics points of views. Manacher [J. ACM 1975] proposed a seminal algorithm that computes the longest substring palindromes (LSPals) of a given string in O(n) time, where n is the length of the string. In this paper, we consider the problem of finding the LSPal after the string is edited. We present an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O(l + log log n) time, after a substring in T is replaced by a string of arbitrary length l. This outperforms the query algorithm proposed in our previous work [CPM 2018] that uses O(l + log n) time for each query

Longest substring palindrome after edit

It is known that the length of the longest substring palindromes (LSPals) of a given string T of length n can be computed in O(n) time by Manacher\u27s algorithm [J. ACM \u2775]. In this paper, we consider the problem of finding the LSPal after the string is edited. We present an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O(log (min {sigma, log n })) time after single character substitution, insertion, or deletion, where sigma denotes the number of distinct characters appearing in T. We also propose an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O(l + log n) time, after an existing substring in T is replaced by a string of arbitrary length l

Medical Treatment for Burn Patients with Eating Disorders: A Case Report

There have been many cases of burn patients who also suffer from psychiatric problems, including eating disorders. We present a case of a 38-year-old female with an eating disorder and depression who became light-headed and fell, spilling boiling water from a kettle on herself at home sustaining partial thickness and full thickness burns over 5% of her total body surface area: left buttock and right thigh and calf. Eating disorders (in the present case, anorexia nervosa) cause emaciation and malnutrition, and consent for hospitalization from the patient and/or family is often difficult. During the medical treatment of burns for these patients, consideration not only of physical symptoms caused by malnutrition but also the psychiatric issues is required. Therefore, multifaceted and complex care must be given to burn patients with eating disorders

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences

The equidistant subsequence pattern matching problem is considered. Given a pattern string $P$ and a text string $T$, we say that $P$ is an \emph{equidistant subsequence} of $T$ if $P$ is a subsequence of the text such that consecutive symbols of $P$ in the occurrence are equally spaced. We can consider the problem of equidistant subsequences as generalizations of (sub-)cadences. We give bit-parallel algorithms that yield $o(n^2)$ time algorithms for finding $k$-(sub-)cadences and equidistant subsequences. Furthermore, $O(n\log^2 n)$ and $O(n\log n)$ time algorithms, respectively for equidistant and Abelian equidistant matching for the case $|P| = 3$, are shown. The algorithms make use of a technique that was recently introduced which can efficiently compute convolutions with linear constraints

Hidden Markov Model for Automatic Transcription of MIDI Signals

This paper describes a Hidden Markov Model (HMM)-based method of automatic transcription of MIDI (Musical Instrument Digital Interface) signals of performed music. The problem is formulated as recognition of a given sequence of fluctuating note durations to find the most likely intended note sequence utilizing the modern continuous speech recognition technique. Combining a stochastic model of deviating note durations and a stochastic grammar representing possible sequences of notes, the maximum likelihood estimate of the note sequence is searched in terms of Viterbi algorithm. The same principle is successfully applied to a joint problem of bar line allocation, time measure recognition, and tempo estimation. Finally, durations of consecutive n notes are combined to form a "rhythm vector" representing tempo-free relative durations of the notes and treated in the same framework. Significant improvements compared with conventional "quantization" techniques are shown

Synthesis and pharmacological characterization of potent, selective, and orally bioavailable isoindoline class dipeptidyl peptidase IV inhibitors

Focused structure-activity relationships of isoindoline class DPP-IV inhibitors have led to the discovery of 4b as a highly selective, potent inhibitor of DPP-IV. In vivo studies in Wistar/ST rats showed that 4b was converted into the strongly active metabolite 4l in high yield, resulting in good in vivo efficacy for antihyperglycemic activity