Увійти

Готові списки джерел за темами / String algorithms / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: String algorithms.

Статті в журналах з теми "String algorithms"

Автор: Grafiati

Опубліковано: 11 березня 2023

Оновлено: 25 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "String algorithms".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Bhagya Sri, Mukku, Rachita Bhavsar, and Preeti Narooka. "String Matching Algorithms." International Journal Of Engineering And Computer Science 7, no. 03 (2018): 23769–72. http://dx.doi.org/10.18535/ijecs/v7i3.19.

Повний текст джерела

Анотація:

To analyze the content of the documents, the various pattern matching algorithms are used to find all the occurrences of a limited set of patterns within an input text or input document. In order to perform this task, this research work used four existing string matching algorithms; they are Brute Force algorithm, Knuth-Morris-Pratt algorithm (KMP), Boyer Moore algorithm and Rabin Karp algorithm. This work also proposes three new string matching algorithms. They are Enhanced Boyer Moore algorithm, Enhanced Rabin Karp algorithm and Enhanced Knuth-Morris-Pratt algorithm. Findings: For expe

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Zhang, Zhaoyang. "Review on String-Matching Algorithm." SHS Web of Conferences 144 (2022): 03018. http://dx.doi.org/10.1051/shsconf/202214403018.

Повний текст джерела

Анотація:

String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content. The most classical and famous string-search algorithms are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (DM) algorithm. These two algorithms provide efficient heuristic jump rules by prefix or suffix. Bitap algorithm was the first to introduce bit-parallelism into string-matching field. Backward Non-Deterministic DAWG Matchin

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Franek, Frantisek, and Michael Liut. "Computing Maximal Lyndon Substrings of a String." Algorithms 13, no. 11 (2020): 294. http://dx.doi.org/10.3390/a13110294.

Повний текст джерела

Анотація:

There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal Lyndon substrings of the input string, and secondly, Franek et al. showed in 2017 a linear equivalence of sorting suffixes and sorting right-maximal Lyndon substrings of a string, inspired by a novel suffix sorting algorithm of Baier. In 2016, Franek et al. presented a brief overview of algorithms for computing the Lyndon array that encodes the k

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Latorre, Omar. "Exact and kernelization algorithms for Closet String." Selecciones Matemáticas 7, no. 2 (2020): 257–66. http://dx.doi.org/10.17268/sel.mat.2020.02.08.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Khadiev, Kamil, Artem Ilikaev, and Jevgenijs Vihrovs. "Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator." Mathematics 10, no. 3 (2022): 377. http://dx.doi.org/10.3390/math10030377.

Повний текст джерела

Анотація:

We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that are faster than classical (randomized or deterministic) counterparts for each of these problems. The quantum algorithms are based on the quantum procedure for comparing two strings of length k in O(k) queries. The first problem is sorting n strings of length k. We show that classical complexity of the problem is Θ(nk) for constant size alphabet, but our qua

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Jantan, Hamidah, and Nurul Aisyiah Baharudin. "Mobile-Based Word Matching Detection using Intelligent Predictive Algorithm." International Journal of Interactive Mobile Technologies (iJIM) 13, no. 09 (2019): 140. http://dx.doi.org/10.3991/ijim.v13i09.10848.

Повний текст джерела

Анотація:

Word matching is a string searching technique for information retrieval in Natural Language Processing (NLP). There are several algorithms have been used for string search and matching such as Knuth Morris Pratt, Boyer Moore, Horspool, Intelligent Predictive and many other. However, there some issues need to be considered in measuring the performance of the algorithms such as the efficiency for searching small alphabets, time taken in processing the pattern of the text and extra space to support a huge table or state machines. Intelligent Predictive (IP) algorithm capable to solve several word

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Nguyen, Van Truong, and Xuan Hoai Nguyen. "A Novel Negative Selection Algorithm with Optimal Worst-case Training Time Complexity for R-chunk Detectors." Indian Journal of Science and Technology 13, no. 10 (2020): 1160–71. https://doi.org/10.17485/ijst/2020/v13i10/149803.

