Relevant bibliographies by topics / Exact string matching problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Exact string matching problem"

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>&nbsp;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.&nbsp;<strong>Methods:</strong>&nbsp;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
More sources

Dissertations / Theses on the topic "Exact string matching problem"

1

Klaib, Ahmad. "Exact string matching algorithms for searching DNA and protein sequences and searching chemical databases." Thesis, University of Huddersfield, 2014. http://eprints.hud.ac.uk/id/eprint/24266/.

Full text
Abstract:
The enormous quantities of biological and chemical files and databases are likely to grow year on year, consequently giving rise to the need to develop string-matching algorithms capable of minimizing the searching response time. Being aware of this need, this thesis aims to develop string matching algorithms to search biological sequences and chemical structures by studying exact string matching algorithms in detail. As a result, this research developed a new classification of string matching algorithms containing eight categories according to the pre-processing function of algorithms and pro
APA, Harvard, Vancouver, ISO, and other styles
2

黎少斌 and Shiao-bun Lai. "Trading off time for space for the string matching problem." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31214216.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lai, Shiao-bun. "Trading off time for space for the string matching problem /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18061795.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Hui-Min, and 陳慧敏. "An Exact String Matching Problem Using Data Encoding Scheme." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/99302180071058684639.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>The traditional exact string matching problem is to find all locations of a pattern string with length m in a text with length n. Here we propose a new encoding method to shorten the both lengths of pattern and text by substituting the substring between a special character for its length in O(m+n). Then we use an exact matching algorithm to solve the exact string matching problem on the encoding pattern and text. As can be seen、by using the encoding method、the pattern and text can be shortened about 2/|Σ| times the lengths of the original ones. In practice、
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Hui-Min. "An Exact String Matching Problem Using Data Encoding Scheme." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200814110600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Kuei-Hao, and 陳奎昊. "Improved Algorithms for Exact String Matching Problems." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/64377810416197972394.

Full text
Abstract:
博士<br>國立暨南國際大學<br>資訊工程學系<br>101<br>In this dissertation, we consider two problems: the exact string matching problem and its variation, the exact circular string matching. The exact string matching problem is: Given two strings, a text $T$ of length $n$ and a pattern $P$ of length $m$, find all occurrences of $P$ in $T$. We propose a strategy to analyze the average performance of the reverse factor algorithm. The analysis is based on the assumption that the text is very long as compared to the length of the pattern, and each symbol in the text is drawn uniformly from a random source with $sigm
APA, Harvard, Vancouver, ISO, and other styles
7

Hou, Kuan-Wei, and 侯冠維. "The Discrete Convolution Method for Solving the Exact String Matching Problem." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/13881027671610839668.

Full text
Abstract:
碩士<br>國立清華大學<br>電機工程學系<br>100<br>In this thesis, we introduce discrete convolution method on solving the exact string matching problem. Based on the assumption that all the text and pattern strings are generated randomly, we derived an equation which can approximate the probability of appearing of a pattern string in a text string. From this equation, we see that the probability that a pattern string appears in a text string reduces to 0 quickly as the length of the pattern string increases. Because of this observation, we introduce an algorithm based on the discrete convolution method with ea
APA, Harvard, Vancouver, ISO, and other styles
8

Liao, Kuei-Hui, and 廖桂慧. "Solving the Exact String Matching Problem by Using the 2-Substring Algorithm." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/46723272181241712677.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>生物醫學科技研究所<br>95<br>String matching is a very important component of many problems, such as data compression, search engine, speech recognition, virus detection, computational biology, and so on. There are many efficient method proposed to solve the string matching problem. For example, KMP algorithm、Boyer-and-Moore algorithm. In this thesis, we proposed a method to solve the exact string matching problem. We proposed a rule, called the 2-substring rule, which avoids the brute force method and can be used to solve the problem. We know the time complexity of KMP algorithm i
APA, Harvard, Vancouver, ISO, and other styles
9

Zhong-He, Chen, and 陳中和. "The Application of Convolution to Suffix to Prefix Rule for the Exact String Matching Problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/55234892315310089339.

Full text
Abstract:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>95<br>In this thesis, we consider the exact string matching problem. We first point out a rule, called the suffix to prefix rule, which can be used to avoid the brute-force sliding window approach. The Backward Nondeterministic DAWG Matching algorithm, Backward Oracle algorithm and Reverse Factor algorithm all use this rule. To implement this rule, we have to find the longest suffix of text T which is equal to a prefix of pattern P. In this thesis, we point out that convolution can be used to do this. As can be seen, the convolution technique is easy to underst
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Zhong-He. "The Application of Convolution to Suffix to Prefix Rule for the Exact String Matching Problem." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2006200719565300.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Exact string matching problem"

1

Lecroq, Thierry, and Christian Charras. Handbook of Exact String Matching Algorithms. King's College Publications, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hilgurt, S. Ya, and O. A. Chemerys. Reconfigurable signature-based information security tools of computer systems. PH “Akademperiodyka”, 2022. http://dx.doi.org/10.15407/akademperiodyka.458.297.

Full text
Abstract:
The book is devoted to the research and development of methods for combining computational structures for reconfigurable signature-based information protection tools for computer systems and networks in order to increase their efficiency. Network security tools based, among others, on such AI-based approaches as deep neural networking, despite the great progress shown in recent years, still suffer from nonzero recognition error probability. Even a low probability of such an error in a critical infrastructure can be disastrous. Therefore, signature-based recognition methods with their theoretic
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Exact string matching problem"

1

