Titlebook: Combinatorial Pattern Matching; 13th Annual Symposiu Alberto Apostolico,Masayuki Takeda Conference proceedings 2002 Springer-Verlag Berlin

蔑视

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.

彻底明白

星星

notion

Glycogen

Tidious

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

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

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

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

摇晃