Chivalrous
发表于 2025-3-30 09:44:13
http://reply.papertrans.cn/23/2300/229996/229996_51.png
支架
发表于 2025-3-30 15:47:41
Compactness-Preserving Mapping on Trees,ance at most . to . in a graph .. We call this problem . (CPM). In the paper we study CPM with input graphs being trees and present a dichotomy of classical complexity with respect to different values of . and .. CPM on trees can be solved in polynomial time only if . ≤ 2 and . ≤ 1.
痛得哭了
发表于 2025-3-30 18:04:23
‘Safety and Cybersecurity in a Digital Age’n of any substring of the text in . time, where . is the number of distinct factors in the decomposition. For the maximal suffix problem we give a linear-space structure with . query time and . preprocessing time, i.e., we manage to achieve both the optimal query and the optimal construction time simultaneously.
Admonish
发表于 2025-3-31 00:22:08
https://doi.org/10.1007/978-3-030-28191-5 that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.
constitute
发表于 2025-3-31 02:19:22
Velislava Simeonova,Kalina Milkovaof blocks they contain (a block being maximal substring such that all letters in the substring are equal), and the alphabet size Σ. For instance, we show that . and . are NP-hard even if the input strings have only . letter.
有组织
发表于 2025-3-31 07:44:49
http://reply.papertrans.cn/23/2300/229996/229996_56.png
Indelible
发表于 2025-3-31 12:39:25
http://reply.papertrans.cn/23/2300/229996/229996_57.png
通便
发表于 2025-3-31 14:06:19
https://doi.org/10.1007/978-3-662-62153-0lications in bioinformatics. In this paper we develop the first randomized parameterized algorithms for CSP. Not only are the randomized algorithms much simpler than their deterministic counterparts, their expected-time complexities are also significantly better than the previously best known (deterministic) algorithms.
演讲
发表于 2025-3-31 19:00:21
https://doi.org/10.1007/978-3-662-62153-0me is .((loglog.) log.), where . is the size of the alphabet..A byproduct of this paper is an Aho-Corasick automaton that can be constructed with only a compact working space, which is the first of its type to the best of our knowledge.
Pessary
发表于 2025-4-1 00:48:42
On the Efficiency of the Hamming C-Centerstring Problems,a generalization is necessary for clustering. One needs to consider a partition into a number of sets, each with a distinct centerstring. In this paper we define two natural versions of the consensus problem for c centerstrings. We analyse the hardness and fixed parameter tractability of these probl