Breslauer, Dany, Livio Colussi, and Laura Toniolo. "On the exact complexity of the string prefix-matching problem." In Algorithms — ESA '94. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0049433.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mahmud, Prince, Anisur Rahman, and Kamrul Hasan Talukder. "An Efficient Hashing Method for Exact String Matching Problems." In Data Intelligence and Cognitive Informatics. Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-6460-1_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

de Jesus, Brian Kenneth A., Jeffrey A. Aborot, and Henry N. Adorna. "Solving the Exact Pattern Matching Problem Constrained to Single Occurrence of Pattern P in String S Using Grover’s Quantum Search Algorithm." In Proceedings in Information and Communications Technology. Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54436-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Crochemore, Maxime, and Thierry Lecroq. "Sequential Exact String Matching." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Marzal, Andrés, Ramón Mollineda, Guillermo Penis, and Enrique Vidal. "Cyclic String Matching: Efficient Exact and Approximate Algorithms." In Pattern Recognition and String Matching. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4613-0231-5_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abouelhoda, Mohamed Ibrahim, Enno Ohlebusch, and Stefan Kurtz. "Optimal Exact String Matching Based on Suffix Arrays." In String Processing and Information Retrieval. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45735-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chakaravarthy, Venkatesan T., and Rajasekar Krishnamurthy. "The Problem of Context Sensitive String Matching." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45452-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Navarro, Gonzalo, and Leena Salmela. "Indexing Variable Length Substrings for Exact and Approximate Matching." In String Processing and Information Retrieval. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03784-9_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chi, Lucas, and Kwong Hui. "Color Set Size problem with applications to string matching." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56024-6_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Zhi-Zhong, Bin Ma, and Lusheng Wang. "Randomized and Parameterized Algorithms for the Closest String Problem." In Combinatorial Pattern Matching. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07566-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Exact string matching problem"

1

Olson, Michael, Daniel Davis, and Jae Woong Lee. "An Approach to the Exact Packed String Matching Problem." In NLPIR 2020: 4th International Conference on Natural Language Processing and Information Retrieval. ACM, 2020. http://dx.doi.org/10.1145/3443279.3443296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aborot, Jeffrey A. "An Oracle Design for Grover’s Quantum Search Algorithm for Solving the Exact String Matching Problem." In Seventh Workshop on Computation: Theory and Practice, WCTP 2017. WORLD SCIENTIFIC, 2018. http://dx.doi.org/10.1142/9789813279674_0003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xylogiannopoulos, Konstantinos F. "Exhaustive exact string matching." In ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining. ACM, 2019. http://dx.doi.org/10.1145/3341161.3343517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Branchini, Beatrice, Sofia Breschi, Alberto Zeni, and Marco D. Santambrogio. "Fast Genome Analysis Leveraging Exact String Matching." In 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2022. http://dx.doi.org/10.1109/ipdpsw55747.2022.00032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zubair, Muhammad, Fazal Wahab, Iftikhar Hussain, and Muhammad Ikram. "Text scanning approach for exact string matching." In 2010 International Conference on Networking and Information Technology (ICNIT 2010). IEEE, 2010. http://dx.doi.org/10.1109/icnit.2010.5508548.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zubair, Muhammad, Fazal Wahab, Iftikhar Hussain, and Junaid Zaffar. "Improved text scanning approach for exact String matching." In 2010 International Conference on Information and Emerging Technologies (ICIET). IEEE, 2010. http://dx.doi.org/10.1109/iciet.2010.5625719.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abdulrazzaq, Atheer Akram, Nur'Aini Abdul Rashid, and Ayad Hussain Abdulkader Alezzi. "Parallel processing of hybrid exact string matching algorithm." In 2013 IEEE International Conference on Control System, Computing and Engineering (ICCSCE). IEEE, 2013. http://dx.doi.org/10.1109/iccsce.2013.6719959.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sahota, Vijay, Maozhen Li, and Richard Bayford. "A novel algorithm for online exact string matching." In 2013 Third International Conference on Innovative Computing Technology (INTECH). IEEE, 2013. http://dx.doi.org/10.1109/intech.2013.6653702.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Klein, Shmuel T., and Dana Shapira. "The String-to-Dictionary Matching Problem." In 2011 Data Compression Conference (DCC). IEEE, 2011. http://dx.doi.org/10.1109/dcc.2011.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Yangjun, and Yujia Wu. "On the massive string matching problem." In 2016 12th International Conference on Natural Computation and 13th Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). IEEE, 2016. http://dx.doi.org/10.1109/fskd.2016.7603199.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Exact string matching problem"

1

James, Richard J. E., Hyungseo Kim, Lucy Hitcham, and Richard J. Tunney. Causal inference methods in gambling research. Greo Evidence Insights, 2023. https://doi.org/10.33684/2024.004.

Full text
Abstract:
The purpose of this project was to review and utilise methods from other disciplines in the social sciences in order to be able make stronger causal claims using crosssectional gambling data such as gambling prevalence studies. We focused on the question of whether there is a causal relationship between specific gambling products and individual gambling harms, specifically problem gambling. There has been an existing literature that has looked at this issue, but fails to control for selection biases on engagement with specific gambling behaviours. We reviewed and used three approaches: propens
APA, Harvard, Vancouver, ISO, and other styles
2

Miller, D. L., J. F. Pekny, and G. L. Thompson. AN Exact Algorithm for Finding Undirected Hamiltonian Cycles Based on a Two-Matching Problem Relaxation. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada237241.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Miller, D. L., J. F. Pekny, and G. L. Thompson. An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada237878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Exact string matching problem' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography