Results 141 to 150 of about 272,212 (190)

Protein abundance inference via expectation-maximization in fluorosequencing. [PDF]

Bioinform Adv
Kipen J, Smith MB, Blom T, Zhou SB, Marcotte EM, Jaldén J.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Parallel String Matching Algorithms

Kybernetes, 1988
The string searching problem is central to many information retrieval and text editing applications. The Brute Force algorithm is inefficient in some cases and in this article four other algorithms are discussed, of which the Boyer‐Moore and the Improved Boyer‐Moore are found to be the fastest.
Evans, D. J., Ghanemi, S.
openaire   +1 more source

Systolic Algorithms for String Manipulations

IEEE Transactions on Computers, 1984
One-and two-dimensional pattern matching oriented systolic array processors are presented that support, respectively, the detection of all repetitions in a string x and the statistics of all substrings of x with and without overlap. The time is linear in the length of x in both applications, whereas the number of processors is linear and quadratic ...
Apostolico, Alberto, Negro, Alberto
openaire   +2 more sources

Simple Optimal String Matching Algorithm

Journal of Algorithms, 2000
Summary: We present a new string matching algorithm optimal on average (with equiprobability and independence of letters, in \(O(m+ n\log_{|\Sigma|} m/m)\), where \(n\) is the size of the text and \(m\) the size of the searched word, both taken on an alphabet \(\Sigma\)) and linear in the worst case (in \(O(m+ n)\)).
Allauzen, Cyril, Raffinot, Mathieu
openaire   +2 more sources

Algorithms on Strings

2007
The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language.
Crochemore, Maxime, Hancart, Christophe, Lecroq, Thierry   +2 more
openaire   +2 more sources

A string searching algorithm

Applied Mathematics and Computation, 1980
This paper is an attempt to develop a string searching algorithm that begins the search for a match in the middle of the strings being compared. The algorithm uses information gained from mismatches and the location of the search area in the large string, to make decisions and direct the search.
Iyengar, S. Sitharama, Alia, Vincent
openaire   +2 more sources

PAMA: A FAST STRING MATCHING ALGORITHM

International Journal of Foundations of Computer Science, 2006
String matching is a fundamental operation in computer science, and its performance has great impact on many applications including database query, text processing, DNA and protein sequence analysis. In this paper, we propose a fast string matching algorithm, PAMA (PAttern MAtching). The shift rule used by PAMA not only subsumes both the bad character
Lu, Shiyong, Cao, Feng, Lu, Yi
openaire   +1 more source

Parallel string matching algorithms

1993
The string matching problem is one of the most studied problems in computer science. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active.
Dany Breslauer, Zvi Galil
openaire   +1 more source

VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

International Journal of Foundations of Computer Science, 2002
Vector algorithms allow the computation of an output vector r = r1 r2 ⋯ rm given an input vector e = e1 e2 ⋯ em in a bounded number of operations, independent of m the length of the vectors. The allowable operations are usually restricted to bit-wise operations available in processors, including shifts and binary addition with carry.
Bergeron, Anne, Hamel, Sylvie
openaire   +1 more source