Повний текст джерела

Анотація:

Abstract <strong>Objectives:</strong> To generate complete and non-redundant detector set with optimal worst-case time complexity. <strong>Methods:</strong> In this study, a novel exact matching and string-based Negative Selection Algorithm utilizing r-chunk detectors is proposed. Improved algorithms are tested on some data sets; the experiments’ results are compared with recently published ones. Moreover, algorithms’ complexities are also proved mathematically. <strong>Findings:</strong> For string-based Artificial Immune Systems, r-chunk detector is the most common

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Lasch, Robert, Ismail Oukid, Roman Dementiev, Norman May, Suleyman S. Demirsoy, and Kai-Uwe Sattler. "Faster & strong: string dictionary compression using sampling and fast vectorized decompression." VLDB Journal 29, no. 6 (2020): 1263–85. http://dx.doi.org/10.1007/s00778-020-00620-x.

Повний текст джерела

Анотація:

AbstractString dictionaries constitute a large portion of the memory footprint of database applications. While strong string dictionary compression algorithms exist, these come with impractical access and compression times. Therefore, lightweight algorithms such as front coding (PFC) are favored in practice. This paper endeavors to make strong string dictionary compression practical. We focus on Re-Pair Front Coding (RPFC), a grammar-based compression algorithm, since it consistently offers better compression ratios than other algorithms in the literature. To accelerate compression times, we p

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Baeza-Yates, R. A. "Algorithms for string searching." ACM SIGIR Forum 23, no. 3-4 (1989): 34–58. http://dx.doi.org/10.1145/74697.74700.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Evans, D. J., and S. Ghanemi. "Parallel String Matching Algorithms." Kybernetes 17, no. 3 (1988): 32–44. http://dx.doi.org/10.1108/eb005791.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Nazeen, Sumaiya, M. Sohel Rahman, and Rezwana Reaz. "Indeterminate string inference algorithms." Journal of Discrete Algorithms 10 (January 2012): 23–34. http://dx.doi.org/10.1016/j.jda.2011.08.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Russo, Luıs, and Alexandre Francisco. "Small Longest Tandem Scattered Subsequences." Scientific Annals of Computer Science 31, no. 1 (2021): 79–110. http://dx.doi.org/10.7561/sacs.2021.1.79.

Повний текст джерела

Анотація:

We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm, therefore its performance improves if the string is not self similar, which occurs naturally on strings over large alphabets. Our algorithm relies on new results for data structures that support dynamic longest increasing sub-sequences. In the process we also obtain improved algorithms for the decremental string comparison problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Russo, Luís M. S., and Alexandre P. Francisco. "Small Longest Tandem Scattered Subsequences." Scientific Annals of Computer Science XXXI, no. 1 (2021): 79–110. https://doi.org/10.7561/SACS.2021.1.79.

Повний текст джерела

Анотація:

We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm, therefore its performance improves if the string is not self similar, which occurs naturally on strings over large alphabets. Our algorithm relies on new results for data structures that support dynamic longest increasing sub-sequences. In the process we also obtain improved algorithms for the decremental string comparison problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Parshukova, N. B. "CRYPTOGRAPHIC ALGORITHMS IN SPREADSHEETS." Informatics in school, no. 8 (November 9, 2019): 51–55. http://dx.doi.org/10.32517/2221-1993-2019-18-8-51-55.

Повний текст джерела

Анотація:

The article examines three well known cryptographic algorithm — Skytale, Caesar's cipher, Vigenere's cipher and the method of their implementation using spreadsheets. Functions on work with strings, such as calculation of string length, search of a substring position in a string, substring selection, concatenation are considered.

Стилі APA, Harvard, Vancouver, ISO та ін.

15

BERGERON, ANNE, and SYLVIE HAMEL. "VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING." International Journal of Foundations of Computer Science 13, no. 01 (2002): 53–65. http://dx.doi.org/10.1142/s0129054102000947.

