蔑视 发表于 2025-3-30 11:09:32

EIFEL—A New Approach for Digital Education RNA secondary structure, has to be found in a sequence. We show that the . . . 2-. . problem is .-complete for structured patterns where no pair precedes the other, but can be solved in polynomial time for several interesting special cases.

彻底明白 发表于 2025-3-30 15:58:08

http://reply.papertrans.cn/23/2300/229991/229991_52.png

星星 发表于 2025-3-30 18:23:01

http://reply.papertrans.cn/23/2300/229991/229991_53.png

notion 发表于 2025-3-30 21:17:13

http://reply.papertrans.cn/23/2300/229991/229991_54.png

Glycogen 发表于 2025-3-31 01:08:02

http://reply.papertrans.cn/23/2300/229991/229991_55.png

Tidious 发表于 2025-3-31 08:02:43

Smart Education and e-Learning 2021mations — a problem that naturally arises in image comparison problems. A general framework for the matching problem is introduced. We show that some of the most obvious instances of this framework lead to NP-hard optimization problems and are not approximable within any constant factor. We also giv

NORM 发表于 2025-3-31 10:55:51

Smart Innovation, Systems and Technologiesur algorithms require only . bits (.(./ log .) words) where . is the total length of the strings. We propose three algorithms for different inputs: When the input is only the strings, their compressed suffix array, or their compressed suffix tree. Their time complexities are .(. log .), .(. log. .)

inscribe 发表于 2025-3-31 16:48:34

Smart Education and e-Learning 2021 reachable nodes from the .-th initial node conforms with .(.[.:]), where .[.:] denotes the .-th suffix of .. We prove that the size of the .(.) (.(.)) is Θ(|.|) for |Σ| = 1, and is Θ(|.|.) for |Σ|≥ 2. Moreover, we introduce an . algorithm which directly constructs .(.) for given ., whose running ti

Lice692 发表于 2025-3-31 19:48:30

Smart Education and e-Learning 2021les (sequences) and negative examples (sequences), find a PSSM which correctly discriminates between positive and negative examples. We prove that this problem is solved in polynomial time if the size of a PSSM is bounded by a constant. On the other hand, we prove that this problem is NP-hard if the

摇晃 发表于 2025-3-31 23:03:33

http://reply.papertrans.cn/23/2300/229991/229991_60.png
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Combinatorial Pattern Matching; 13th Annual Symposiu Alberto Apostolico,Masayuki Takeda Conference proceedings 2002 Springer-Verlag Berlin