作者：
Saleh, TajErgin, Fatma CorutMalkawi, MalekAlhajj, RedaDepartment of Computer Engineering
Marmara University Istanbul Turkey Department of Computer Engineering Istanbul Medipol University Istanbul Turkey Department of Computer Science University of Calgary Alberta Canada Department of Heath Informatics University of Southern Denmark Odense Denmark
string search algorithms play an important role in many research areas such as data mining and bioinformatics. While there exist a number of algorithms that handles the topic, we are exploring the the Knuth-Morris-Pra...
详细信息
string sorting is an important part of tasks such as building index data structures. Unfortunately, current string sorting algorithms do not scale to massively parallel distributed-memory machines since they either ha...
详细信息
Efficient communication plays a pivotal role in the success of university community service programs. This study highlights the innovative approach taken by the University of Riau to enhance communication within their...
详细信息
As in the current era, data is expanding daily on the web, where tremendous data banks with big data need to be searched by different users according to their data needs. This is when normal users cannot afford more w...
详细信息
string matching is a fundamental problem in algorithm. This study examines the development and construction of two reversible string-matching algorithms: a naive string-matching algorithm and the Rabin-Karp algorithm....
详细信息
string matching is a fundamental problem in algorithm. This study examines the development and construction of two reversible string-matching algorithms: a naive string-matching algorithm and the Rabin-Karp algorithm. The algorithms are used to introduce reversible computing concepts, beginning from basic reversible programming techniques to more advanced considerations about the injectivization of the polynomial hash-update function employed by the Rabin-Karp algorithm. The results are two clean input-preserving reversible algorithms that require no additional space and have the same asymptotic time complexity as their classic irreversible originals. This study aims to contribute to the body of reversible algorithms and to the discipline of reversible programming.
In the domain of character-based approximate string matching, edit distances such as Levenshtein have remained predominant despite their quadratic time complexity. This reality has prompted the adoption of more effici...
详细信息
ISBN:
(纸本)9789526524610
In the domain of character-based approximate string matching, edit distances such as Levenshtein have remained predominant despite their quadratic time complexity. This reality has prompted the adoption of more efficient metrics like Jaro and Jaro-Winkler. However, these methods often overlook the significance of character order within the matching window, which can adversely affect *** the first time, we introduce a novel class of character-based approximate string matching algorithms that leverage a convolutional kernel, surpassing the performance of existing state-of-the-art unsupervised character-based approximate string matching algorithms. This paper presents Convolutional Jaro (ConvJ) and Convolutional Jaro-Winkler (ConvJW), innovative similarity metrics designed to overcome these shortcomings. ConvJ and ConvJW utilize a convolutional approach with Gaussian weighting to effectively capture the positional proximity of matching characters, resulting in a more precise similarity evaluation. This method not only achieves computational efficiency comparable to that of Jaro and Jaro-Winkler but also surpasses the state-of-the-art in terms of F1-score, demonstrating faster execution times compared to the conventional Jaro and Jaro-Winkler implementations across various *** extensive experimental analysis highlights the exceptional performance of ConvJ and ConvJW across a range of datasets. Remarkably, ConvJ exhibits a 7x faster execution time than the fast Jaro implementation and exceeds the state-of-the-art F1-score by a significant margin of 10% more than Jaro. By setting a new benchmark in unsupervised character-based approximate string matching, our research shows the new way for future exploration and development in this field. The ConvJ and ConvJW algorithms, characterized by their quasilinear time complexity and improved accuracy, provide a solid foundation for the advancement of string matching techniques. These developments hold promise fo
Absurd as it may seem, but strings can be treated as numbers for computation purposes. Most computer programs make extensive use of string operations like string-matching or sub-string lookups. Computer systems repres...
详细信息
In today's world as there is a rapid growth of digitalization, searching and retrieving of relevant images from large datasets efficiently and accurately is challenging. There are two Image Retrieval Methods. Thes...
详细信息
In this paper, we study the string matching problem. We design a quantum string-matching algorithm for noisy intermediate-scale quantum (NISQ) computers, given the current leading quantum processing units (QPUs) havin...
详细信息
string pairing is a highly significant issue in the broader area of data preparation, making string matching a classic as well as an existing problem in computer science study domains. Although data is remembered in n...
详细信息
暂无评论