Log in

Relevant bibliographies by topics / Exact String-matching Algorithms / Journal articles

To see the other types of publications on this topic, follow the link: Exact String-matching Algorithms.

Journal articles on the topic 'Exact String-matching Algorithms'

Author: Grafiati

Published: 3 June 2025

Last updated: 20 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Exact String-matching Algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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.

Full text

Abstract:

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, and other styles

3

Tarhio, Jorma, Jan Holub, and Emanuele Giaquinta. "Technology beats algorithms (in exact string matching)." Software: Practice and Experience 47, no. 12 (2017): 1877–85. http://dx.doi.org/10.1002/spe.2511.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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.

Full text

Abstract:

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, and other styles

5

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.

Full text

Abstract:

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, and other styles

6

Chen, K. H., G. S. Huang, and R. C. T. Lee. "Bit-Parallel Algorithms for Exact Circular String Matching." Computer Journal 57, no. 5 (2013): 731–43. http://dx.doi.org/10.1093/comjnl/bxt023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zheng, Qiang. "Research on an Single Pattern Matching Algorithm." Advanced Materials Research 433-440 (January 2012): 4468–74. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.4468.

Full text

Abstract:

The design of exact single pattern string matching algorithm with high performance is the basis of all string matching problems. To overcome the defects of low efficiency of pattern matching, this paper improves one of the fastest exact single pattern matching algorithms known on English text, which is SBNDM2。The simplest form of the BNDM core loop is obtained, in which there are only 5 instructions per-character read by amending the relationship between position in the pattern and bit in the bit mask. And a cross-border protection method is added to the algorithm in order to reduce the cost o

APA, Harvard, Vancouver, ISO, and other styles

8

Liu, Na, Fei Xie, and Xindong Wu. "Suffix array for multi-pattern matching with variable length wildcards." Intelligent Data Analysis 25, no. 2 (2021): 283–303. http://dx.doi.org/10.3233/ida-205087.

Full text

Abstract:

Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another algorithm called MMSA-L deals with the long exact characters by the edit distance me

APA, Harvard, Vancouver, ISO, and other styles

9

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.

Full text

Abstract:

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, and other styles

10

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. http://dx.doi.org/10.11591/ijece.v8i6.pp4321-4333.

Full text

Abstract:

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, and other styles

11

AbdulRazzaq, Atheer Akram, Mohammed A. Fadhel, Laith Alzubaidi, and Omran Al-Shamma. "Parallel processing of E-Atheer algorithm using pthread paradigm." Indonesian Journal of Electrical Engineering and Computer Science 30, no. 3 (2023): 1624. http://dx.doi.org/10.11591/ijeecs.v30.i3.pp1624-1633.

Full text

Abstract:

The development in the field of computer technology, and the increase in the growth rate of database, alongside the extraction of certain data from a huge pool of database involve intricate and complex processes. The processes comprise text mining, pattern recognition, retrieval of information and text processing. Thus, the need for enhancing the performance of string matching algorithms is required, which is considered as one of the challenges to the researchers. Consequently, one of the resolution to address this problem is the parallelization for exact string matching algorithms. In this st

APA, Harvard, Vancouver, ISO, and other styles

12

Atheer, Akram AbdulRazzaq, A. Fadhel Mohammed, Alzubaidi Laith, and Al-Shamma Omran. "Parallel processing of E-Atheer algorithm using pthread paradigm." Parallel processing of E-Atheer algorithm using pthread paradigm 30, no. 3 (2023): 1624–33. https://doi.org/10.11591/ijeecs.v30.i3.pp1624-1633.

Full text

Abstract:

The development in the field of computer technology, and the increase in the growth rate of database, alongside the extraction of certain data from a huge pool of database involve intricate and complex processes. The processes comprise text mining, pattern recognition, retrieval of information and text processing. Thus, the need for enhancing the performance of string matching algorithms is required, which is considered as one of the challenges to the researchers. Consequently, one of the resolution to address this problem is the parallelization for exact string matching algorithms. In this st

APA, Harvard, Vancouver, ISO, and other styles

