Статті в журналах з теми "Exact string matching problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Exact string matching problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерела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 (September 1, 2021): 636. http://dx.doi.org/10.11591/ijai.v10.i3.pp636-648.
Повний текст джерела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 (December 1, 2018): 4321. http://dx.doi.org/10.11591/ijece.v8i6.pp4321-4333.
Повний текст джерела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 (May 1, 2011): 644–50. http://dx.doi.org/10.3844/jcssp.2011.644.650.
Повний текст джерела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 (October 24, 2019): 33. http://dx.doi.org/10.3390/asi2040033.
Повний текст джерелаSaad, Rachid. "Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP." Combinatorics, Probability and Computing 5, no. 3 (September 1996): 297–306. http://dx.doi.org/10.1017/s0963548300002054.
Повний текст джерела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 (May 18, 2021): 4688–96. http://dx.doi.org/10.1609/aaai.v35i5.16599.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаQian, Chao, Yang Yu, and Zhi-Hua Zhou. "Analyzing Evolutionary Optimization in Noisy Environments." Evolutionary Computation 26, no. 1 (March 2018): 1–41. http://dx.doi.org/10.1162/evco_a_00170.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаLecroq, Thierry. "Fast exact string matching algorithms." Information Processing Letters 102, no. 6 (June 2007): 229–35. http://dx.doi.org/10.1016/j.ipl.2007.01.002.
Повний текст джерелаĎurian, Branislav, Jan Holub, Hannu Peltola, and Jorma Tarhio. "Improving practical exact string matching." Information Processing Letters 110, no. 4 (January 2010): 148–52. http://dx.doi.org/10.1016/j.ipl.2009.11.010.
Повний текст джерела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 (July 22, 2022): 214. http://dx.doi.org/10.53513/jsk.v5i2.5793.
Повний текст джерела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.
Повний текст джерелаHyyrö, Heikki, Martti Juhola, and Mauno Vihinen. "On exact string matching of unique oligonucleotides." Computers in Biology and Medicine 35, no. 2 (February 2005): 173–81. http://dx.doi.org/10.1016/j.compbiomed.2003.11.003.
Повний текст джерелаTarhio, Jorma, Jan Holub, and Emanuele Giaquinta. "Technology beats algorithms (in exact string matching)." Software: Practice and Experience 47, no. 12 (August 1, 2017): 1877–85. http://dx.doi.org/10.1002/spe.2511.
Повний текст джерелаJadhav, Ninad Jagadish. "Beowulf Cluster- PXSMAlg Parallel Exact String-Matching Algorithm." IJARCCE 7, no. 11 (November 30, 2018): 221–25. http://dx.doi.org/10.17148/ijarcce.2018.71147.
Повний текст джерелаChen, K. H., G. S. Huang, and R. C. T. Lee. "Bit-Parallel Algorithms for Exact Circular String Matching." Computer Journal 57, no. 5 (March 3, 2013): 731–43. http://dx.doi.org/10.1093/comjnl/bxt023.
Повний текст джерелаBorman, Rohmat Indra. "Penerapan String Matching Dengan Algoritma Boyer Moore Pada Aplikasi Font Italic Untuk Deteksi Kata Asing." Jurnal Teknoinfo 10, no. 2 (July 15, 2016): 39. http://dx.doi.org/10.33365/jti.v10i2.9.
Повний текст джерелаKlein, S. T., and D. Shapira. "The String-to-Dictionary Matching Problem." Computer Journal 55, no. 11 (February 17, 2012): 1347–56. http://dx.doi.org/10.1093/comjnl/bxs004.
Повний текст джерела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 (October 31, 2016): 884. http://dx.doi.org/10.15866/irecos.v11i10.10321.
Повний текст джерелаNavarro, Gonzalo, and Kimmo Fredriksson. "Average complexity of exact and approximate multiple string matching." Theoretical Computer Science 321, no. 2-3 (August 2004): 283–90. http://dx.doi.org/10.1016/j.tcs.2004.03.058.
Повний текст джерелаGalil, Zvi, and Raffaele Giancarlo. "On the Exact Complexity of String Matching: Lower Bounds." SIAM Journal on Computing 20, no. 6 (December 1991): 1008–20. http://dx.doi.org/10.1137/0220063.
Повний текст джерелаGalil, Zvi, and Raffaele Giancarlo. "On the Exact Complexity of String Matching: Upper Bounds." SIAM Journal on Computing 21, no. 3 (June 1992): 407–37. http://dx.doi.org/10.1137/0221028.
Повний текст джерела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.
Повний текст джерелаXU, Xiu-lin. "Single pattern string exact matching algorithms based on hybrid strategy." Journal of Computer Applications 28, no. 1 (June 30, 2008): 232–35. http://dx.doi.org/10.3724/sp.j.1087.2008.00232.
Повний текст джерелаCole, Richard, Ramesh Hariharan, Mike Paterson, and Uri Zwick. "Tighter Lower Bounds on the Exact Complexity of String Matching." SIAM Journal on Computing 24, no. 1 (February 1995): 30–45. http://dx.doi.org/10.1137/s0097539793245829.
Повний текст джерелаCole, Richard, and Ramesh Hariharan. "Tighter Upper Bounds on the Exact Complexity of String Matching." SIAM Journal on Computing 26, no. 3 (June 1997): 803–56. http://dx.doi.org/10.1137/s009753979324694x.
Повний текст джерелаHakak, Saqib Iqbal, Amirrudin Kamsin, Palaiahnakote Shivakumara, Gulshan Amin Gilkar, Wazir Zada Khan, and Muhammad Imran. "Exact String Matching Algorithms: Survey, Issues, and Future Research Directions." IEEE Access 7 (2019): 69614–37. http://dx.doi.org/10.1109/access.2019.2914071.
Повний текст джерелаCormode, Graham, and S. Muthukrishnan. "The string edit distance matching problem with moves." ACM Transactions on Algorithms 3, no. 1 (February 2007): 1–19. http://dx.doi.org/10.1145/1186810.1186812.
Повний текст джерела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 (June 2016): 411–31. http://dx.doi.org/10.1142/s0218488516500215.
Повний текст джерелаBERGERON, ANNE, and SYLVIE HAMEL. "VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING." International Journal of Foundations of Computer Science 13, no. 01 (February 2002): 53–65. http://dx.doi.org/10.1142/s0129054102000947.
Повний текст джерелаKelsey, Tom, and Lars Kotthoff. "Exact Closest String as a Constraint Satisfaction Problem." Procedia Computer Science 4 (2011): 1062–71. http://dx.doi.org/10.1016/j.procs.2011.04.113.
Повний текст джерелаRae, Gordon. "Exact Probabilities for the General Matching Problem." Educational and Psychological Measurement 56, no. 5 (October 1996): 839–42. http://dx.doi.org/10.1177/0013164496056005011.
Повний текст джерелаDutta Roy, S. C. "Exact solution of a bandpass matching problem." Circuits, Systems, and Signal Processing 19, no. 1 (January 2000): 59–69. http://dx.doi.org/10.1007/bf01229992.
Повний текст джерелаVardulakis, A. I. G., and N. Karcanias. "On the stable exact model matching problem." Systems & Control Letters 5, no. 4 (February 1985): 237–42. http://dx.doi.org/10.1016/0167-6911(85)90015-5.
Повний текст джерелаPandey, R. K., and S. Taruna. "Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review." Journal of Physics: Conference Series 1854, no. 1 (April 1, 2021): 012042. http://dx.doi.org/10.1088/1742-6596/1854/1/012042.
Повний текст джерелаFadlil, Abdul, Sunardi Sunardi, and Rezki Ramdhani. "Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms." INTENSIF: Jurnal Ilmiah Penelitian dan Penerapan Teknologi Sistem Informasi 6, no. 2 (August 13, 2022): 253–70. http://dx.doi.org/10.29407/intensif.v6i2.18141.
Повний текст джерелаKarcioglu, Abdullah Ammar, and Hasan Bulut. "The WM-q multiple exact string matching algorithm for DNA sequences." Computers in Biology and Medicine 136 (September 2021): 104656. http://dx.doi.org/10.1016/j.compbiomed.2021.104656.
Повний текст джерела