Добірка наукової літератури з теми "Exact string matching problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Exact string matching problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Exact string matching problem"
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаДисертації з теми "Exact string matching problem"
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/.
Повний текст джерела黎少斌 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.
Повний текст джерела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.
Повний текст джерелаChen, Hui-Min, and 陳慧敏. "An Exact String Matching Problem Using Data Encoding Scheme." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/99302180071058684639.
Повний текст джерела國立暨南國際大學
資訊工程學系
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.
Chen, Hui-Min. "An Exact String Matching Problem Using Data Encoding Scheme." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200814110600.
Повний текст джерелаChen, Kuei-Hao, and 陳奎昊. "Improved Algorithms for Exact String Matching Problems." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/64377810416197972394.
Повний текст джерела國立暨南國際大學
資訊工程學系
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.
Hou, Kuan-Wei, and 侯冠維. "The Discrete Convolution Method for Solving the Exact String Matching Problem." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/13881027671610839668.
Повний текст джерела國立清華大學
電機工程學系
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.
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.
Повний текст джерела國立暨南國際大學
生物醫學科技研究所
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.
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.
Повний текст джерела國立暨南國際大學
資訊工程學系
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.
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.
Повний текст джерелаКниги з теми "Exact string matching problem"
Lecroq, Thierry, and Christian Charras. Handbook of Exact String Matching Algorithms. King's College Publications, 2004.
Знайти повний текст джерела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.
Повний текст джерелаЧастини книг з теми "Exact string matching problem"
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаТези доповідей конференцій з теми "Exact string matching problem"
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаЗвіти організацій з теми "Exact string matching problem"
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.
Повний текст джерела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.
Повний текст джерела