13

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.

Full text

Abstract:

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, and other styles

14

XU, Xiu-lin. "Single pattern string exact matching algorithms based on hybrid strategy." Journal of Computer Applications 28, no. 1 (2008): 232–35. http://dx.doi.org/10.3724/sp.j.1087.2008.00232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Hakak, Saqib Iqbal, Amirrudin Kamsin, Palaiahnakote Shivakumara, Gulshan Amin Gilkar, Wazir Zada Khan, and Muhammad Imran. "Exact String Matching Algorithms: Survey, Issues, and Future Research Directions." IEEE Access 7 (2019): 69614–37. http://dx.doi.org/10.1109/access.2019.2914071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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.

Full text

Abstract:

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, and other styles

17

Akram AbdulRazzaq, Atheer, and Nur’Aini Abdul Rashid. "PARALLEL PROCESSING OUTCOMES OF E-ABDULRAZZAQ ALGORITHM USING MULTI-CORE TECHNIQUE." Iraqi Journal for Computers and Informatics 48, no. 2 (2022): 1–8. http://dx.doi.org/10.25195/ijci.v48i2.463.

Full text

Abstract:

The string matching problem is considered one of the substantial problems in the fields of computer science like speech and pattern recognition, signal and image processing, and artificial intelligence (AI). The increase in the speedup of performance is considered an important factor in meeting the growth rate of databases, Subsequently, one of the determinations to address this issue is the parallelization for exact string matching algorithms. In this study, the E-Abdulrazzaq string matching algorithm is chosen to be executed with the multi-core environment utilizing the OpenMP paradigm which

APA, Harvard, Vancouver, ISO, and other styles

18

Pandey, R. K., and S. Taruna. "Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review." Journal of Physics: Conference Series 1854, no. 1 (2021): 012042. http://dx.doi.org/10.1088/1742-6596/1854/1/012042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

EL EMARY, IBRAHIEM M. M., and MOHAMMED S. M. JABER. "A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM." International Journal of Computational Intelligence and Applications 06, no. 04 (2006): 499–510. http://dx.doi.org/10.1142/s1469026806002040.

Full text

Abstract:

The string matching problem consists of finding one or more, generally all, exact occurrences of a pattern P in a text T. This paper presents a new algorithm for solving the string matching problem. Application of the proposed algorithm assists in improving the search process of a specific pattern in a certain unchangeable text through decreasing the number of character comparisons. Operation concept of such an algorithm depends on pattern reading to obtain the pattern length and the pattern first character and then a search is done in a table of two columns: the first column represents the wo

APA, Harvard, Vancouver, ISO, and other styles

20

Supriyadi, Alam, Septi Andryana, and Aris Gunaryati. "Perancangan Sistem Perpustakaan Berbasis Web." Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi) 6, no. 3 (2022): 395–401. http://dx.doi.org/10.35870/jtik.v6i3.439.

Full text

Abstract:

The research objective is to build a web-based library application. The research method consists of data collection, while the application implementation uses string matching, exact matching, and string matching algorithms. Entity-relationship diagrams are also used in building relationships in the database. Use cases are used as a description of the scope of a system that is built. The conclusion of this study is that; 1) This information facility system is very effective in influencing library admins to look for borrowed books, 2) Providing integration that produces non-digital information i

APA, Harvard, Vancouver, ISO, and other styles

21

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.

Full text

Abstract:

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, and other styles

22

Sahli, Mohammed, and Tetsuo Shibuya. "Max-Shift BM and Max-Shift Horspool: Practical Fast Exact String Matching Algorithms." Journal of Information Processing 20, no. 2 (2012): 419–25. http://dx.doi.org/10.2197/ipsjjip.20.419.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Lovis, C., and R. H. Baud. "Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language." Journal of the American Medical Informatics Association 7, no. 4 (2000): 378–91. http://dx.doi.org/10.1136/jamia.2000.0070378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Budiman, Mohammad Andri, Jos Timanta, and Efelin Siburian. "Implementation and comparison of Berry-Ravindran and Zhu- Takaoka exact string matching algorithms in Indonesian-Batak Toba dictionary." Data Science: Journal of Computing and Applied Informatics 1, no. 1 (2017): 38–44. http://dx.doi.org/10.32734/jocai.v1.i1-67.

