Log in

Relevant bibliographies by topics / Exact string matching problem / Journal articles

To see the other types of publications on this topic, follow the link: Exact string matching problem.

Journal articles on the topic 'Exact string matching problem'

Author: Grafiati

Published: 10 December 2022

Last updated: 31 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 problem.'

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

Faro, Simone, and Thierry Lecroq. "The exact online string matching problem." ACM Computing Surveys 45, no. 2 (2013): 1–42. http://dx.doi.org/10.1145/2431211.2431212.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

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

4

M, J. Roopa, and Mahantesh K. "Classification and Recognition of Bilingual Text Using Graph Edit Distance Based Degree of Similarity." Indian Journal of Science and Technology 15, no. 27 (2022): 1336–43. https://doi.org/10.17485/IJST/v15i27.2405.

Full text

Abstract:

Abstract <strong>Objectives:</strong> Graph Edit distance-based classification and recognition method is introduced in this study for bilingual characters. Specifically, this method aims to classify characters first and then recognize them in the 2nd level. <strong>Methods:</strong> This study combines both exact graph matching and inexact graph matching techniques to achieve better Recognition. The exact graph matching technique classifies characters by considering the number of vertices and edges as features to classify. Inexact graph matching uses an algorithmic model to meas

APA, Harvard, Vancouver, ISO, and other styles

5

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

6

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

7

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

8

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

9

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

10

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

11

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

12

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

13

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

14

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

15

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

16

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

17

Son, Nguyen Van, Le Thanh Huong, and Nguyen Chi Thanh. "A two-phase plagiarism detection system based on multi-layer long short-term memory networks." IAES International Journal of Artificial Intelligence (IJ-AI) 10, no. 3 (2021): 636. http://dx.doi.org/10.11591/ijai.v10.i3.pp636-648.

Full text

Abstract:

Finding plagiarism strings between two given documents are the main task of the plagiarism detection problem. Traditional approaches based on string matching are not very useful in cases of similar semantic plagiarism. Deep learning approaches solve this problem by measuring the semantic similarity between pairs of sentences. However, these approaches still face the following challenging points. First, it is impossible to solve cases where only part of a sentence belongs to a plagiarism passage. Second, measuring the sentential similarity without considering the context of surrounding sentence

APA, Harvard, Vancouver, ISO, and other styles

18

Nguyen, Van Son, Thanh Huong Le, and Chi Thanh Nguyen. "A two-phase plagiarism detection system based on multi-layer long short-term memory networks." International Journal of Artificial Intelligence (IJ-AI) 10, no. 3 (2021): 636–48. https://doi.org/10.11591/ijai.v10.i3.pp636-648.

Full text

Abstract:

Finding plagiarism strings between two given documents are the main task of the plagiarism detection problem. Traditional approaches based on string matching are not very useful in cases of similar semantic plagiarism. Deep learning approaches solve this problem by measuring the semantic similarity between pairs of sentences. However, these approaches still face the following challenging points. First, it is impossible to solve cases where only part of a sentence belongs to a plagiarism passage. Second, measuring the sentential similarity without considering the context of surrounding sentence

APA, Harvard, Vancouver, ISO, and other styles

19

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

20

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

21

HONKAPOHJA, Alpo, Jacob Thaisen, and Anders Nøklestad. "A search tool based on language modelling developed for The Index of Middle English Prose." Open Research Europe 3 (November 14, 2023): 197. http://dx.doi.org/10.12688/openreseurope.16590.1.

Full text

Abstract:

Non-standardised early vernaculars present a problem for search tools due to the high degree of variation. The challenge lies in the variation found in orthography, syntax, and lexicon between titles, incipits, and explicits in manuscript copies of the same work. Traditional search methods relying on exact string matching or regular expressions fail to address these variations comprehensively. This project presents a web-based search tool specifically designed to handle linguistic and textual variation. The software is made available as a part of the Index of Middle English Prose (IMEP). The s

APA, Harvard, Vancouver, ISO, and other styles

22

HONKAPOHJA, Alpo, Jacob Thaisen, and Anders Nøklestad. "A search tool based on language modelling developed for The Index of Middle English Prose." Open Research Europe 3 (March 11, 2024): 197. http://dx.doi.org/10.12688/openreseurope.16590.2.

