Gotowe bibliografie tematyczne / Approximate String Matching (ASM) / Artykuły w czasopismach
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Approximate String Matching (ASM).

Artykuły w czasopismach na temat „Approximate String Matching (ASM)”

Autor: Grafiati
Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Approximate String Matching (ASM)”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Liu, Bing, Dan Han i Shuang Zhang. "Approximate Chinese String Matching Techniques Based on Pinyin Input Method". Applied Mechanics and Materials 513-517 (luty 2014): 1017–20. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1017.

Pełny tekst źródła
Streszczenie:
String matching is one of the most typical problems in computer science. Previous studies mainly focused on accurate string matching problem. However, with the rapid development of the computer and Internet as well as the continuously rising of new issues, people find that it has very important theoretical value and practical meaning to research and design efficient approximate string matching algorithms. Approximate string matching is also called string matching that allows errors, which mainly aims to find the pattern string in the text and database and allows k differences between the pattern string and its occurring forms in the text. For the problem of approximate string matching, though a number of algorithms have been proposed, there are fewer studies which focus on large size of alphabet . Most of experts are interested in small or middle size of alphabet . For large size of , especially for Chinese characters and Asian phonetics, there are fewer efficient algorithms. For the above reasons, this paper focuses on the approximate Chinese strings matching problem based on the pinyin input method.
Style APA, Harvard, Vancouver, ISO itp.
2

Alba, Alfonso, Martin O. Mendez, Miguel E. Rubio-Rincon i Edgar R. Arce-Santana. "A consensus algorithm for approximate string matching and its application to QRS complex detection". International Journal of Modern Physics C 27, nr 03 (23.02.2016): 1650029. http://dx.doi.org/10.1142/s0129183116500297.

Pełny tekst źródła
Streszczenie:
In this paper, a novel algorithm for approximate string matching (ASM) is proposed. The novelty resides in the fact that, unlike most other methods, the proposed algorithm is not based on the Hamming or Levenshtein distances, but instead computes a score for each symbol in the search text based on a consensus measure. Those symbols with sufficiently high scores will likely correspond to approximate instances of the pattern string. To demonstrate the usefulness of the proposed method, it has been applied to the detection of QRS complexes in electrocardiographic signals with competitive results when compared against the classic Pan-Tompkins (PT) algorithm. The proposed method outperformed PT in 72% of the test cases, with no extra computational cost.
Style APA, Harvard, Vancouver, ISO itp.
3

Yang, Zhenglu, Jianjun Yu i Masaru Kitsuregawa. "Fast Algorithms for Top-k Approximate String Matching". Proceedings of the AAAI Conference on Artificial Intelligence 24, nr 1 (5.07.2010): 1467–73. http://dx.doi.org/10.1609/aaai.v24i1.7527.

Pełny tekst źródła
Streszczenie:
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem has increased dramatically because of the prevalence of the Web. In this paper, we aim to explore the efficient top-k similar string matching problem. Several efficient strategies are introduced, such as length aware and adaptive q-gram selection. We present a general q-gram based framework and propose two efficient algorithms based on the strategies introduced. Our techniques are experimentally evaluated on three real data sets and show a superior performance.
Style APA, Harvard, Vancouver, ISO itp.
4

Mustafa, Suleiman H. "Word-oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic text". Journal of the American Society for Information Science and Technology 56, nr 14 (2005): 1504–11. http://dx.doi.org/10.1002/asi.20244.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Wang, Rui, Ping Gu i Jian Min Zeng. "A Vague Words Retrieval Method in a Relational Database". Applied Mechanics and Materials 268-270 (grudzień 2012): 1692–96. http://dx.doi.org/10.4028/www.scientific.net/amm.268-270.1692.

Pełny tekst źródła
Streszczenie:
In this paper, we propose a vague words retrieval method over text field of relational databases. This method is expected to get an ideal retrieval result from text field of relational databases when a set of incorrect keywords is submitted. The solution to this issue is: to create a “hot words library”, then let the input incorrect keywords match with the word of “hot words library”, based on the modified dynamic programming algorithm of k-difference approximate string matching. Finally, Experiments show that this solution has a good query performance.
Style APA, Harvard, Vancouver, ISO itp.
6

