Статті в журналах з теми "Approximate string matching problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Approximate string matching problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерела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.
Повний текст джерелаBertossi, A. A., F. Luccio, L. Pagli, and E. Lodi. "A Parallel Solution to the Approximate String Matching Problem." Computer Journal 35, no. 5 (October 1, 1992): 524–26. http://dx.doi.org/10.1093/comjnl/35.5.524.
Повний текст джерелаYang, Zhenglu, Jianjun Yu, and Masaru Kitsuregawa. "Fast Algorithms for Top-k Approximate String Matching." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 5, 2010): 1467–73. http://dx.doi.org/10.1609/aaai.v24i1.7527.
Повний текст джерела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.
Повний текст джерелаWang, J. F., Z. R. Li, C. Z. Cai, and Y. Z. Chen. "Assessment of approximate string matching in a biomedical text retrieval problem." Computers in Biology and Medicine 35, no. 8 (October 2005): 717–24. http://dx.doi.org/10.1016/j.compbiomed.2004.06.002.
Повний текст джерелаSadeh, Ilan. "Universal Data Compression Algorithm Based on Approximate String Matching." Probability in the Engineering and Informational Sciences 10, no. 4 (October 1996): 465–86. http://dx.doi.org/10.1017/s0269964800004502.
Повний текст джерелаAhmed, Pritom, A. S. M. Shohidull Islam, and M. Sohel Rahman. "A graph-theoretic model to solve the approximate string matching problem allowing for translocations." Journal of Discrete Algorithms 23 (November 2013): 143–56. http://dx.doi.org/10.1016/j.jda.2013.08.004.
Повний текст джерелаFREDRIKSSON, KIMMO, VELI MÄKINEN, and GONZALO NAVARRO. "FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME." International Journal of Foundations of Computer Science 17, no. 06 (December 2006): 1345–64. http://dx.doi.org/10.1142/s0129054106004455.
Повний текст джерелаŠIMŮNEK, MARTIN, and BOŘIVOJ MELICHAR. "BORDERS AND FINITE AUTOMATA." International Journal of Foundations of Computer Science 18, no. 04 (August 2007): 859–71. http://dx.doi.org/10.1142/s0129054107005029.
Повний текст джерела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.
Повний текст джерелаCANTONE, DOMENICO, SALVATORE CRISTOFARO та SIMONE FARO. "NEW EFFICIENT BIT-PARALLEL ALGORITHMS FOR THE (δ, α)-MATCHING PROBLEM WITH APPLICATIONS IN MUSIC INFORMATION RETRIEVAL". International Journal of Foundations of Computer Science 20, № 06 (грудень 2009): 1087–108. http://dx.doi.org/10.1142/s0129054109007054.
Повний текст джерелаFONTAINE, MARC, STEFAN BURKHARDT, and JUHA KÄRKKÄINEN. "BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS." International Journal of Foundations of Computer Science 16, no. 06 (December 2005): 1121–34. http://dx.doi.org/10.1142/s0129054105003698.
Повний текст джерелаHalappanavar, Mahantesh, John Feo, Oreste Villa, Antonino Tumeo, and Alex Pothen. "Approximate weighted matching on emerging manycore and multithreaded architectures." International Journal of High Performance Computing Applications 26, no. 4 (August 9, 2012): 413–30. http://dx.doi.org/10.1177/1094342012452893.
Повний текст джерелаSyarafina, Nadhia Nurin, and Jozua Ferjanus Palandi. "Designing a word recommendation application using the Levenshtein Distance algorithm." Matrix : Jurnal Manajemen Teknologi dan Informatika 11, no. 2 (July 15, 2021): 63–70. http://dx.doi.org/10.31940/matrix.v11i2.2419.
Повний текст джерела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.
Повний текст джерелаDubnov, Shlomo. "Predictive Quantization and Symbolic Dynamics." Algorithms 15, no. 12 (December 19, 2022): 484. http://dx.doi.org/10.3390/a15120484.
Повний текст джерела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.
Повний текст джерелаCheng, Yu-Huei, Li-Yeh Chuang, Hsueh-Wei Chang, and Cheng-Hong Yang. "Improved Candidate Drug Mining for Alzheimer’s Disease." BioMed Research International 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/897653.
Повний текст джерелаFeng, Jun-Jie, Gong Zhang, and Fang-Qing Wen. "MIMO Radar Imaging Based on Smoothedl0Norm." Mathematical Problems in Engineering 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/841986.
Повний текст джерела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.
Повний текст джерелаBaeza-Yates and G. Navarro, R. "Faster Approximate String Matching." Algorithmica 23, no. 2 (February 1999): 127–58. http://dx.doi.org/10.1007/pl00009253.
Повний текст джерелаOwolabi, O., and D. R. McGregor. "Fast approximate string matching." Software: Practice and Experience 18, no. 4 (April 1988): 387–93. http://dx.doi.org/10.1002/spe.4380180407.
Повний текст джерелаShang, H., and T. H. Merrettal. "Tries for approximate string matching." IEEE Transactions on Knowledge and Data Engineering 8, no. 4 (1996): 540–47. http://dx.doi.org/10.1109/69.536247.
Повний текст джерелаUkkonen, Esko. "Algorithms for approximate string matching." Information and Control 64, no. 1-3 (January 1985): 100–118. http://dx.doi.org/10.1016/s0019-9958(85)80046-2.
Повний текст джерелаDas, Shibsankar, and Kalpesh Kapoor. "Weighted approximate parameterized string matching." AKCE International Journal of Graphs and Combinatorics 14, no. 1 (April 1, 2017): 1–12. http://dx.doi.org/10.1016/j.akcej.2016.11.010.
Повний текст джерелаTarhio, Jorma, and Esko Ukkonen. "Approximate Boyer–Moore String Matching." SIAM Journal on Computing 22, no. 2 (April 1993): 243–60. http://dx.doi.org/10.1137/0222018.
Повний текст джерелаKim, Jong Yong, and John Shawe-Taylor. "An approximate string-matching algorithm." Theoretical Computer Science 92, no. 1 (January 1992): 107–17. http://dx.doi.org/10.1016/0304-3975(92)90138-6.
Повний текст джерелаRusso, Luís M., Gonzalo Navarro, Arlindo Oliveira, and Pedro Morales. "Approximate String Matching with Compressed Indexes." Algorithms 2, no. 3 (September 10, 2009): 1105–36. http://dx.doi.org/10.3390/a2031105.
Повний текст джерелаHolub, Jan, and Bořivoj Melichar. "Approximate string matching using factor automata." Theoretical Computer Science 249, no. 2 (October 2000): 305–11. http://dx.doi.org/10.1016/s0304-3975(00)00064-5.
Повний текст джерелаUkkonen, Esko, and Derick Wood. "Approximate string matching with suffix automata." Algorithmica 10, no. 5 (November 1993): 353–64. http://dx.doi.org/10.1007/bf01769703.
Повний текст джерелаBaeza-Yates, Ricardo A., and Chris H. Perleberg. "Fast and practical approximate string matching." Information Processing Letters 59, no. 1 (July 1996): 21–27. http://dx.doi.org/10.1016/0020-0190(96)00083-x.
Повний текст джерелаTsur, Dekel. "Fast index for approximate string matching." Journal of Discrete Algorithms 8, no. 4 (December 2010): 339–45. http://dx.doi.org/10.1016/j.jda.2010.08.002.
Повний текст джерелаChan, Ho-Leung, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, and Swee-Seong Wong. "Compressed Indexes for Approximate String Matching." Algorithmica 58, no. 2 (December 17, 2008): 263–81. http://dx.doi.org/10.1007/s00453-008-9263-2.
Повний текст джерелаWright, Alden H. "Approximate string matching using withinword parallelism." Software: Practice and Experience 24, no. 4 (April 1994): 337–62. http://dx.doi.org/10.1002/spe.4380240402.
Повний текст джерелаHo, ThienLuan, Seung-Rohk Oh, and HyunJin Kim. "New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance." Journal of Supercomputing 74, no. 5 (November 20, 2017): 1815–34. http://dx.doi.org/10.1007/s11227-017-2192-6.
Повний текст джерелаLiu, Jie, Xiao Yan, Xinyan Dai, Zhirong Li, James Cheng, and Ming-Chang Yang. "Understanding and Improving Proximity Graph Based Maximum Inner Product Search." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 01 (April 3, 2020): 139–46. http://dx.doi.org/10.1609/aaai.v34i01.5344.
Повний текст джерелаBarton, Carl, Costas S. Iliopoulos, and Solon P. Pissis. "Fast algorithms for approximate circular string matching." Algorithms for Molecular Biology 9, no. 1 (2014): 9. http://dx.doi.org/10.1186/1748-7188-9-9.
Повний текст джерелаLoo, Mark,P J. ,van,der. "The stringdist Package for Approximate String Matching." R Journal 6, no. 1 (2014): 111. http://dx.doi.org/10.32614/rj-2014-011.
Повний текст джерелаCole, Richard, and Ramesh Hariharan. "Approximate String Matching: A Simpler Faster Algorithm." SIAM Journal on Computing 31, no. 6 (January 2002): 1761–82. http://dx.doi.org/10.1137/s0097539700370527.
Повний текст джерелаNavarro, Gonzalo. "A guided tour to approximate string matching." ACM Computing Surveys 33, no. 1 (March 2001): 31–88. http://dx.doi.org/10.1145/375360.375365.
Повний текст джерелаLopresti, Daniel, and Andrew Tomkins. "Block edit models for approximate string matching." Theoretical Computer Science 181, no. 1 (July 1997): 159–79. http://dx.doi.org/10.1016/s0304-3975(96)00268-x.
Повний текст джерелаRubio, Miguel, Alfonso Alba, Martín Mendez, Edgar Arce-Santana, and Margarita Rodriguez-Kessler. "A Consensus Algorithm for Approximate String Matching." Procedia Technology 7 (2013): 322–27. http://dx.doi.org/10.1016/j.protcy.2013.04.040.
Повний текст джерелаKucherov, Gregory, Kamil Salikhov, and Dekel Tsur. "Approximate string matching using a bidirectional index." Theoretical Computer Science 638 (July 2016): 145–58. http://dx.doi.org/10.1016/j.tcs.2015.10.043.
Повний текст джерелаLandau, Gad M., and Uzi Vishkin. "Fast parallel and serial approximate string matching." Journal of Algorithms 10, no. 2 (June 1989): 157–69. http://dx.doi.org/10.1016/0196-6774(89)90010-2.
Повний текст джерелаAkutsu, Tatsuya. "Approximate string matching with don't care characters." Information Processing Letters 55, no. 5 (September 1995): 235–39. http://dx.doi.org/10.1016/0020-0190(95)00111-o.
Повний текст джерелаChang, W. I., and E. L. Lawler. "Sublinear approximate string matching and biological applications." Algorithmica 12, no. 4-5 (November 1994): 327–44. http://dx.doi.org/10.1007/bf01185431.
Повний текст джерелаNavarro, Gonzalo, and Ricardo Baeza-Yates. "Very fast and simple approximate string matching." Information Processing Letters 72, no. 1-2 (October 1999): 65–70. http://dx.doi.org/10.1016/s0020-0190(99)00121-0.
Повний текст джерелаHuynh, Trinh N. D., Wing-Kai Hon, Tak-Wah Lam, and Wing-Kin Sung. "Approximate string matching using compressed suffix arrays." Theoretical Computer Science 352, no. 1-3 (March 2006): 240–49. http://dx.doi.org/10.1016/j.tcs.2005.11.022.
Повний текст джерелаNavarro, Gonzalo, and Edgar Chávez. "A metric index for approximate string matching." Theoretical Computer Science 352, no. 1-3 (March 2006): 266–79. http://dx.doi.org/10.1016/j.tcs.2005.11.037.
Повний текст джерела