Full text

Abstract:

Non-standardised early vernaculars present a problem for search tools due to the high degree of variation. The challenge lies in the variation found in orthography, syntax, and lexicon between titles, incipits, and explicits in manuscript copies of the same work. Traditional search methods relying on exact string matching or regular expressions fail to address these variations comprehensively. This project presents a web-based search tool specifically designed to handle linguistic and textual variation. The software is made available as a part of the Index of Middle English Prose (IMEP). The s

APA, Harvard, Vancouver, ISO, and other styles

23

de Jager, Coenrad, and Marinda Nel. "Business Process Automation: A Workflow Incorporating Optical Character Recognition and Approximate String and Pattern Matching for Solving Practical Industry Problems." Applied System Innovation 2, no. 4 (2019): 33. http://dx.doi.org/10.3390/asi2040033.

Full text

Abstract:

Companies are relying more on artificial intelligence and machine learning in order to enhance and automate existing business processes. While the power of OCR (Optical Character Recognition) technologies can be harnessed for the digitization of image data, the digitalized text still needs to be validated and enhanced to ensure that data quality standards are met for the data to be usable. This research paper focuses on finding and creating an automated workflow that can follow image digitization and produce a dictionary consisting of the desired information. The workflow introduced consists o

APA, Harvard, Vancouver, ISO, and other styles

24

Na, Joong Chae, Youngjoon Kim, Seokchul Kang, and Jeong Seop Sim. "Order-Preserving Pattern Matching with Partition." Mathematics 12, no. 21 (2024): 3381. http://dx.doi.org/10.3390/math12213381.

Full text

Abstract:

Order-preserving pattern matching, which considers the relative orders of strings, can be applied to time-series data analysis. To perform a more meaningful analysis of time-series data, approximate criteria for the order-isomorphism are necessary, considering diverse types of errors. In this paper, we introduce a novel approximation criterion for the order-isomorphism, called the partitioned order-isomorphism. We then propose an efficient O(n+sort(m))-time algorithm for the order-preserving pattern matching problem considering the criterion of partition. A comparative experiment demonstrates

APA, Harvard, Vancouver, ISO, and other styles

25

Saad, Rachid. "Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP." Combinatorics, Probability and Computing 5, no. 3 (1996): 297–306. http://dx.doi.org/10.1017/s0963548300002054.

Full text

Abstract:

Jackson [10] gave a polynomial sufficient condition for a bipartite tournament to contain a cycle of a given length. The question arises as to whether deciding on the maximum length of a cycle in a bipartite tournament is polynomial. The problem was considered by Manoussakis [12] in the slightly more general setting of 2-edge coloured complete graphs: is it polynomial to find a longest alternating cycle in such coloured graphs? In this paper, strong evidence is given that such an algorithm exists. In fact, using a reduction to the well known exact matching problem, we prove that the problem is

APA, Harvard, Vancouver, ISO, and other styles

26

Zhang, Yufeng, Jinghao Zhang, Zeyu Cui, Shu Wu, and Liang Wang. "A Graph-based Relevance Matching Model for Ad-hoc Retrieval." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 5 (2021): 4688–96. http://dx.doi.org/10.1609/aaai.v35i5.16599.

Full text

Abstract:

To retrieve more relevant, appropriate and useful documents given a query, finding clues about that query through the text is crucial. Recent deep learning models regard the task as a term-level matching problem, which seeks exact or similar query patterns in the document. However, we argue that they are inherently based on local interactions and do not generalise to ubiquitous, non-consecutive contextual relationships. In this work, we propose a novel relevance matching model based on graph neural networks to leverage the document-level word relationships for ad-hoc retrieval. In addition to

APA, Harvard, Vancouver, ISO, and other styles

27

Lucibello, C., and F. Ricci-Tersenghi. "The Statistical Mechanics of Random Set Packing and a Generalization of the Karp-Sipser Algorithm." International Journal of Statistical Mechanics 2014 (March 10, 2014): 1–13. http://dx.doi.org/10.1155/2014/136829.

Full text

Abstract:

