Titlebook: Combinatorial Pattern Matching; 15th Annual Symposiu Suleyman Cenk Sahinalp,S. Muthukrishnan,Ugur Dogru Conference proceedings 2004 Springe

cravat

Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity,s for circular sequences. We give lower and upper bounds as well as guaranteed approximation ratios for these three cases. The main result in this paper is an optimal polynomial-time algorithm for sorting circular 0/1 sequences when the cost function is additive.

Brain-Waves

Gene408

A Computational Model for RNA Multiple Structural Alignment, theoretic model (NLG) for analyzing algorithms based on this approach, prove that the RNA multiple alignment problem is NP-Complete in this model, and present a polynomial time algorithm that approximates the optimal structure of size . within a factor of .(log. .).

Compass

說笑

Asperity

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem, variants as well as the uniformly and non-uniformly ordered isomorphic variants of MAST. Our algorithms run in time .(. .), .(. . min { ., .?+?log. . }), .(. .), and .((.+.). .), respectively, where . is the number of leaf labels and . is the number of input trees.

Pruritus

Necmi Altin,Süleyman Emre Eyimayame data structure as a previous random approximation algorithm, we achieve the same subquadratic complexity for finding an . optimal solution. This answers an open question by Ozery-Flato and Shamir whether a subquadratic complexity could ever be achieved for solving the problem.

貞潔

僵硬

https://doi.org/10.1007/978-3-319-98310-3echnique achieving .(./log . + . log .) time is also provided. Furthermore, as a natural extension we present an approximate point set pattern matching on the plane, and give a polynomial-time algorithm that solves this problem.

Modify