Full text

Abstract:

Indonesia has a variety of local languages, which is the Batak Toba language. This time, there are still some Batak Toba people who do not know speak Batak Toba language fluently. Nowadays, desktop based dictionary is one of reference that very efficiently used to learn a language and also to increase vocabulary. In making the dictionary application, string matching can be implemented for word-searching process. String matching have some algorithm, which is Berry – Ravindran algorithm and Zhu-Takaoka algorithm and will be implemented on the dictionary application. Zhu-Takaoka algorithm and Ber

APA, Harvard, Vancouver, ISO, and other styles

25

Almazroi. "A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms." Journal of Computer Science 7, no. 5 (2011): 644–50. http://dx.doi.org/10.3844/jcssp.2011.644.650.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ginting, Guidio Leonarde. "Analisa Algoritma Raita pada Automatic Hyperlink." Prosiding Seminar Nasional Riset Information Science (SENARIS) 1 (September 30, 2019): 886. http://dx.doi.org/10.30645/senaris.v1i0.96.

Full text

Abstract:

Today the development of technology is very rapidly developing which affects various aspects of life. The development of these technologies takes on several important roles such as business, organizational structure and organizational management. The website is a form of information technology development that presents information needed by all people in carrying out their activities such as business, social, and others. Hyperlink is a way that is used to connect a part of a website in the form of files, documents, images or so on. Arranging the appearance of interfaces that are user friendly

APA, Harvard, Vancouver, ISO, and other styles

27

Rautiainen, Mikko, Veli Mäkinen, and Tobias Marschall. "Bit-parallel sequence-to-graph alignment." Bioinformatics 35, no. 19 (2019): 3599–607. http://dx.doi.org/10.1093/bioinformatics/btz162.

Full text

Abstract:

Abstract Motivation Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction and variant calling with respect to a variation graph. Results

APA, Harvard, Vancouver, ISO, and other styles

28

HE, Long-Tao. "A Time Optimal Exact String Matching Algorithm." Journal of Software 16, no. 5 (2005): 676. http://dx.doi.org/10.1360/jos160676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Gunawan, Gunawan, and Aji Sudarsono. "Penerapan Exact String Matching Pencarian Data Pada Sistem Informasi Akademik Berbasis Web." J-SISKO TECH (Jurnal Teknologi Sistem Informasi dan Sistem Komputer TGD) 5, no. 2 (2022): 214. http://dx.doi.org/10.53513/jsk.v5i2.5793.

Full text

Abstract:

Abstrak Proses pengecekan kesalahan pengetikan dengan cara manual akan menghabiskan banyak waktu. Oleh karena itu diperlukan suatu sistem yang mampu mengidentifikasi kesalahan pengetikan agar sesuai dengan kaidah penulisan EYD yang benar aplikasi ini dapat menerapkan metode string matching, dimana aplikasi pencarian pada SMAN 8 Kota Bengkulu telah menerapkan sistem manual yaitu pencatatan pada komputer kemudian diprint. Tujuan penelitian ini adalah membuat aplikasi pencarian data pada Sistem Informasi Akademik SMAN 8 Kota Bengkulu menggunakan metode exact string matching. Penerapan algoritma i

APA, Harvard, Vancouver, ISO, and other styles

30