Повний текст джерела

Анотація:

Vector algorithms allow the computation of an output vector r = r1 r2 ⋯ rm given an input vector e = e1 e2 ⋯ em in a bounded number of operations, independent of m the length of the vectors. The allowable operations are usually restricted to bit-wise operations available in processors, including shifts and binary addition with carry. These restrictions imple that the existence of a vector algorithm for a particular problem opens the way to extremely fast implementations, using the inherent parallelism of bit-wise operations. This paper presents general results on the existence and construction

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Chung, K. L. "Fast string matching algorithms for run-length coded strings." Computing 54, no. 2 (1995): 119–25. http://dx.doi.org/10.1007/bf02238127.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

CHRISTOU, MICHALIS, MAXIME CROCHEMORE, and COSTAS S. ILIOPOULOS. "IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS." International Journal of Foundations of Computer Science 23, no. 06 (2012): 1371–84. http://dx.doi.org/10.1142/s0129054112500190.

Повний текст джерела

Анотація:

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. In contrast to the classical period of a word, its abelian version is more flexible, factors of the word are considered the same under any internal permutation of their letters. We show two O(|y|2) algorithms for the computation of all abelian periods of a string y. The first one maps each letter to a suitable number such that each factor of the string can

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Mamta, Culkari, Nangi Jumadil, and Masyur Sajiah Adha. "PERBANDINGAN ALGORITMA HORSPOOL DAN ALGORITMA RAITA PADA APLIKASI ISTILAH PSIKOLOGI BERBASIS ANDROID." semanTIK 5, no. 1 (2019): 131–42. https://doi.org/10.5281/zenodo.3242287.

Повний текст джерела

Анотація:

<strong><em>Abstract</em></strong> <em>The lack of professional health personnel in Indonesia has resulted in many people with mental disorders who have not been treated medically. To make it easier for the mental health workers, especially psychology students to study the term in psychology. It is necessary to have a digital dictionary because a tick printed book dictionary makes it difficult to carry around and the search term desired requires a long time. Based on this, a dictionary application for the psychology term based on Android was made.</em> <em>To make this application implemented

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Markić, Ivan, Maja Štula, Marija Zorić, and Darko Stipaničev. "Entropy-Based Approach in Selection Exact String-Matching Algorithms." Entropy 23, no. 1 (2020): 31. http://dx.doi.org/10.3390/e23010031.

Повний текст джерела

Анотація:

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. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Ghuman, Sukhpal, Emanuele Giaquinta, and Jorma Tarhio. "Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings." Algorithms 12, no. 6 (2019): 124. http://dx.doi.org/10.3390/a12060124.

Повний текст джерела

Анотація:

We present two modifications of Duval’s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to skip a significant number of characters of the string. Moreover, it can be engineered to have linear time complexity in the worst case. When there is a run-length encoded string R of length ρ , the other algorithm computes the Lyndon factorization of R in O ( ρ ) time and in constant space. It is shown by experimental results that the new variations

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Al-Ssulami, Abdulrakeeb M., Hassan Mathkour, and Mohammed Amer Arafah. "Efficient String Matching Algorithm for Searching Large DNA and Binary Texts." International Journal on Semantic Web and Information Systems 13, no. 4 (2017): 198–220. http://dx.doi.org/10.4018/ijswis.2017100110.

Повний текст джерела

Анотація:

