gain631
发表于 2025-3-28 15:25:53
Approximation Algorithms for the Maximum Multiple RNA Interaction Problemthe problem when the order of interacting RNAs is known and pseudoknot interactions are allowed; for the general problem without an assumed RNA order, we prove the NP-hardness for both variants (allowing and disallowing pseudoknot interactions), and present a constant ratio approximation algorithm for each of them.
META
发表于 2025-3-28 20:26:43
On the Clustered Steiner Tree Problem case, in which . is the approximation ratio for the Steiner tree problem. When the topologies for all clusters are given, we show a (. + 1)-approximation algorithm. We also discuss the Steiner ratio for this problem. We show the ratio is lower and upper bounded by three and four, respectively.
IVORY
发表于 2025-3-29 01:56:04
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations oop in comparison with techniques implemented in the Omega and ISL libraries. This increases the applicability scope of techniques based on transitive closure of dependence graphs. Experimental results for NASA Parallel Benchmarks are discussed.
GEON
发表于 2025-3-29 07:03:21
http://reply.papertrans.cn/23/2300/229979/229979_44.png
Eclampsia
发表于 2025-3-29 08:33:18
http://reply.papertrans.cn/23/2300/229979/229979_45.png
Juvenile
发表于 2025-3-29 11:57:47
http://reply.papertrans.cn/23/2300/229979/229979_46.png
珊瑚
发表于 2025-3-29 18:54:12
http://reply.papertrans.cn/23/2300/229979/229979_47.png
马笼头
发表于 2025-3-29 23:46:12
http://reply.papertrans.cn/23/2300/229979/229979_48.png
Fsh238
发表于 2025-3-30 03:10:02
Discretely Following a Curvesed on unique or non-unique nodes and on limiting the number of points used. We prove that three of the variations of the set-chain matching problem are .-complete. For the version of the problem that we prove is polynomial, we give the optimal substructure and the recurrence for a dynamic programming solution.
Insufficient
发表于 2025-3-30 06:31:33
http://reply.papertrans.cn/23/2300/229979/229979_50.png