Jadhav, Ninad Jagadish. "Beowulf Cluster- PXSMAlg Parallel Exact String-Matching Algorithm." IJARCCE 7, no. 11 (2018): 221–25. http://dx.doi.org/10.17148/ijarcce.2018.71147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Al-Dabbagh, Sinan, and Nawaf Barnouti. "A New Efficient Hybrid String Matching Algorithm to Solve the Exact String Matching Problem." British Journal of Mathematics & Computer Science 20, no. 2 (2017): 1–14. http://dx.doi.org/10.9734/bjmcs/2017/30497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Abdulrazzaq, Atheer Akram, Nur’Aini Abdul Rashid, Awsan Hassan Abdullah, Muhannad A. Abu-Hashem, and Zurinahni Zainol. "New Searching Technique of Hybrid Exact String Matching Algorithm." International Review on Computers and Software (IRECOS) 11, no. 10 (2016): 884. http://dx.doi.org/10.15866/irecos.v11i10.10321.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Al-mazroi. "A Fast Hybrid Algorithm for the Exact String Matching Problem." American Journal of Engineering and Applied Sciences 4, no. 1 (2011): 102–7. http://dx.doi.org/10.3844/ajeassp.2011.102.107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Borman, Rohmat Indra. "Penerapan String Matching Dengan Algoritma Boyer Moore Pada Aplikasi Font Italic Untuk Deteksi Kata Asing." Jurnal Teknoinfo 10, no. 2 (2016): 39. http://dx.doi.org/10.33365/jti.v10i2.9.

Full text

Abstract:

Dalam karya ilmiah penulisan untuk kata asing, seperti kata berbahasa inggris, berbahasa yunani dan bahasa lainya dibuat dengan memiringkan kata tersebut. Aplikasi pengolah kata yang biasanya digunakan adalah Microsoft Office Word. Untuk memiringkan kata asing pada Microsoft Office Word menggunakan salah satu tools yang ada di toolbar Microsoft Office Word yaitu italic. Algoritma boyer moore merupakan salah satu algoritma yang digunakan untuk melakukan pencocokan string (string matching). Algoritma ini merupakan jenis exact string matching algorithm yang melakukan pencocokan string secara tepa

APA, Harvard, Vancouver, ISO, and other styles

35

Susik, Robert. "APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING." Informatics Control Measurement in Economy and Environment Protection 7, no. 3 (2017): 47–50. http://dx.doi.org/10.5604/01.3001.0010.5214.

Full text

Abstract:

We consider the application of multiple pattern matching (Multi AOSO on q-Grams) algorithm for approximate pattern matching. We propose the on-line approach which translates the problem from approximate pattern matching into a multiple pattern one (called partitioning into exact search). Presented solution allows relatively fast search multiple patterns in text with given k-differences(or mismatches). This paper presents comparison of solution based on MAG algorithm, and [4]. Experiments on DNA, English, Proteins and XML texts with up to k errors show that the new proposed algorithm achieves r

APA, Harvard, Vancouver, ISO, and other styles

36

Karcioglu, Abdullah Ammar, and Hasan Bulut. "The WM-q multiple exact string matching algorithm for DNA sequences." Computers in Biology and Medicine 136 (September 2021): 104656. http://dx.doi.org/10.1016/j.compbiomed.2021.104656.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Rahim, Robbi, Heri Nurdiyanto, Ansari Saleh A, Dahlan Abdullah, Dedy Hartama, and Darmawan Napitupulu. "Keylogger Application to Monitoring Users Activity with Exact String Matching Algorithm." Journal of Physics: Conference Series 954 (January 2018): 012008. http://dx.doi.org/10.1088/1742-6596/954/1/012008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Mahmood Al-Dabbagh, Sinan Sameer, Nawaf Hazim Barnouti, Mustafa Abdul Sahib Naser, and Zaid G. Ali. "Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP." Journal of Computer and Communications 04, no. 13 (2016): 1–11. http://dx.doi.org/10.4236/jcc.2016.413001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Karcioglu, Abdullah Ammar, and Hasan Bulut. "Improving hash-q exact string matching algorithm with perfect hashing for DNA sequences." Computers in Biology and Medicine 131 (April 2021): 104292. http://dx.doi.org/10.1016/j.compbiomed.2021.104292.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Nainggolan, Efidoren L., Muhammad Syahrizal, and Saidi Ramadan Siregar. "Implementasi Algoritma Raita Pada Aplikasi Hukum Kanonik Berbasis Mobile." JURIKOM (Jurnal Riset Komputer) 7, no. 3 (2020): 455. http://dx.doi.org/10.30865/jurikom.v7i3.2262.

