Buscar
Mostrando ítems 1-10 de 968
Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string
(Pattern Recognition Letters, 2020)
Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string
(Pattern Recognition Letters, 2020)
Indexed dynamic programming to boost edit distance and LCSS computation
(Springer Verlag, 2018)
There are efficient dynamic programming solutions to the computation of the Edit Distance from S ∈in [1..σ]n to T ∈in [1..σ]m, for many natural subsets of edit operations, typically in time within O(nm) in the worst-case ...
Adaptive computation of the swap-insert correction distance
(Association for Computing Machinery, 2018)
The Swap-Insert Correction distance from a string S of length n to another string L of length m≥n on the alphabet [1.δ] is the minimum number of insertions, and swaps of pairs of adjacent symbols, converting S into L. ...
Parallel Implementation of Median String Algorithms
(IEEE, 2021)
Utilização de técnicas de similaridade dinâmica para detecção de novidades em sinais de sistemas elétricos de potência
(Universidade Federal de Juiz de Fora (UFJF)BrasilFaculdade de EngenhariaPrograma de Pós-graduação em Engenharia ElétricaUFJF, 2023)
An integer linear programming approach for approximate string comparison
(ELSEVIER SCIENCE BV, 2009)
We introduce a problem called maximum common characters in blocks (MCCB), which arises in applications of approximate string comparison, particularly in the unification of possibly erroneous textual data coming from different ...