The exact string matching is essential in application areas such as Bioinformatics and Intrusion Detection Systems. Speeding-up the string matching algorithm will therefore result in accelerating the searching process in DNA and binary data. Previously, there are two types of fast algorithms exist, bit-parallel based algorithms and hashing algorithms. The bit-parallel based are efficient when dealing with patterns of short lengths, less than 64, but slow on long patterns. On the other hand, hashing algorithms have optimal sublinear average case on large alphabets and long patterns, but the eff

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Bernardini, Giulia, Huiping Chen, Alessio Conte, et al. "Combinatorial Algorithms for String Sanitization." ACM Transactions on Knowledge Discovery from Data 15, no. 1 (2021): 1–34. http://dx.doi.org/10.1145/3418683.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Ukkonen, Esko. "Algorithms for approximate string matching." Information and Control 64, no. 1-3 (1985): 100–118. http://dx.doi.org/10.1016/s0019-9958(85)80046-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Lecroq, Thierry. "Fast exact string matching algorithms." Information Processing Letters 102, no. 6 (2007): 229–35. http://dx.doi.org/10.1016/j.ipl.2007.01.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Fadlil, Abdul, Sunardi Sunardi, and Rezki Ramdhani. "Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms." INTENSIF: Jurnal Ilmiah Penelitian dan Penerapan Teknologi Sistem Informasi 6, no. 2 (2022): 253–70. http://dx.doi.org/10.29407/intensif.v6i2.18141.

Повний текст джерела

Анотація:

Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms. In determining similarities, the Rabin-Karp and Winnowing algorithms use fingerprints, while the Horspool Boyer-Moore algorithm uses a bad-character table. However, previous research focused on identifying similarities using these algorithms based on character n-gram. In contrast, identification based on the word n-gram to determine the similarity based on its linguistic meaning, especially for longer strings, had not

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Na, Joong Chae, Sukhyeun Cho, Siwon Choi, Jin Wook Kim, Kunsoo Park, and Jeong Seop Sim. "A new graph model and algorithms for consistent superstring problems." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 372, no. 2016 (2014): 20130134. http://dx.doi.org/10.1098/rsta.2013.0134.

Повний текст джерела

Анотація:

Problems related to string inclusion and non-inclusion have been vigorously studied in diverse fields such as data compression, molecular biology and computer security. Given a finite set of positive strings and a finite set of negative strings , a string α is a consistent superstring if every positive string is a substring of α and no negative string is a substring of α . The shortest (resp. longest) consistent superstring problem is to find a string α that is the shortest (resp. longest) among all the consistent superstrings for the given sets of strings. In this paper, we first propose a ne

Стилі APA, Harvard, Vancouver, ISO та ін.

27

NGASSAM, ERNEST KETCHA, DERRICK G. KOURIE, and BRUCE W. WATSON. "ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS." International Journal of Foundations of Computer Science 19, no. 01 (2008): 53–70. http://dx.doi.org/10.1142/s012905410800553x.

Повний текст джерела

Анотація:

Table-driven (TD) DFA-based string processing algorithms are examined from a number of vantage points. Firstly, various strategies for implementing such algorithms in a cache-efficient manner are identified. The denotational semantics of such algorithms is encapsulated in a function whose various arguments are associated with each implementation strategy. This formal view of the implementation strategies suggests twelve different algorithms, each blending together the implementation strategies in a particular way. The performance of these algorithms is examined in against a set of artificially

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Leonardo, Brinardi, and Seng Hansun. "Text Documents Plagiarism Detection using Rabin-Karp and Jaro-Winkler Distance Algorithms." Indonesian Journal of Electrical Engineering and Computer Science 5, no. 2 (2017): 462. http://dx.doi.org/10.11591/ijeecs.v5.i2.pp462-471.

Повний текст джерела

Анотація:

Plagiarism is an act that is considered by the university as a fraud by taking someone ideas or writings without mentioning the references and claimed as his own. Plagiarism detection system is generally implement string matching algorithm in a text document to search for common words between documents. There are some algorithms used for string matching, two of them are Rabin-Karp and Jaro-Winkler Distance algorithms. Rabin-Karp algorithm is one of compatible algorithms to solve the problem of multiple string patterns, while, Jaro-Winkler Distance algorithm has advantages in terms of time. A p

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Razzaq, Atheer Akram Abdul, Nur'Aini Abdul Rashid, Alaa Ahmed Abbood, and Zurinahni Zainol. "The Improved Hybrid Algorithm for the Atheer and Berry-Ravindran Algorithms." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 6 (2018): 4321–33. https://doi.org/10.11591/ijece.v8i6.pp4321-4333.