Full text

Abstract:

Canonical law is an internal church law governing the Catholic Church, Eastern Orthodox Church, Eastern Orthodox Church, Anglican Communion. How the laws of the church are governed, interpreted and sometimes examined differ fundamentally between the three church bodies. in all three traditions, a canon was originally a rule accepted by an assembly, these canons formed the basis for canon law. Raita algorithm is part of the exact string matching algorithm, which is matching the string exactly with the arrangement of characters in the matched string that has the same number or sequence of charac

APA, Harvard, Vancouver, ISO, and other styles

41

Ourlis, Lazhar, and Djamel Bellala. "SIMD Implementation of the Aho-Corasick Algorithm using Intel AVX2." Scalable Computing: Practice and Experience 20, no. 3 (2019): 563–76. http://dx.doi.org/10.12694/scpe.v20i3.1572.

Full text

Abstract:

The Aho-Corasick (AC) algorithm is a multiple pattern exact string-matching algorithm proposed by Alfred V. Aho and Margaret J. Corasick. It is used to locate all occurrences of a finite set of patterns within an input text simultaneously. The AC algorithm is in the heart of many applications including digital forensics such as digital signatures demonstrating the authenticity of a digital message or document, full text search (utility programs such as grep, awk and sed of Unix systems), information retrieval (biological sequence analysis and gene identification), intrusion detection systems (

APA, Harvard, Vancouver, ISO, and other styles

42

Zouaghi, Anis, Mounir Zrigui, Georges Antoniadis, and Laroussi Merhbene. "Contribution to Semantic Analysis of Arabic Language." Advances in Artificial Intelligence 2012 (December 25, 2012): 1–8. http://dx.doi.org/10.1155/2012/620461.

Full text

Abstract:

We propose a new approach for determining the adequate sense of Arabic words. For that, we propose an algorithm based on information retrieval measures to identify the context of use that is the closest to the sentence containing the word to be disambiguated. The contexts of use represent a set of sentences that indicates a particular sense of the ambiguous word. These contexts are generated using the words that define the senses of the ambiguous words, the exact string-matching algorithm, and the corpus. We use the measures employed in the domain of information retrieval, Harman, Croft, and O

APA, Harvard, Vancouver, ISO, and other styles

43

Huda, Kadhim Tayyeh, and Sabah Ahmed Al-Jumaili Ahmed. "Classifying confidential data using SVM for efficient cloud query processing." TELKOMNIKA Telecommunication, Computing, Electronics and Control 17, no. 6 (2019): 3155–60. https://doi.org/10.12928/TELKOMNIKA.v17i6.13059.

Full text

Abstract:

Nowadays, organizations are widely using a cloud database engine from the cloud service providers. Privacy still is the main concern for these organizations where every organization is strictly looking forward more secure environment for their own data. Several studies have proposed different types of encryption methods to protect the data over the cloud. However, the daily transactions represented by queries for such databases makes encryption is inefficient solution. Therefore, recent studies presented a mechanism for classifying the data prior to migrate into the cloud. This would reduce th

APA, Harvard, Vancouver, ISO, and other styles

44

Troncoso Espinosa, Fredy Humberto, and Nicolás Esteban Fernández Rozas. "Limpieza, corrección y geocodificación de grandes bases de direcciones utilizando minería de texto." Universidad Ciencia y Tecnología 25, no. 109 (2021): 80–87. http://dx.doi.org/10.47460/uct.v25i109.451.

Full text

Abstract:

Para la georreferenciación de un gran número de direcciones, es necesaria la previa geocodificación mediante sistemas de carácter público o privado. La geocodificación no es una ciencia exacta porque las direcciones generalmente son escritas y almacenadas por personas, lo que provoca diferentes problemas de precisión en el registro, como errores ortográficos, datos innecesarios o falta de datos mínimos. Para enfrentar este problema, en este artículo se describe una metodología que limpia y corrige las direcciones optimizando el proceso de geocodificación utilizando los sistemas existentes. Par

APA, Harvard, Vancouver, ISO, and other styles

45

Breslauer, Dany, Livio Colussi, and Laura Toniolo. "On the Comparison Complexity of the String Prefix-Matching Problem." BRICS Report Series 2, no. 46 (1995). http://dx.doi.org/10.7146/brics.v2i46.19947.

Full text

Abstract:

In this paper we study the exact comparison complexity of the string<br />prefix-matching problem in the deterministic sequential comparison model<br />with equality tests. We derive almost tight lower and upper bounds on<br />the number of symbol comparisons required in the worst case by on-line<br />prefix-matching algorithms for any fixed pattern and variable text. Unlike<br />previous results on the comparison complexity of string-matching and<br />prefix-matching algorithms, our bounds are almost tight for any particular pattern.<br />We also cons

APA, Harvard, Vancouver, ISO, and other styles

46

"Parallel Scalable Approximate Matching Algorithm for Network Intrusion Detection Systems." International Arab Journal of Information Technology 18, no. 1 (2020). http://dx.doi.org/10.34028/iajit/18/1/9.

Full text

Abstract:

Matching algorithms are working to find the exact or the approximate matching between text “T” and pattern “P”, due to the development of a computer processor, which currently contains a set of multi-cores, multitasks can be performed simultaneously. This technology makes these algorithms work in parallel to improve their speed matching performance. Several exact string matching and approximate matching algorithms have been developed to work in parallel to find the correspondence between text “T” and pattern “P”. This paper proposed two models: First, parallelized the Direct Matching Algorithm

APA, Harvard, Vancouver, ISO, and other styles

47

Tarhio, Jorma. "Searching long patterns with BNDM." Software: Practice and Experience, April 4, 2024. http://dx.doi.org/10.1002/spe.3335.

Full text

Abstract:

AbstractWe present new algorithms for exact string matching of long patterns. Our algorithms read ‐grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments. Many of our algorithms were faster than previous methods for English and DNA patterns between 400 and 50,000 in length. Our algorithms were still better when the preprocessing time was taken into account or when the patterns were taken from a different text of the same type.

APA, Harvard, Vancouver, ISO, and other styles

48

Ahmad, Fadel Klaib, Zainol Zurinahni, Hashimah Ahamed Nurul, Ahmad Rosma, and Hussin Wahidah. "Application of Exact String Matching Algorithms towards SMILES Representation of Chemical Structure." October 27, 2007. https://doi.org/10.5281/zenodo.1078645.

Full text

Abstract:

Bioinformatics and Cheminformatics use computer as disciplines providing tools for acquisition, storage, processing, analysis, integrate data and for the development of potential applications of biological and chemical data. A chemical database is one of the databases that exclusively designed to store chemical information. NMRShiftDB is one of the main databases that used to represent the chemical structures in 2D or 3D structures. SMILES format is one of many ways to write a chemical structure in a linear format. In this study we extracted Antimicrobial Structures in SMILES format from NMRSh

APA, Harvard, Vancouver, ISO, and other styles

49

Karcioglu, Abdullah Ammar, and Hasan Bulut. "q ‐frame hash comparison based exact string matching algorithms for DNA sequences." Concurrency and Computation: Practice and Experience, July 26, 2021. http://dx.doi.org/10.1002/cpe.6505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Amir, Ora, Amihood Amir, Aviezri Fraenkel, and David Sarne. "On the Practical Power of Automata in Pattern Matching." SN Computer Science 5, no. 4 (2024). http://dx.doi.org/10.1007/s42979-024-02679-7.

Full text

Abstract:

AbstractMany papers in the intersection of theoretical and applied algorithms show that the simple, asymptotically less efficient algorithm, performs better than the bestcomplex theoretical algorithms on random data or in specialized “real world” applications. This paper considers the Knuth–Morris–Pratt automaton, and shows a counter-intuitive practical result. The classical pattern matching paradigm is that of seeking occurrences of one string—the pattern, in another—the text, where both strings are drawn from an alphabet set $$\Sigma$$ Σ . Assuming the text length is n and the pattern length

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!