Search results for "String searching algorithm"

Improving Efficacy of PubMed Clinical Queries for Retrieving Scientifically Strong Studies on Treatment

2006

The authors evaluated the retrieval power of PubMed "Clinical Queries," narrow search string, about therapy in comparison with a modified search string to avoid possible retrieval bias. PubMed search strategy was compared to a slightly modified string that included the Britannic English term "randomised." The authors tested the two strings joined onto each of four terms concerning topics of broad interest: hypertension, hepatitis, diabetes, and heart failure. In particular, precision was computed for not-indexed citations. The added word "randomised" improved total citation retrieval in any case. Total retrieval gain for not-indexed citations ranged from 11.1% to 21.4%. A significant number…

N-string vertices in string field theory.

1993

We give the general form of the vertex corresponding to the interaction of an arbitrary number of strings. The technique employed relies on the ``comma" representation of String Field Theory where string fields and interactions are represented as matrices and operations between them such as multiplication and trace. The general formulation presented here shows that the interaction vertex of N strings, for any arbitrary N, is given as a function of particular combinations of matrices corresponding to the change of representation between the full string and the half string degrees of freedom.

Indexed Two-Dimensional String Matching

2016

A basic analysis toolkit for biological sequences

2007

This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave gap cost functions. Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation. None of the algorithms is new, but although they are generally regarded as fundamental for sequence analysis, they have not been implemented in a single and consistent software package, as we do here. Therefore, our main contribution is to fill this gap between algorithmic theory an…

Multi-dimensional pattern matching with dimensional wildcards

1995

We introduce a new multi-dimensional pattern matching problem, which is a natural generalization of the on-line search in string matching. We are given a text matrix A[1: n1, ..., 1:n d ] of size N= n1×n2×...×n d , which we may preprocess. Then, we are given, online, an r-dimensional pattern matrix B[1:m1,...,1:m r ] of size M= m1×m2×...×m r , with 1≤r≤d. We would like to know whether B*=B*[*, 1:m1,*, ...,1: mr, *] occurs in A, where * is a dimensional wildcard such that B* is any d-dimensional matrix having size 1 × ... × m1×...1×m r ×...1 and containing the same elements as B. Notice that there might be (d/r)≤2d occurrences of B* for each position of A. We give CRCW-PRAM algorithms for pr…