Повний текст джерела

Анотація:

Exact String matching considers is one of the important ways in solving the basic problems in computer science. This research proposed a hybrid exact string matching algorithm called E-Atheer. This algorithm depended on good features; searching and shifting techniques in the Atheer and Berry Ravindran algorithms, respectively. The proposed algorithm showed better performance in number of attempts and character comparisons compared to the original and recent and standard algorithms. E-Atheer algorithm used several types of databases, which are DNA, Protein, XML, Pitch, English, and Source. The

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Jiang, Ya Ping, Yue Xia Tian, and Jun Wei Zhao. "An Improved BMQ Algorithm for Pattern Matching." Advanced Materials Research 998-999 (July 2014): 814–17. http://dx.doi.org/10.4028/www.scientific.net/amr.998-999.814.

Повний текст джерела

Анотація:

Pattern matching algorithm is widely used. It plays an important role in information retrieval, data mining, intrusion detection and other fields. Among them, the BM algorithm is the most common. A new improved algorithm-BMQ algorithm is proposed on the basis of BM and related algorithms. The improved algorithm makes use of uniqueness and combination of the last character and next character of string, to increase the probability of the maximum right shift. Theoretical analysis and experimental comparison shows that the BMQ is better than BM algorithms in the process of string matching and stri

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Khadiev, Kamil, and Vladislav Remidovskii. "Classical and Quantum Algorithms for Assembling a Text from a Dictionary." Nonlinear Phenomena in Complex Systems 24, no. 3 (2021): 207–21. http://dx.doi.org/10.33581/1561-4085-2021-24-3-207-221.

Повний текст джерела

Анотація:

We study algorithms for solving the problem of assembling a text (long string) from a dictionary (a sequence of small strings). The problem has an application in bioinformatics and has a connection with the sequence assembly method for reconstructing a long deoxyribonucleic-acid (DNA) sequence from small fragments. The problem is assembling a string t of length n from strings s1,...,sm. Firstly, we provide a classical (randomized) algorithm with running time Õ(nL0.5 + L) where L is the sum of lengths of s1,...,sm. Secondly, we provide a quantum algorithm with running time Õ(nL0.25 + √mL). Thir

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Baturu, Charles, and Naufal abdi. "Brute Force Algorithm Implementation Of Dictionary Search." Jurnal Info Sains : Informatika dan Sains 10, no. 1 (2020): 24–30. http://dx.doi.org/10.54209/infosains.v10i1.29.

Повний текст джерела

Анотація:

In the manual dictionary the more words are accommodated, the heavier the dictionary. Dictionaries that are generally book-shaped are difficult to carry anywhere because they are thick and heavy. With this mobile-based computer dictionary application, users no longer need to carry heavy dictionaries and the search process will also be faster and easier. This mobile-based kmputer dictionary application is created using the java programming language with the NetBeans 7.0 editor and using an RMS (Record Management System) based database. So it can be installed on various types of mobile phones th

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Nadarajan, Krishnaveny, and Zuriati Ahmad Zukarnain. "Analysis of String Matching Compression Algorithms." Journal of Computer Science 4, no. 3 (2008): 205–10. http://dx.doi.org/10.3844/jcssp.2008.205.210.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Galil, Zvi. "Optimal parallel algorithms for string matching." Information and Control 67, no. 1-3 (1985): 144–57. http://dx.doi.org/10.1016/s0019-9958(85)80031-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Baeza-Yates, Ricardo A., and Luis O. Fuentes. "A framework to animate string algorithms." Information Processing Letters 59, no. 5 (1996): 241–44. http://dx.doi.org/10.1016/0020-0190(96)00117-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Crochemore, M., A. Czumaj, L. Gasieniec, et al. "Speeding up two string-matching algorithms." Algorithmica 12, no. 4-5 (1994): 247–67. http://dx.doi.org/10.1007/bf01185427.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Raskhodnikova, Sofya, Dana Ron, Ronitt Rubinfeld, and Adam Smith. "Sublinear Algorithms for Approximating String Compressibility." Algorithmica 65, no. 3 (2012): 685–709. http://dx.doi.org/10.1007/s00453-012-9618-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Oliveira, R. M., E. S. Helou, and E. F. Costa. "String-averaging incremental stochastic subgradient algorithms." Optimization Methods and Software 34, no. 3 (2018): 665–92. http://dx.doi.org/10.1080/10556788.2018.1496432.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Lecroq, Thierry. "Experimental results on string matching algorithms." Software: Practice and Experience 25, no. 7 (1995): 727–65. http://dx.doi.org/10.1002/spe.4380250703.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

