Results 101 to 110 of about 5,721,874 (232)
Parallel string matching algorithms [PDF]
, 2012 This thesis presents different string searching algorithms. The string searching or string matching problem is one of the most basic problems on strings. It resurfaced with the development of bioinformatics and the need for DNA sequence analysis. It also
Hočevar, Tomaž
core
Improved algorithms for string searching problems [PDF]
, 2009 We present improved practically efficient algorithms for several string searching problems, where we search for a short string called the pattern in a longer string called the text.
Salmela, Leena
core
Navigating the string landscape with machine learning techniques [PDF]
This thesis explores the possibility of using heuristic search algorithms from data science, namely genetic algorithms and reinforcement learning, to navigate the string landscape to uncover phenomenologically interesting constructions.
Harvey, Thomas
core +2 more sources
External memory algorithms for string problems [PDF]
, 2008 In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast internal memory and slow external memory continues to grow.
Iliopoulos, C S +7 more
core
Parallel String Matching Algorithms [PDF]
, 1990 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 ...
Dany Breslauer, Zvi Galil
core
External memory algorithms for string problems [PDF]
, 2006 In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast internal memory and slow external memory continues to grow.
Roh, Kangho +7 more
core
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Discrete Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faisal N. Abu-Khzam +4 more
openaire +2 more sources
Accelerated preprocessing in task of searching substrings in a string
Advanced Engineering Research, 2019 Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database
A. V. Mazurenko, N. V. Boldyrikhin
doaj +1 more source
Noise cancellation using total variation for copy number variation detection
BMC Bioinformatics, 2018 Background Due to recent advances in sequencing technologies, sequence-based analysis has been widely applied to detecting copy number variations (CNVs).
Fatima Zare +2 more
doaj +1 more source
Experiments with a fast string searching algorithm
Information Processing Letters, 1983 <p>Consider the problem of finding the first occurrence of a particular pattern in a (long) string of characters. Boyer and Moore found a fast algorithm for doing this. Here we consider how this algorithm behaves when executed on a multiprocessor.</p><p>It is shown that a simple implementation performs very well.
Peter Møller-Nielsen +1 more
openaire +2 more sources