Baeza-Yates and G. Navarro, R. "Faster Approximate String Matching". Algorithmica 23, nr 2 (luty 1999): 127–58. http://dx.doi.org/10.1007/pl00009253.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Owolabi, O., i D. R. McGregor. "Fast approximate string matching". Software: Practice and Experience 18, nr 4 (kwiecień 1988): 387–93. http://dx.doi.org/10.1002/spe.4380180407.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Shang, H., i T. H. Merrettal. "Tries for approximate string matching". IEEE Transactions on Knowledge and Data Engineering 8, nr 4 (1996): 540–47. http://dx.doi.org/10.1109/69.536247.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Ukkonen, Esko. "Algorithms for approximate string matching". Information and Control 64, nr 1-3 (styczeń 1985): 100–118. http://dx.doi.org/10.1016/s0019-9958(85)80046-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Das, Shibsankar, i Kalpesh Kapoor. "Weighted approximate parameterized string matching". AKCE International Journal of Graphs and Combinatorics 14, nr 1 (1.04.2017): 1–12. http://dx.doi.org/10.1016/j.akcej.2016.11.010.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
11

Tarhio, Jorma, i Esko Ukkonen. "Approximate Boyer–Moore String Matching". SIAM Journal on Computing 22, nr 2 (kwiecień 1993): 243–60. http://dx.doi.org/10.1137/0222018.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Kim, Jong Yong, i John Shawe-Taylor. "An approximate string-matching algorithm". Theoretical Computer Science 92, nr 1 (styczeń 1992): 107–17. http://dx.doi.org/10.1016/0304-3975(92)90138-6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
13

Russo, Luís M., Gonzalo Navarro, Arlindo Oliveira i Pedro Morales. "Approximate String Matching with Compressed Indexes". Algorithms 2, nr 3 (10.09.2009): 1105–36. http://dx.doi.org/10.3390/a2031105.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
14

BERGERON, ANNE, i SYLVIE HAMEL. "VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING". International Journal of Foundations of Computer Science 13, nr 01 (luty 2002): 53–65. http://dx.doi.org/10.1142/s0129054102000947.

Pełny tekst źródła
Streszczenie:
Vector algorithms allow the computation of an output vector r = r1 r2 ⋯ rm given an input vector e = e1 e2 ⋯ em in a bounded number of operations, independent of m the length of the vectors. The allowable operations are usually restricted to bit-wise operations available in processors, including shifts and binary addition with carry. These restrictions imple that the existence of a vector algorithm for a particular problem opens the way to extremely fast implementations, using the inherent parallelism of bit-wise operations. This paper presents general results on the existence and construction of vertor algorithms, with a particular focus on problems arising from computational biology. We show that efficient vector algorithms exist for the problem of approximate string matching with arbitrary weighted distances, generalizing a previous result by G. Myers. We also characterize a class of automata for which vector algorithms can be automatically derived from the transition table of the automata.
Style APA, Harvard, Vancouver, ISO itp.
15

Holub, Jan, i Bořivoj Melichar. "Approximate string matching using factor automata". Theoretical Computer Science 249, nr 2 (październik 2000): 305–11. http://dx.doi.org/10.1016/s0304-3975(00)00064-5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
16

Ukkonen, Esko, i Derick Wood. "Approximate string matching with suffix automata". Algorithmica 10, nr 5 (listopad 1993): 353–64. http://dx.doi.org/10.1007/bf01769703.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
17

Baeza-Yates, Ricardo A., i Chris H. Perleberg. "Fast and practical approximate string matching". Information Processing Letters 59, nr 1 (lipiec 1996): 21–27. http://dx.doi.org/10.1016/0020-0190(96)00083-x.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
18

Tsur, Dekel. "Fast index for approximate string matching". Journal of Discrete Algorithms 8, nr 4 (grudzień 2010): 339–45. http://dx.doi.org/10.1016/j.jda.2010.08.002.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
19

Chan, Ho-Leung, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam i Swee-Seong Wong. "Compressed Indexes for Approximate String Matching". Algorithmica 58, nr 2 (17.12.2008): 263–81. http://dx.doi.org/10.1007/s00453-008-9263-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
20

Wright, Alden H. "Approximate string matching using withinword parallelism". Software: Practice and Experience 24, nr 4 (kwiecień 1994): 337–62. http://dx.doi.org/10.1002/spe.4380240402.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
21

Ho, ThienLuan, Seung-Rohk Oh i HyunJin Kim. "New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance". Journal of Supercomputing 74, nr 5 (20.11.2017): 1815–34. http://dx.doi.org/10.1007/s11227-017-2192-6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

Barton, Carl, Costas S. Iliopoulos i Solon P. Pissis. "Fast algorithms for approximate circular string matching". Algorithms for Molecular Biology 9, nr 1 (2014): 9. http://dx.doi.org/10.1186/1748-7188-9-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