FARO, SIMONE, and THIERRY LECROQ. "EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM." International Journal of Foundations of Computer Science 20, no. 06 (2009): 967–84. http://dx.doi.org/10.1142/s0129054109006991.

Повний текст джерела

Анотація:

In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parallel versions of them obtaining an efficient variant of the BNDM algorithm. Then we compare the newly presented algorithms with some of the most recent and effective string matching algorithms. It turns out that the new proposed variants are very flexible and achieve very good results, especially in the case of large alphabets.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Budimirovic, Nebojsa, and Nebojsa Bacanin. "Novel Algorithms for Graph Clustering Applied to Human Activities." Mathematics 9, no. 10 (2021): 1089. http://dx.doi.org/10.3390/math9101089.

Повний текст джерела

Анотація:

In this paper, a novel algorithm (IBC1) for graph clustering with no prior assumption of the number of clusters is introduced. Furthermore, an additional algorithm (IBC2) for graph clustering when the number of clusters is given beforehand is presented. Additionally, a new measure of evaluation of clustering results is given—the accuracy of formed clusters (T). For the purpose of clustering human activities, the procedure of forming string sequences are presented. String symbols are gained by modeling spatiotemporal signals obtained from inertial measurement units. String sequences provided a

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Liu, Bing, Dan Han, and Shuang Zhang. "Approximate Chinese String Matching Techniques Based on Pinyin Input Method." Applied Mechanics and Materials 513-517 (February 2014): 1017–20. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1017.

Повний текст джерела

Анотація:

String matching is one of the most typical problems in computer science. Previous studies mainly focused on accurate string matching problem. However, with the rapid development of the computer and Internet as well as the continuously rising of new issues, people find that it has very important theoretical value and practical meaning to research and design efficient approximate string matching algorithms. Approximate string matching is also called string matching that allows errors, which mainly aims to find the pattern string in the text and database and allows k differences between the patte

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Mazurenko, A. V., and N. V. Boldyrikhin. "Accelerated preprocessing in task of searching substrings in a string." Vestnik of Don State Technical University 19, no. 3 (2019): 290–300. http://dx.doi.org/10.23947/1992-5980-2019-19-3-290-300.

Повний текст джерела

Анотація:

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 management systems that support associative search. Besides, it is applicable in solving information security issues and creating antivirus programs. Algorithms of searching substring in a string are used in signature-based discovery tasks.Materials and Methods. The solution to the problem is based on the Aho-Corasick algorithm which is a typi

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Akram Abdulrazzaq, Atheer, Nur’Aini Abdul Rashid, and Ahmed Majid Taha. "The Enhanced Hybrid Algorithm for the AbdulRazzaq and Berry-Ravindran Algorithms." International Journal of Engineering & Technology 7, no. 3 (2018): 1709. http://dx.doi.org/10.14419/ijet.v7i3.12436.

Повний текст джерела

Анотація:

