Results 231 to 240 of about 148,669 (285)
CMCL-DDI: Pharmacophore-aware cross-view contrastive learning for drug-drug interaction prediction. [PDF]
PLoS OneHan Y, Du L.
europepmc +1 more source
A hybrid recurrent neural network and optimization framework for intelligent mobile robot navigation in smart manufacturing. [PDF]
Sci RepRadha K, Karthikeyan S.
europepmc +1 more source
Simplicity and Complexity in Combinatorial Optimization. [PDF]
Entropy (Basel)Dingle K, Hutter M.
europepmc +1 more source
T-Rx: A toolbox for reproducible processing of prescriptions (Rx) from electronic health records
Lo CWH +9 more
europepmc +1 more source
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maxime Crochemore +2 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Systolic Algorithms for String Manipulations
IEEE Transactions on Computers, 1984One-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 ...
Alberto Apostolico, Alberto Negro
openaire +2 more sources
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources
A fast string searching algorithm
Communications of the ACM, 1977An algorithm is presented that searches for the location, “ i l” of the first occurrence of a character string, “ pat ,” in another string, “ string .” During the search operation, the characters of pat are matched starting with the last ...
Robert S. Boyer, J Strother Moore
openaire +1 more source
A parallel string search algorithm
IEEE Transactions on Systems, Man, and Cybernetics, 1992A new parallel processing algorithm for solving string search problems is presented. The proposed algorithm uses O(m*n) processors where n is the length of a text and m is the length of a pattern. It requires two and only two iteration steps to find the pattern in the text, while the best existing parallel algorithm needs the computation time O(loglog ...
Yoshiyasu Takefuji +2 more
openaire +1 more source