Open Access
| Issue |
SHS Web Conf.
Volume 144, 2022
2022 International Conference on Science and Technology Ethics and Human Future (STEHF 2022)
|
|
|---|---|---|
| Article Number | 03018 | |
| Number of page(s) | 6 | |
| Section | Application of Artificial Intelligence Technology and Machine Learning Algorithms | |
| DOI | https://doi.org/10.1051/shsconf/202214403018 | |
| Published online | 26 August 2022 | |
- Levenshtein, V. I. “Binary Codes Capable of Correcting Deletions, Insertions and Reversals”, Soviet Physics Doklady, vol. 10, p. 707, 1966. [Google Scholar]
- D. E. Knuth, J. H. MorrisJr., and V. R. Pratt, “Fast pattern matching in strings, ” SIAM Journal on Computing, vol. 6, no. 2, pp. 323–350, 1977. [CrossRef] [Google Scholar]
- Hou Xian-feng, Yan Yu-bao and Xia Lu, “Hybrid pattern-matching algorithm based on BM-KMP algorithm, ” 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE), 2010, pp. V5-310-V5-313, doi: 10.1109/ICACTE.2010.5579620. [Google Scholar]
- Michael Maher, “How tp Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification, ” in Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, MIT Press, 1996, pp.539-539. [Google Scholar]
- R. Boyer and J. Moore, “A fast string searching algorithm”, Communications of the ACM, vol. 20, no. 10, pp. 762-772, 1977. Available: 10.1145/359842.359859. [CrossRef] [Google Scholar]
- A. Apostolico and R. Giancarlo, “The Boyer–Moore– Galil String Searching Strategies Revisited”, SIAM Journal on Computing, vol. 15, no. 1, pp. 98-105, 1986. Available: 10.1137/0215007. [CrossRef] [Google Scholar]
- R. Horspool, “Practical fast searching in strings”, Software: Practice and Experience, vol. 10, no. 6, pp. 501-506, 1980. Available: 10.1002/spe.4380100608. [CrossRef] [Google Scholar]
- A. Hume and D. Sunday, “Fast string searching”, Software: Practice and Experience, vol. 21, no. 11, pp. 1221-1248, 1991. Available: 10.1002/spe.4380211105. [CrossRef] [Google Scholar]
- R. Shyamasundar, “Precedence parsing using domolki’s algorithm”, International Journal of Computer Mathematics, vol. 6, no. 2, pp. 105-114, 1977. Available: 10.1080/00207167708803130. [CrossRef] [Google Scholar]
- R. Baeza-Yates. “Efficient Text Searching.” PhD Thesis, University of Waterloo, Canada, May 1989. [Google Scholar]
- S. Wu and U. Manber, “Fast text searching”, Communications of the ACM, vol. 35, no. 10, pp. 8391, 1992. Available: 10.1145/135239.135244. [Google Scholar]
- R. Baeza-Yates and G. Navarro, “Faster Approximate String Matching”, Algorithmica, vol. 23, no. 2, pp. 127-158, 1999. Available: 10.1007/pl00009253. [CrossRef] [Google Scholar]
- G. Navarro and M. Raffinot, Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences. Cambridge: Cambridge University Press, 2002. [CrossRef] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.