Exact string matching is one of the critical issues in the field of computer science. This study proposed a hybrid string matching algorithm called E- AbdulRazzaq. This algorithm used the best properties of two original algorithms; AbdulRazzaq and Berry-Ravindran Algorithms. The proposed algorithm showed an efficient performance in the number of attempts and number of character comparison when compared the original and recent to the standard algorithms. The proposed algorithm was applied in several types of databases, which are DNA sequences, Protein sequences, XML structures, Pitch characters

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Znamenskij, Sergej Vital'evich. "Stable assessment of the quality of similarity algorithms of character strings and their normalizations." Program Systems: Theory and Applications 9, no. 4 (2018): 561–78. http://dx.doi.org/10.25209/2079-3316-2018-9-4-561-578.

Повний текст джерела

Анотація:

The choice of search tools for hidden commonality in the data of a new nature requires stable and reproducible comparative assessments of the quality of abstract algorithms for the proximity of symbol strings. Conventional estimates based on artificially generated or manually labeled tests vary significantly, rather evaluating the method of this artificial generation with respect to similarity algorithms, and estimates based on user data cannot be accurately reproduced. A simple, transparent, objective and reproducible numerical quality assessment of a string metric. Parallel texts of book tra

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Kamil AL-Jazayiri, Hayder, and Atheer Akram AbdulRazzaq. "Enhanced Hybrid Algorithm for E-AbdulRazzaq and Fast Online Hybrid Matching Algorithms for Exact String Matching." Iraqi Journal for Computers and Informatics 50, no. 1 (2024): 20–33. http://dx.doi.org/10.25195/ijci.v50i1.452.

Повний текст джерела

Анотація:

Algorithms for string matching are considered one of the most extensively researched topics in the field of computer science due to their substantial role in various applications, such as information retrieval, editing, security, firewalls, and biological applications. String matching involves examining the optimal alignment by comparing the characters in the pattern and the text. Over the past two decades, it has gained considerable attention due to technological advancements. The need to address string-matching problems has also emerged because of its wide-ranging applications. This study pr

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Khadiev, Kamil, Carlos Manuel Bosch Machado,, Zeyu Chen, and Junde Wu. "Quantum algorithms for SCS and text assembling problems." Quantum Information & Computation 24, no. 3&4 (2024): 267–94. http://dx.doi.org/10.26421/qic24.3-4-4.

Повний текст джерела

Анотація:

In this paper, we consider two versions of the Text Assembling problem. We are given a sequence of strings $s^1,\dots,s^n$ of total length $L$ that is a dictionary, and a string $t$ of length $m$ that is a text. The first version of the problem is assembling $t$ from the dictionary. The second version is the ``Shortest Superstring Problem''(SSP) or the ``Shortest Common Superstring Problem''(SCS). In this case, $t$ is not given, and we should construct the shortest string (we call it superstring) that contains each string from the given sequence as a substring.These problems are connected with

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Irawan, Candra, and Mudafiq Riyan Pratama. "Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android." BIOS : Jurnal Teknologi Informasi dan Rekayasa Komputer 1, no. 2 (2021): 54–60. http://dx.doi.org/10.37148/bios.v1i2.13.

Повний текст джерела

Анотація:

String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm. The Boyer-Moore algorithm is a string matching algorithm published by Robert S. Boyer and J. Strother Moore in 1977. This algorithm is considered the most efficient algorithm in general applications. The Boyer-Moore algorithm starts matching characters from the pattern on the right. While the Brute Force algorithm is an algorithm that matches a pattern with all te

Стилі APA, Harvard, Vancouver, ISO та ін.

49

FirdoseAhmed, Gulfishan, and Nilay Khare. "Hardware based String Matching Algorithms: A Survey." International Journal of Computer Applications 88, no. 11 (2014): 16–19. http://dx.doi.org/10.5120/15396-3898.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Gupta, Sumit, and Akhtar Rasool. "Bit Parallel String Matching Algorithms: A Survey." International Journal of Computer Applications 95, no. 10 (2014): 27–32. http://dx.doi.org/10.5120/16632-6501.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!