Average-case analysis of perfect sorting by reversals (Journal Version) [PDF]
, 2011 Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval.
Bouvel, Mathilde +3 more
core +3 more sources
Adaptive Shivers Sort: An Alternative Sorting Algorithm [PDF]
ACM Transactions on Algorithms, 2020 We present a new sorting algorithm, called adaptive ShiversSort , that exploits the existence of monotonic runs for sorting efficiently partially sorted data. This algorithm is a variant of the well-known algorithm TimSort , which is the sorting algorithm used in standard libraries of ...
openaire +3 more sources
Exploring Auto-Generation of Network Models With Performance Evaluation Process Algebra
IEEE Access, 2018 Formal method plays an important role in modeling large scale concurrent networks through its efficient model construction and analysis. Taking urban road networks and public transportation systems as examples, such models can be defined in a formal ...
Jie Ding +3 more
doaj +1 more source
An empirical study of the gap sequences for Shell sort
Lietuvos Matematikos Rinkinys, 2013 We present an improved version of the Shell sort algorithm. Using the algorithm, we study various geometrical sequences and the performance of Shell sort.
Irmantas Radavičius +1 more
doaj +1 more source
Path planning of coal gangue sorting robot based on G-RRT* algorithm
Gong-kuang zidonghua, 2022 The coal gangue sorting environment is complex. In order to avoid the collision between robot and obstacles and improve sorting efficiency, it is necessary to carry out path planning for robot. The principle of coal gangue sorting system is analyzed. The
ZHU Ziqi, LI Chuangye, DAI Wei
doaj +1 more source
An empirical study on SAJQ (Sorting Algorithm for Join Queries)
Egyptian Informatics Journal, 2010 Most queries that applied on database management systems (DBMS) depend heavily on the performance of the used sorting algorithm. In addition to have an efficient sorting algorithm, as a primary feature, stability of such algorithms is a major feature ...
Hassan I. Mathkour
doaj +1 more source
Generating Almost Descending Sequences to Reduce the Number of Movements in Sorting
IEEE Access, 2022 Sorting algorithms usually generate strictly descending sequences. However, almost descending sequences may be sufficient to fulfill our needs in practice, and the number of movements needed for generating such sequences can be greatly reduced. We call a
Yuyin Yu, Xuan Xiao
doaj +1 more source
Fuzzy fixed points of generalized F-2-Geraghty type fuzzy mappings and complementary results
Nonlinear Analysis, 2016 The aim of this paper is to introduce generalized F2-Geraghty type fuzzy mappings on a metric space for establishing the existence of fuzzy fixed points of such mappings.
Mujahid Abbas +3 more
doaj +1 more source
Heuristic Spike Sorting Tuner (HSST), a framework to determine optimal parameter selection for a generic spike sorting algorithm [PDF]
, 2020 Extracellular microelectrodes frequently record neural activity from more than one neuron in the vicinity of the electrode. The process of labeling each recorded spike waveform with the identity of its source neuron is called spike sorting and is often ...
Bjånes, David A. +3 more
core
Modified capacitor voltage balancing sorting algorithm for modular multilevel converter
The Journal of Engineering, 2019 The modular multilevel converter (MMC) with large-scale sub-modules has the advantage of simpler modulation, lower switching frequency, and lower harmonic component, thus would be very promising in voltage source converter (VSC)–high voltage direct ...
Jie Zhang +5 more
doaj +1 more source