We analyse the asymptotic behaviour of random instances of the maximum set packing (MSP) optimization problem, also known as maximum matching or maximum strong independent set on hypergraphs. We give an analytic prediction of the MSPs size using the 1RSB cavity method from statistical mechanics of disordered systems. We also propose a heuristic algorithm, a generalization of the celebrated Karp-Sipser one, which allows us to rigorously prove that the replica symmetric cavity method prediction is exact for certain problem ensembles and breaks down when a core survives the leaf removal process.

APA, Harvard, Vancouver, ISO, and other styles

28

Sheu, C. Y., F. Kurz, and P. Angelo. "AUTOMATIC 3D LANE MARKING RECONSTRUCTION USING MULTI-VIEW AERIAL IMAGERY." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences IV-1 (September 26, 2018): 147–54. http://dx.doi.org/10.5194/isprs-annals-iv-1-147-2018.

Full text

Abstract:

<p><strong>Abstract.</strong> The 3D information of road infrastructures are gaining importance with the development of autonomous driving. The exact absolute position and height of lane markings, for example, support lane-accurate localization. Several approaches have been proposed for the 3D reconstruction of line features from multi-view airborne optical imagery. However, standard appearance-based matching approaches for 3D reconstruction are hardly applicable on lane markings due to the similar color profile of all lane markings and the lack of textures in their neighbori

APA, Harvard, Vancouver, ISO, and other styles

29

Qian, Chao, Yang Yu, and Zhi-Hua Zhou. "Analyzing Evolutionary Optimization in Noisy Environments." Evolutionary Computation 26, no. 1 (2018): 1–41. http://dx.doi.org/10.1162/evco_a_00170.

Full text

Abstract:

Many optimization tasks must be handled in noisy environments, where the exact evaluation of a solution cannot be obtained, only a noisy one. For optimization of noisy tasks, evolutionary algorithms (EAs), a type of stochastic metaheuristic search algorithm, have been widely and successfully applied. Previous work mainly focuses on the empirical study and design of EAs for optimization under noisy conditions, while the theoretical understandings are largely insufficient. In this study, we first investigate how noisy fitness can affect the running time of EAs. Two kinds of noise-helpful problem

APA, Harvard, Vancouver, ISO, and other styles

30

Haj Rachid, Maan. "Two Efficient Techniques to Find Approximate Overlaps between Sequences." BioMed Research International 2017 (2017): 1–8. http://dx.doi.org/10.1155/2017/2731385.

Full text

Abstract:

The next-generation sequencing (NGS) technology outputs a huge number of sequences (reads) that require further processing. After applying prefiltering techniques in order to eliminate redundancy and to correct erroneous reads, an overlap-based assembler typically finds the longest exact suffix-prefix match between each ordered pair of the input reads. However, another trend has been evolving for the purpose of solving an approximate version of the overlap problem. The main benefit of this direction is the ability to skip time-consuming error-detecting techniques which are applied in the prefi

APA, Harvard, Vancouver, ISO, and other styles

31

Mertzios, George B., Hendrik Molter, and Viktor Zamaraev. "Sliding Window Temporal Graph Coloring." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 7667–74. http://dx.doi.org/10.1609/aaai.v33i01.33017667.

Full text

Abstract:

Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static graphs, which often stand in stark contrast to practice where data is inherently dynamic and subject to discrete changes over time. A temporal graph is a graph whose edges are assigned a set of integer time labels, indicating at which discrete time steps the edge is active. In this paper we present a natural temporal extension of the classical graph coloring pr

APA, Harvard, Vancouver, ISO, and other styles

32

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

33

Ďurian, Branislav, Jan Holub, Hannu Peltola, and Jorma Tarhio. "Improving practical exact string matching." Information Processing Letters 110, no. 4 (2010): 148–52. http://dx.doi.org/10.1016/j.ipl.2009.11.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

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

35

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

36

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

37

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

38

Hyyrö, Heikki, Martti Juhola, and Mauno Vihinen. "On exact string matching of unique oligonucleotides." Computers in Biology and Medicine 35, no. 2 (2005): 173–81. http://dx.doi.org/10.1016/j.compbiomed.2003.11.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

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

40

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

41

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.

Full text

Abstract:

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

42

