Results 31 to 40 of about 83,132 (184)
Random Access to Grammar Compressed Strings
, 2011 Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular compression schemes.
Bille, Philip +5 more
core +1 more source
Studi Perbandingan Algoritma Pencarian String Dalam Metode Approximate String Matching Untuk Identifikasi Kesalahan Pengetikan Teks [PDF]
, 2016 . Error typing resulting in the change of standard words into non-standard words are often caused by misspelling. This can be addressed by developing a system to identify errors in typing.
Kusumaningrum, R. (Retno) +1 more
core +3 more sources
Applied Sciences, 2023 In the subject recognition (SR) task under Knowledge Base Question Answering (KBQA), a common method is by training and employing a general flat Named-Entity Recognition (NER) model.
Ziming Wang +5 more
doaj +1 more source
Finding approximate palindromes in strings
, 2002 We introduce a novel definition of approximate palindromes in strings, and provide an algorithm to find all maximal approximate palindromes in a string with up to $k$ errors.
Alexandre H.L. Porto +19 more
core +2 more sources
Faster Longest Common Extension Queries in Strings over General Alphabets [PDF]
, 2016 Longest common extension queries (often called longest common prefix queries) constitute a fundamental building block in multiple string algorithms, for example computing runs and approximate pattern matching.
Gawrychowski, Paweł +3 more
core +2 more sources
Accelerating Edit-Distance Sequence Alignment on GPU Using the Wavefront Algorithm
IEEE Access, 2022 Sequence alignment remains a fundamental problem with practical applications ranging from pattern recognition to computational biology. Traditional algorithms based on dynamic programming are hard to parallelize, require significant amounts of memory ...
Quim Aguado-Puig +6 more
doaj +1 more source
Cross-domain approximate string matching [PDF]
6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268), 2003 Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. We introduce a new formalism for a class of applications that takes two strings as input, each specified in terms of a particular domain, and performs a comparison motivated by constraints derived from a third,
D. Lopresti, G. Wilfong
openaire +1 more source
Approximate String Matching with Non-Overlapping Adjacent Unbalanced Translocations
MathematicsIn this paper, we investigate the approximate string matching problem when the allowed edit operations are non-overlapping unbalanced translocations of adjacent factors.
Domenico Cantone +2 more
doaj +1 more source
Optimum Search Schemes for Approximate String Matching Using Bidirectional FM-Index
, 2018 Finding approximate occurrences of a pattern in a text using a full-text index is a central problem in bioinformatics and has been extensively researched.
Kianfar, Kiavash +4 more
core +1 more source
Frontiers in Computational Neuroscience, 2023 Being able to objectively characterize the intrinsic complexity of behavioral patterns resulting from human or animal decisions is fundamental for deconvolving cognition and designing autonomous artificial intelligence systems.
Hector Zenil +4 more
doaj +1 more source