17 papers · ranked by Valyu relevance
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
Background We study the problem of finding maximal exact matches (MEMs) between a query string Q and a labeled graph G. MEMs are an important class of seeds, often used in seed-chain-extend type of practical alignment methods because of their strong connections to classical metrics. A principled way to speed up…
Ahsan Sanaullah, Nathaniel K. Brown, Pramesh Shakya, Arun Deegutla + 4 more
Lossless full text indexes are utilized in a myriad of applications in bioinformatics. The continuously decreasing cost of generating biological data has resulted in the need to build full text indexes on biological datasets of increasing size. Many compressed full text indexes have been developed to address this…
Tamar Pinhas, Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
We propose three algorithms for string edit distance with duplications and contractions. These include an efficient general algorithm and two improvements which apply under certain constraints on the cost function. The new algorithms solve a more general problem variant and obtain better time complexities with respect…
Mohammad Abdur Rob, Md. Zakir Hossen, Md. Kamal Hossen, Md. Mithun Ali + 2 more
Sorting algorithms play a crucial role in computing, but most are designed with rigid structure that are only efficient under certain conditions. Although some sorting algorithms perform well in some circumstances, they do not perform well on some resistant platforms. This study introduces Wall-L Merge Sort, which…
Qichao Wang, Linlin Chen, Qun Sun, Chong Wang + 2 more
In order to solve the problems of high dependence on the accuracy of environmental model and poor environmental adaptability of traditional control methods, the robot constant force grinding controller that based on proximal policy optimization was proposed. Training the controller model between grinding force…
Ricardo Villanueva-Polanco
In this paper, we will study the key enumeration problem, which is connected to the key recovery problem posed in the cold boot attack setting. In this setting, an attacker with physical access to a computer may obtain noisy data of a cryptographic secret key of a cryptographic scheme from main memory via this data…
Chunchun Zhao, Sartaj Sahni
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, insertion, deletion and transposition. Several algorithms for string…
Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
Background RNA secondary structure prediction is a mainstream bioinformatic domain, and is key to computational analysis of functional RNA. In more than 30 years, much research has been devoted to defining different variants of RNA structure prediction problems, and to developing techniques for improving prediction…
Thijs Laarhoven, Michele Mosca, Joop van de Pol
By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the literature, we obtain improved asymptotic quantum results for solving the shortest vector problem on lattices. With quantum computers we can provably find a shortest vector in time $2^{1.799n + on}$, improving upon the…
Vladimir Sukhoy, Alexander Stoytchev
This paper proves several novel formulas for the length of a Farey sequence of order n. The formulas use different trade-offs between iteration and recurrence and they range from simple to more complex. The paper also describes several iterative algorithms for computing the length of a Farey sequence based on these…
Simon Van den Eynde, Pieter Audenaert, Didier Colle, Mario Pickavet + 1 more
Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecommunications, Fiber-To-The-Home (FTTH) houses are clustered so they can be connected with fiber as cost-efficiently as possible. The cost calculation of a fiber installment can be formulated as a capacitated STP. Often…
Benjamin Schiller, Clemens Deusser, Jeronimo Castrillon, Thorsten Strufe
'Thorsten Strufe'] Graphs are used to model a wide range of systems from different disciplines including social network analysis, biology, and big data processing. When analyzing these constantly changing dynamic graphs at a high frequency, performance is the main concern. Depending on the graph size and structure…
Suluk Chaikhan, Suphakant Phimoltares, Chidchanok Lursinsap, Marcin Woźniak
'Marcin Woźniak'] Tremendous quantities of numeric data have been generated as streams in various cyber ecosystems. Sorting is one of the most fundamental operations to gain knowledge from data. However, due to size restrictions of data storage which includes storage inside and outside CPU with respect to the massive…
Ahmed M. Hassan, Jafar Ababneh, Hani Attar, Tamer Shamseldin + 3 more
'Ahmed Abdelbaset' 'Mohamed Eladly Metwally' 'Omer Saleem'] Enhancing the performance of 5ph-IPMSM control plays a crucial role in advancing various innovative applications such as electric vehicles. This paper proposes a new reinforcement learning (RL) control algorithm based twin-delayed deep deterministic policy…
Suhas Thejaswi, Juho Lauri, Aristides Gionis
We study a family of reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-respecting path, where the difference in timestamps between consecutive…
Zheng Wang, Shian-Shyong Tseng
Anomaly detection systems and many other applications are frequently confronted with the problem of finding the largest knee point in the sorted curve for a set of unsorted points. This paper proposes an efficient knee point search algorithm with minimized time complexity using the cascading top-k sorting when a priori…
Wenzhuo Ma, Zhe Yue, Zengzeng Lian, Kezhao Li + 3 more
'Mengshuo Zhang' 'Jari Nurmi'] Amidst the backdrop of the profound synergy between navigation and visual perception, there is an urgent demand for accurate real-time vehicle positioning in urban environments. However, the existing global navigation satellite system (GNSS) algorithms based on Kalman filters fall short…