Klein, S. T., and D. Shapira. "The String-to-Dictionary Matching Problem." Computer Journal 55, no. 11 (2012): 1347–56. http://dx.doi.org/10.1093/comjnl/bxs004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

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

44

Navarro, Gonzalo, and Kimmo Fredriksson. "Average complexity of exact and approximate multiple string matching." Theoretical Computer Science 321, no. 2-3 (2004): 283–90. http://dx.doi.org/10.1016/j.tcs.2004.03.058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Galil, Zvi, and Raffaele Giancarlo. "On the Exact Complexity of String Matching: Lower Bounds." SIAM Journal on Computing 20, no. 6 (1991): 1008–20. http://dx.doi.org/10.1137/0220063.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Galil, Zvi, and Raffaele Giancarlo. "On the Exact Complexity of String Matching: Upper Bounds." SIAM Journal on Computing 21, no. 3 (1992): 407–37. http://dx.doi.org/10.1137/0221028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Nettleton, David F., and Julian Salas. "Approximate Matching of Neighborhood Subgraphs — An Ordered String Graph Levenshtein Method." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 24, no. 03 (2016): 411–31. http://dx.doi.org/10.1142/s0218488516500215.

Full text

Abstract:

Given that exact pair-wise graph matching has a high computational cost, different representational schemes and matching methods have been devised in order to make matching more efficient. Such methods include representing the graphs as tree structures, transforming the structures into strings and then calculating the edit distance between those strings. However many coding schemes are complex and are computationally expensive. In this paper, we present a novel coding scheme for unlabeled graphs and perform some empirical experiments to evaluate its precision and cost for the matching of neigh

APA, Harvard, Vancouver, ISO, and other styles

48

Dimitrova, Mariya, Georgi Zhelezov, Teodor Georgiev, and Lyubomir Penev. "The Pensoft Annotator: A new tool for text annotation with ontology terms." Biodiversity Information Science and Standards 4 (September 28, 2020): e59042. https://doi.org/10.3897/biss.4.59042.

Full text

Abstract:

IntroductionDigitisation of biodiversity knowledge from collections, scholarly literature and various research documents is an ongoing mission of the Biodiversity Information Standards (TDWG) community. Organisations such as the Biodiversity Heritage Library make historical biodiversity literature openly available and develop tools to allow biodiversity data reuse and interoperability. For instance, Plazi transforms free text into machine-readable formats and extracts collection data and feeds it into the Global Biodiversity Information Facility (GBIF) and other aggregators. All of these digit

APA, Harvard, Vancouver, ISO, and other styles

49

Suwarningsih, Wiwin, and Nuryani Nuryani. "Generate fuzzy string-matching to build self attention on Indonesian medical-chatbot." International Journal of Electrical and Computer Engineering (IJECE) 14, no. 1 (2024): 819. http://dx.doi.org/10.11591/ijece.v14i1.pp819-829.

Full text

Abstract:

Chatbot is a form of interactive conversation that requires quick and precise answers. The process of identifying answers to users’ questions involves string matching and handling incorrect spelling. Therefore, a system that can independently predict and correct letters is highly necessary. The approach used to address this issue is to enhance the fuzzy string-matching method by incorporating several features for self-attention. The combination of fuzzy string-matching methods employed includes Jaro Winkler distance + Levenshtein Damerau distance and Damerau Levenshtein + Rabin Carp. The reaso

APA, Harvard, Vancouver, ISO, and other styles

50

Suwarningsih, Wiwin, and Nuryani Nuryani. "Generate fuzzy string-matching to build self attention on Indonesian medical-chatbot." International Journal of Electrical and Computer Engineering (IJECE) 14, no. 1 (2024): 819–29. https://doi.org/10.11591/ijece.v14i1.pp819-829.

Full text

Abstract:

Chatbot is a form of interactive conversation that requires quick and precise answers. The process of identifying answers to users’ questions involves string matching and handling incorrect spelling. Therefore, a system that can independently predict and correct letters is highly necessary. The approach used to address this issue is to enhance the fuzzy string-matching method by incorporating several features for self-attention. The combination of fuzzy string-matching methods employed includes Jaro Winkler distance + Levenshtein Damerau distance and Damerau Levenshtein + Rabin Carp. The

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!