Results 131 to 140 of about 147,630 (190)

Photonic variational quantum eigensolver for NISQ-compatible quantum technology. [PDF]

Nano Converg
Hu KM, Namkung M, Lim HT.
europepmc   +1 more source

SMILES alignment: a dynamic programming approach for the alignment of metabolites and other small organic molecules. [PDF]

BMC Bioinformatics
Tang AL, Liberles DA.
europepmc   +1 more source

Template-Based Catalysis and the Emergence of Collectively Autocatalytic Systems. [PDF]

Entropy (Basel)
Serra R, Villani M.
europepmc   +1 more source

Batch optimization for balanced binary sequences and DNA sequences. [PDF]

BMC Bioinformatics
Ma Y.
europepmc   +1 more source

T-Rx: A toolbox for reproducible processing of prescriptions (Rx) from electronic health records

Lo CWH, Handley D, Pain O, Kamp M, Gillett AC, Iveson MH, Fabbri C, Young KG, AMBER Research Team, Lewis CM.   +9 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

Bounds on algorithms for string generation

Acta Informatica, 1972
The well-known lower bound of log2 n! on the number of comparisons required to sort n items is extended to cover algorithms, such as replacement selection, which produce a sorted string whose length is a random variable. The case of algorithms which produce several strings is also discussed and these results are then applied to obtain an upper bound on
McKellar, A. C., Wong, C. K.
openaire   +1 more source