Relevant bibliographies by topics / Exact string matching problem

Academic literature on the topic 'Exact string matching problem'

Author: Grafiati
Published: 10 December 2022
Last updated: 29 January 2023

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

Select a source type:

Contents

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 (February 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 (January 10, 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 (January 1, 2011): 102–7. http://dx.doi.org/10.3844/ajeassp.2011.102.107.

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

Markić, Ivan, Maja Štula, Marija Zorić, and Darko Stipaničev. "Entropy-Based Approach in Selection Exact String-Matching Algorithms." Entropy 23, no. 1 (December 28, 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 could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns’ entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

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 (December 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 word length in the text and the second one represents the start positions of each word classified by the same length. After that the algorithm just searches the words of the same length. Our experimental results depend mainly on comparing the performance of our algorithm with the well-known pattern matching algorithms such as Boyer–Moor's and Boyer–Moor–Galil's. The comparison between our algorithm and others are done in terms of the number of characters compared for different sizes of text. The output results show that our algorithm performs better than the others in terms of this parameter.
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 (September 30, 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 relatively good results in practical use.
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 (March 4, 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 method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

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 (June 14, 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 characters in the string. Matching strings on the raita algorithm is done through a shift from the right of the character then to the left of the character and to the middle of the character. The problem in this research is the content of canon law in general consists of a very large number of pages of books, this makes it difficult for canonical law users to find the contents needed, then in the search it takes time to find the contents of canonical law that are searched for too many search problems. that is, too much time must be needed to find the contents of the canonical law sought
APA, Harvard, Vancouver, ISO, and other styles
10

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 of cross-border inspection. Two algorithms named S2BNDM and S2BNDM′ are presented. The experimental results indicate that both S2BNDM and S2BNDM′are faster than SBNDM2 in any case.
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 proposed five new string matching algorithms; BRBMH, BRQS, Odd and Even algorithm (OE), Random String Matching algorithm (RSMA) and Skip Shift New algorithm (SSN). The main purpose behind the proposed algorithms is to reduce the searching response time and the total number of comparisons. They are tested by comparing them with four well- known standard algorithms, Boyer Moore Horspool (BMH), Quick Search (QS), TVSBS and BRFS. This research applied all of the algorithms to sample data files by implementing three types of tests. The number of comparison tests showed a substantial difference in the number of comparisons our algorithms use compared to the non-hybrid algorithms such as QS and BMH. In addition, the tests showed considerable difference between our algorithms and other hybrid algorithm such as TVSBS and BRFS. For instance, the average elapsed search time tests showed that our algorithms presented better average elapsed search time than the BRFS, TVSBS, QS and BMH algorithms, while the average number of tests showed better number of attempts compared to BMH, QS, TVSBS and BRFS algorithms. A new contribution has been added by this research by using the fastest proposed algorithm, the SSN algorithm, to develop a chemical structure searching toolkit to search chemical structures in our local database. The new algorithms were paralleled using OpenMP and MPI parallel models and tested at the University of Science Malaysia (USM) on a Stealth Cluster with different number of threads and processors to improve the speed of searching pattern in the given text which, as we believe, is another contribution.
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:
碩士
國立暨南國際大學
資訊工程學系
96
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、it performs better than 2/|Σ|. For instance、for an English sentence pattern whose length is 50 and a text whose length is 200000、in average、the pattern is shortened to 6% of its original length and the text is shortened to 12.4% of its original length. Thus、the exact matching can be done in a much shorter time.
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:
博士
國立暨南國際大學
資訊工程學系
101
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 $sigma$ symbols. Our analysis uses only elementary techniques in probability theory and avoids applying complicated combinatorics in stringology. We also propose a new algorithm for exact string matching problem under the name Improved BNDM algorithm. The Improved BNDM algorithm uses the $q$-gram filtering technique to speed up the performance of the Turbo BNDM algorithm. The time complexity of the Improved BNDM algorithm achieves $mathcal{O}(n)$ in the worst case and $mathcal{O}(nlog_sigma m/m)$ in the average case where $sigma$ is the alphabet size. It is optimal in both worst case and average case. Another problem we discuss in this dissertation is the exact circular string matching problem. Given a string $P=p_1p_2cdots p_m$, let a string $P^{(i)}=p_ip_{i+1}cdots p_mp_1cdots p_{i-1}$. The exact circular string matching problem is: Given two strings, $T$ of length $n$ and $P$ of length $m$, find all occurrences of $P^{(i)}$ in $T$ for $1leq i leq m$. We propose two algorithms that perform searching of a circular string in the text using bit-parallel technique. Our algorithms use only the composition of bitwise-logical operations and basic arithmetic operations, and apply this technique to solve the problem. These algorithms are given names CSBNDM and $ ext{CSBNDN}_q$, respectively. We give several experiments to verify that they have good performance for random strings and DNA sequence.
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:
碩士
國立清華大學
電機工程學系
100
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 early termination. The algorithm terminates as soon as it discovers that a prefix of the pattern string does not appear in the text string. We show that the discrete convolution method with early termination is quite efficient to solve exact string matching problem for randomly generated text and pattern strings. In this thesis, we also show that the shift-add algorithm is equivalent to and can be implemented by the discrete convolution.
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:
碩士
國立暨南國際大學
生物醫學科技研究所
95
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 is better than Boyer-and-Moore algorithm. But the practice of Boyer-and-Moore algorithm is faster than KMP algorithm. We implement our method in practice. Our method not only is faster than KMP algorithm, Boyer and Moore algorithm, Horspool algorithm and Quick Search algorithm but also is earlier to implement.
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:
碩士
國立暨南國際大學
資訊工程學系
95
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 understand and easy to program.
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 theoretically exact matching feature are still relevant when creating information security systems such as network intrusion detection systems, antivirus, anti-spam, and wormcontainment systems. The real time multi-pattern string matching task has been a major performance bottleneck in such systems. To speed up the recognition process, developers use a reconfigurable hardware platform based on FPGA devices. Such platform provides almost software flexibility and near-ASIC performance. The most important component of a signature-based information security system in terms of efficiency is the recognition module, in which the multipattern matching task is directly solved. It must not only check each byte of input data at speeds of tens and hundreds of gigabits/sec against hundreds of thousand or even millions patterns of signature database, but also change its structure every time a new signature appears or the operating conditions of the protected system change. As a result of the analysis of numerous examples of the development of reconfigurable information security systems, three most promising approaches to the construction of hardware circuits of recognition modules were identified, namely, content-addressable memory based on digital comparators, Bloom filter and Aho–Corasick finite automata. A method for fast quantification of components of recognition module and the entire system was proposed. The method makes it possible to exclude resource-intensive procedures for synthesizing digital circuits on FPGAs when building complex reconfigurable information security systems and their components. To improve the efficiency of the systems under study, structural-level combinational methods are proposed, which allow combining into single recognition device several matching schemes built on different approaches and their modifications, in such a way that their advantages are enhanced and disadvantages are eliminated. In order to achieve the maximum efficiency of combining methods, optimization methods are used. The methods of: parallel combining, sequential cascading and vertical junction have been formulated and investigated. The principle of multi-level combining of combining methods is also considered and researched. Algorithms for the implementation of the proposed combining methods have been developed. Software has been created that allows to conduct experiments with the developed methods and tools. Quantitative estimates are obtained for increasing the efficiency of constructing recognition modules as a result of using combination methods. The issue of optimization of reconfigurable devices presented in hardware description languages is considered. A modification of the method of affine transformations, which allows parallelizing such cycles that cannot be optimized by other methods, was presented. In order to facilitate the practical application of the developed methods and tools, a web service using high-performance computer technologies of grid and cloud computing was considered. The proposed methods to increase efficiency of matching procedure can also be used to solve important problems in other fields of science as data mining, analysis of DNA molecules, etc. Keywords: information security, signature, multi-pattern matching, FPGA, structural combining, efficiency, optimization, hardware description language.
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, 483–94. Berlin, Heidelberg: 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, 289–301. Singapore: 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, 124–42. Tokyo: 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, 824–26. Boston, MA: 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, 477–97. Boston, MA: 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, 31–43. Berlin, Heidelberg: 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, 64–75. Berlin, Heidelberg: 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, 214–21. Berlin, Heidelberg: 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, 230–43. Berlin, Heidelberg: 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, 100–109. Cham: 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. New York, NY, USA: 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. New York, NY, USA: 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

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. Fort Belvoir, VA: Defense Technical Information Center, March 1991. http://dx.doi.org/10.21236/ada237241.

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

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. Fort Belvoir, VA: Defense Technical Information Center, February 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