Loo, Mark,P J. ,van,der. "The stringdist Package for Approximate String Matching". R Journal 6, nr 1 (2014): 111. http://dx.doi.org/10.32614/rj-2014-011.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
24

Cole, Richard, i Ramesh Hariharan. "Approximate String Matching: A Simpler Faster Algorithm". SIAM Journal on Computing 31, nr 6 (styczeń 2002): 1761–82. http://dx.doi.org/10.1137/s0097539700370527.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
25

Navarro, Gonzalo. "A guided tour to approximate string matching". ACM Computing Surveys 33, nr 1 (marzec 2001): 31–88. http://dx.doi.org/10.1145/375360.375365.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
26

Lopresti, Daniel, i Andrew Tomkins. "Block edit models for approximate string matching". Theoretical Computer Science 181, nr 1 (lipiec 1997): 159–79. http://dx.doi.org/10.1016/s0304-3975(96)00268-x.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
27

Rubio, Miguel, Alfonso Alba, Martín Mendez, Edgar Arce-Santana i 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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
28

Kucherov, Gregory, Kamil Salikhov i Dekel Tsur. "Approximate string matching using a bidirectional index". Theoretical Computer Science 638 (lipiec 2016): 145–58. http://dx.doi.org/10.1016/j.tcs.2015.10.043.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
29

Landau, Gad M., i Uzi Vishkin. "Fast parallel and serial approximate string matching". Journal of Algorithms 10, nr 2 (czerwiec 1989): 157–69. http://dx.doi.org/10.1016/0196-6774(89)90010-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
30

Akutsu, Tatsuya. "Approximate string matching with don't care characters". Information Processing Letters 55, nr 5 (wrzesień 1995): 235–39. http://dx.doi.org/10.1016/0020-0190(95)00111-o.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
31

Chang, W. I., i E. L. Lawler. "Sublinear approximate string matching and biological applications". Algorithmica 12, nr 4-5 (listopad 1994): 327–44. http://dx.doi.org/10.1007/bf01185431.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
32

Navarro, Gonzalo, i Ricardo Baeza-Yates. "Very fast and simple approximate string matching". Information Processing Letters 72, nr 1-2 (październik 1999): 65–70. http://dx.doi.org/10.1016/s0020-0190(99)00121-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
33

Huynh, Trinh N. D., Wing-Kai Hon, Tak-Wah Lam i Wing-Kin Sung. "Approximate string matching using compressed suffix arrays". Theoretical Computer Science 352, nr 1-3 (marzec 2006): 240–49. http://dx.doi.org/10.1016/j.tcs.2005.11.022.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
34

Navarro, Gonzalo, i Edgar Chávez. "A metric index for approximate string matching". Theoretical Computer Science 352, nr 1-3 (marzec 2006): 266–79. http://dx.doi.org/10.1016/j.tcs.2005.11.037.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
35

Amir, Amihood, Yonatan Aumann, Oren Kapah, Avivit Levy i Ely Porat. "Approximate string matching with address bit errors". Theoretical Computer Science 410, nr 51 (listopad 2009): 5334–46. http://dx.doi.org/10.1016/j.tcs.2009.09.010.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

Amir, Amihood, Estrella Eisenberg, Orgad Keller, Avivit Levy i Ely Porat. "Approximate string matching with stuck address bits". Theoretical Computer Science 412, nr 29 (lipiec 2011): 3537–44. http://dx.doi.org/10.1016/j.tcs.2011.02.044.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
37

Hon, Wing-Kai, Tak-Wah Lam, Rahul Shah, Siu-Lung Tam i Jeffrey Scott Vitter. "Cache-oblivious index for approximate string matching". Theoretical Computer Science 412, nr 29 (lipiec 2011): 3579–88. http://dx.doi.org/10.1016/j.tcs.2011.03.004.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
38

Atallah, M. J., F. Chyzak i P. Dumas. "A Randomized Algorithm for Approximate String Matching". Algorithmica 29, nr 3 (marzec 2001): 468–86. http://dx.doi.org/10.1007/s004530010062.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
39

Galil, Zvi, i Kunsoo Park. "An Improved Algorithm For Approximate String Matching". SIAM Journal on Computing 19, nr 6 (grudzień 1990): 989–99. http://dx.doi.org/10.1137/0219067.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
40

Ravi, K. M., A. Choubey i K. K. Tripati. "Intuitionistic Fuzzy Automaton for Approximate String Matching". Fuzzy Information and Engineering 6, nr 1 (marzec 2014): 29–39. http://dx.doi.org/10.1016/j.fiae.2014.06.003.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
41

