Results 21 to 30 of about 272,212 (190)
Engineering Parallel String Sorting [PDF]
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we first propose ...
Bingmann, Timo +2 more
core +3 more sources
Tube-Based Taut String Algorithms for Total Variation Regularization
Removing noise from signals using total variation regularization is a challenging signal processing problem arising in many practical applications.
Artyom Makovetskii +3 more
doaj +1 more source
Identifying all abelian periods of a string in quadratic time and relevant problems [PDF]
Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for the computation of all abelian periods of a string were given.
Christou, Michalis +2 more
core +4 more sources
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings.
Felipe A. Louza +4 more
doaj +1 more source
Destruction of string order after a quantum quench [PDF]
We investigate the evolution of string order in a spin-1 chain following a quantum quench. After initializing the chain in the Affleck-Kennedy-Lieb-Tasaki state, we analyze in detail how string order evolves as a function of time at different length ...
Endres, Manuel +4 more
core +4 more sources
String correction using the Damerau-Levenshtein distance
Background In the string correction problem, we are to transform one string into another using a set of prescribed edit operations. In string correction using the Damerau-Levenshtein (DL) distance, the permissible edit operations are: substitution ...
Chunchun Zhao, Sartaj Sahni
doaj +1 more source
A New Search Algorithm for Feature Selection in Hyperspectral Remote Sensing Images [PDF]
A new suboptimal search strategy suitable for feature selection in very high-dimensional remote-sensing images (e.g. those acquired by hyperspectral sensors) is proposed.
Bruzzone, Lorenzo +1 more
core +2 more sources
Entropy-Based Approach in Selection Exact String-Matching Algorithms
The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case.
Ivan Markić +3 more
doaj +1 more source
Improving database quality through eliminating duplicate records
Redundant or duplicate data are the most troublesome problem in database management and applications. Approximate field matching is the key solution to resolve the problem by identifying semantically equivalent string values in syntactically different ...
Mingzhen Wei +2 more
doaj +1 more source
Practical Evaluation of Lyndon Factors via Alphabet Reordering
We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza&Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the length of the longest
Marcelo K. Albertini, Felipe A. Louza
doaj +1 more source

