Average-Case Optimal Approximate Circular String Matching

Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string matching is the problem of finding all factors of t that are at a distance at most k from x or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time O(n(k + log m)/m). Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson and Navarro, 2004) using x and its rotations as the set of multiple patterns. Here we reduce the preprocessing time and space requirements compared to that approach

ShapeFit and ShapeKick for Robust, Scalable Structure from Motion

We introduce a new method for location recovery from pair-wise directions that leverages an efficient convex program that comes with exact recovery guarantees, even in the presence of adversarial outliers. When pairwise directions represent scaled relative positions between pairs of views (estimated for instance with epipolar geometry) our method can be used for location recovery, that is the determination of relative pose up to a single unknown scale. For this task, our method yields performance comparable to the state-of-the-art with an order of magnitude speed-up. Our proposed numerical framework is flexible in that it accommodates other approaches to location recovery and can be used to speed up other methods. These properties are demonstrated by extensively testing against state-of-the-art methods for location recovery on 13 large, irregular collections of images of real scenes in addition to simulated data with ground truth

Comparison of the biotypes of Yersinia enterocolitica isolated from pigs, cattle and sheep at slaughter and from humans with yersiniosis in Great Britain during 1999-2000

Aims: To investigate the relationship between livestock carriage of Yersinia enterocolitica and human disease. The biotypes/serotypes of strains recovered from the faeces of pigs, cattle and sheep at slaughter during a national survey in Great Britain in 1999-2000, were compared with those of strains isolated from human cases of yersiniosis during the same period. Methods and Results: The faecal carriage of Y. enterocolitica by cattle, sheep and pigs at slaughter was 6.3, 10.7 and 26.1%, respectively. Yersinia enterocolitica biotype (BT) 1a was the most frequently isolated biotype from livestock (58%) and was the predominant biotype (53%) isolated from human cases over the same period. The main recognized pathogenic Y. enterocolitica biotype isolated from livestock was BT3 (O:5,27) (35% of sheep, 22% of pigs and 4% of cattle) but this biotype was not detected in any of the human isolates investigated. The major pathogenic biotypes of strains isolated from humans were BT3 (O:9) (24%) and BT4 (O:3) (19%) whereas of the veterinary isolates investigated, only pigs (11%) carried BT3 (O:9) strains. Conclusions: Because of significant overlaps in phenotypes of the veterinary and human strains it is not possible to comment on the correlation between host and pathogenicity, especially of biotype 1a. Significance and Impact of the Study: The data suggest that further investigations using methods with greater discriminatory power are required. However the data also suggests that pigs may be the primary reservoir for human pathogenic Y. enterocolitica infection

Modelling Deep Green tidal power plant using large eddy simulations and the actuator line method

The Deep Green technique for tidal power generation is suitable for moderate flows which is attractive since larger areas for tidal energy generation hereby can be used. It operates typically at mid-depth and can be seen as a “flying” kite with a turbine and generator attached underneath. It moves in a lying figure-eight path almost perpendicular to the tidal flow. Large eddy simulations and an adaption of the actuator line method (in order to describe arbitrary paths) are used to study the turbulent flow with and without Deep Green for a specific site. This methodology can in later studies be used for e.g. array analysis that include Deep Green interaction. It is seen that Deep Green creates a unique wake composed of two velocity deficit zones with increased velocity in each wake core. The flow has a tendency to be directed downwards which results in locally increased bottom shear. The persistence of flow disturbances of Deep Green can be scaled with its horizontal path width, Dy, with a velocity deficit of 5% at approximately 8–10Dy downstream of the power plant. The turbulence intensity and power deficit are approximately two times the undisturbed value and 10%, respectively, at 10Dy

Contamination of carcasses, offals and the environment with yadA-positive Yersinia enterocolitica in a pig slaughterhouse

Reprinted with permission from the Journal of Food Protection. Copyright held by the International Association for Food Protection, Des Moines, Iowa, U.S.A

Yersinia pseudotuberculosis with limited genetic diversity is a common finding in tonsils of fattening pigs

Reprinted with permission from the Journal of Food Protection. Copyright held by the International Association for Food Protection, Des Moines, Iowa, U.S.A

Dictionary Matching with One Gap

The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares. Then, given a query text $T$ of length $n$ over alphabet $\Sigma$, the goal is to output all locations in $T$ in which a pattern $P_i\in D$, $1\leq i\leq d$, ends. There is a renewed current interest in the gapped matching problem stemming from cyber security. In this paper we solve the problem where all patterns in the dictionary have one gap with at least $\alpha$ and at most $\beta$ don't cares, where $\alpha$ and $\beta$ are given parameters. Specifically, we show that the dictionary matching with a single gap problem can be solved in either $O(d\log d + |D|)$ time and $O(d\log^{\varepsilon} d + |D|)$ space, and query time $O(n(\beta -\alpha )\log\log d \log ^2 \min \{ d, \log |D| \} + occ)$, where $occ$ is the number of patterns found, or preprocessing time and space: $O(d^2 + |D|)$, and query time $O(n(\beta -\alpha ) + occ)$, where $occ$ is the number of patterns found. As far as we know, this is the best solution for this setting of the problem, where many overlaps may exist in the dictionary.Comment: A preliminary version was published at CPM 201

Approximate string matching with reduced alphabet

Peer reviewe

Nanodiscs for INPHARMA NMR Characterization of GPCRs: Ligand Binding to the Human A2A Adenosine Receptor.

G-protein-coupled-receptors (GPCRs) are of fundamental importance for signal transduction through cell membranes. This makes them important drug targets, but structure-based drug design (SBDD) is still hampered by the limitations for structure determination of unmodified GPCRs. We show that the interligand NOEs for pharmacophore mapping (INPHARMA) method can provide valuable information on ligand poses inside the binding site of the unmodified human A2A adenosine receptor reconstituted in nanodiscs. By comparing experimental INPHARMA spectra with back-calculated spectra based on ligand poses obtained from molecular dynamics simulations, a complex structure for A2A R with the low-affinity ligand 3-pyrrolidin-1-ylquinoxalin-2-amine was determined based on the X-ray structure of ligand ZM-241,358 in complex with a modified A2A R