Bille, Philip. "Faster Approximate String Matching for Short Patterns". Theory of Computing Systems 50, nr 3 (1.04.2011): 492–515. http://dx.doi.org/10.1007/s00224-011-9322-y.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
42

JOKINEN, PETTERI, JORMA TARHIO i ESKO UKKONEN. "A Comparison of Approximate String Matching Algorithms". Software: Practice and Experience 26, nr 12 (grudzień 1996): 1439–58. http://dx.doi.org/10.1002/(sici)1097-024x(199612)26:12<1439::aid-spe71>3.0.co;2-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
43

Aygun, Ramazan S. "Using Maximum Subarrays for Approximate String Matching". Annals of Data Science 4, nr 4 (19.07.2017): 503–31. http://dx.doi.org/10.1007/s40745-017-0117-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
44

Kılınç, Deniz. "An accurate toponym-matching measure based on approximate string matching". Journal of Information Science 42, nr 2 (29.06.2015): 138–49. http://dx.doi.org/10.1177/0165551515590097.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
45

Ho, ThienLuan, Seung-Rohk Oh i HyunJin Kim. "Correction to: New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance". Journal of Supercomputing 74, nr 5 (20.03.2018): 1835. http://dx.doi.org/10.1007/s11227-018-2324-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
46

Mola, Sebastianus A. S., Meiton Boru i Emerensye Sofia Yublina Pandie. "PEMBOBOTAN DINAMIS BERBASIS POSISI PADA APPROXIMATE STRING MATCHING". Jurnal Komputer dan Informatika 9, nr 2 (13.10.2021): 168–75. http://dx.doi.org/10.35508/jicon.v9i2.5149.

Pełny tekst źródła
Streszczenie:
Komunikasi tertulis dalam media sosial yang menekankan pada kecepatan penyebaran informasi sering kali terjadi fenomena penggunaan bahasa yang tidak baku baik pada level kalimat, klausa, frasa maupun kata. Sebagai sebuah sumber data, media sosial dengan fenomena ini memberikan tantangan dalam proses ekstraksi informasi. Normalisasi bahasa yang tidak baku menjadi bahasa baku dimulai pada proses normalisasi kata di mana kata yang tidak baku (non-standard word (NSW)) dinormalisasikan ke bentuk baku (standard word (SW)). Proses normalisasi dengan menggunakan edit distance memiliki keterbatasan dalam proses pembobotan nilai mismatch, match, dan gap yang bersifat statis. Dalam perhitungan nilai mismatch, pembobotan statida tidak dapat memberikan pembedaan bobot akibat kesalahan penekanan tombol pada keyboard terutama tombol yang berdekatan. Karena keterbatasan pembobotan edit distance ini maka dalam penelitian ini diusulkan sebuah metode pembobotan dinamis untuk bobot mismatch. Hasil dari penelitian ini adalah adanya metode baru dalam pembobotan dinamis berbasis posisi tombol keyboard yang dapat digunakan dalam melakukan normalisasi NSW menggunakan metode approximate string matching.
Style APA, Harvard, Vancouver, ISO itp.
47

Sastry, R., N. Ranganathan i K. Remedios. "CASM: a VLSI chip for approximate string matching". IEEE Transactions on Pattern Analysis and Machine Intelligence 17, nr 8 (1995): 824–30. http://dx.doi.org/10.1109/34.400575.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
48

Kärkkäinen, Juha, Gonzalo Navarro i Esko Ukkonen. "Approximate string matching on Ziv–Lempel compressed text". Journal of Discrete Algorithms 1, nr 3-4 (czerwiec 2003): 313–38. http://dx.doi.org/10.1016/s1570-8667(03)00032-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
49

Michailidis, Panagiotis D., i Konstantinos G. Margaritis. "Processor array architectures for flexible approximate string matching". Journal of Systems Architecture 54, nr 1-2 (styczeń 2008): 35–54. http://dx.doi.org/10.1016/j.sysarc.2007.03.004.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
50

Farach-Colton, Martin, Gad M. Landau, S. Cenk Sahinalp i Dekel Tsur. "Optimal spaced seeds for faster approximate string matching". Journal of Computer and System Sciences 73, nr 7 (listopad 2007): 1035–44. http://dx.doi.org/10.1016/j.jcss.2007.03.007.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany bibliografiami na temat „Approximate String Matching (ASM)” dla innych typów źródeł:
Rozprawy doktorskie
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii