Guaff豪情痛饮
发表于 2025-3-26 22:57:57
Local Similarity Based Point-Pattern Matching,of the most obvious instances of this framework lead to NP-hard optimization problems and are not approximable within any constant factor. We also give a relaxation of the framework that is solvable in polynomial time and works well in practice in our experiments with two-dimensional protein electrophoresis gel images.
Congregate
发表于 2025-3-27 02:53:27
The Minimum DAWG for All Suffixes of a String and Its Applications,) is Θ(|.|) for |Σ| = 1, and is Θ(|.|.) for |Σ|≥ 2. Moreover, we introduce an . algorithm which directly constructs .(.) for given ., whose running time is linear with respect to its size. We also demonstrate some application problems, ., and ., for which AS-DAWGs are useful.
colloquial
发表于 2025-3-27 05:44:05
http://reply.papertrans.cn/23/2300/229991/229991_33.png
syncope
发表于 2025-3-27 12:36:56
Space-Economical Algorithms for Finding Maximal Unique Matches,and .(.) respectively, where ε is any constant between 0 and 1. We also show an algorithm to construct the compressed suffix tree from the compressed suffix array using .(. log. .) time and .(.) bits space.
Feature
发表于 2025-3-27 15:06:11
One-Gapped q-Gram Filters for Levenshtein Distance,trate on gapped .-grams with just one gap. We demostrate with experiments that the resulting filters provide a significant improvement over the contiguous .-gram filters. We also develop new techniques for dealing with complex .-gram filters.
减震
发表于 2025-3-27 20:10:56
Elena A. Boldyreva,Lubov S. LisitsynaA molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems.
BOON
发表于 2025-3-27 23:08:50
http://reply.papertrans.cn/23/2300/229991/229991_37.png
魅力
发表于 2025-3-28 02:52:45
http://reply.papertrans.cn/23/2300/229991/229991_38.png
规章
发表于 2025-3-28 07:01:00
Two-Pattern Strings, sharing many of their nice properties. In particular, we show that, in common with Sturmian strings, only time linear in the string length is required to recognize a two-pattern string as well as to compute all of its repetitions. We also show that two-pattern strings occur in some sense frequently in the class of all strings on {.}.
Militia
发表于 2025-3-28 11:59:09
https://doi.org/10.1007/3-540-45452-7Graph; Matching; computer; data compression; information; multimedia; pattern recognition; regular expressi