Abstract
In this paper, we study the problem of finding the longest common separable pattern among several permutations. We first give a polynomial-time algorithm when the number of input permutations is fixed and next show that the problem is NP–hardfor an arbitrary number of input permutations even if these permutations are separable.
On the other hand, we show that the NP–hardproblem of finding the longest common pattern between two permutations cannot be approximated better than within a ratio of 
(where 
is the size of an optimal solution) when taking common patterns belonging to pattern-avoiding permutation classes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, M.H., Aldred, R.E.L., Atkinson, M.D., van Ditmarsch, H.P., Handley, B.D., Handley, C.C., Opatrny, J.: Longest subsequences in permutations. Australian J. Combinatorics 28, 225–238 (2003)
Albert, M.H., Atkinson, M.D., Klazar, M.: The enumeration of simple permutations. Journal of integer sequences, 6(4) (2003)
Albert, M.H., Aldred, R.E.L., Atkinson, M.D., Holton, D.A.: Algorithms for pattern involvement in permutations. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 355–366. Springer, Heidelberg (2001)
Bérard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(1) (2007)
Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of permutations, with applications to modular decomposition of graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 779–790. Springer, Heidelberg (2005)
Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Information Processing Letters 65(5), 277–283 (1998)
Bouvel, M., Rossin, D.: The longest common pattern problem for two permutations. Pure Mathematics and Applications, to be published, arXiv:math.CO/0611679 (2007)
Bui-Xuan, B.-M., Habib, M., Paul, C.: Revisiting T. Uno and M. Yagiura’s algorithm. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 146–155. Springer, Heidelberg (2005)
Chang, M.-S, Wang, G.-H: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Information Processing Letters 43, 293–295 (1992)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hil, Cambridge, MA, New York (2001)
Ehrenfeucht, A., Harj, T., ten Pas, P., Rozenberg, G.: Permutations, parenthesis words, and Schröder numbers. Discrete Mathematics 190, 259–264 (1998)
Eriksson, H., Eriksson, K., Linusson, S., Wästlund, J.: Dense packing of patterns in a permutation. Annals of Combinatorics (to appear)
Garey, M.R., Johnson, D.S.: Computers and Intractablility: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
Ibarra, L.: Finding pattern matchings for permutations. Information Processing Letters 61, 293–295 (1997)
Knuth, D.E.: Fundamental Algorithms. In: The Art of Computer Programming, 3rd edn., vol. 1, Addison-Wesley, Reading (1973)
Kubica, M., Rizzi, R., Vialette, S., Walen, T.: Approximation of rna multiple structural alignment. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 211–222. Springer, Heidelberg (2006)
Lovász, L.: Combinatorial problems and exercices. North-Holland, Amsterdam (1979)
Maier, D.: The Complexity of Some Problems on Subsequences and Supersequences. J. ACM 25, 322–336 (1978)
Marcus, A., Tardos, G.: Excluded permutation matrices and the Stanley-Wilf conjecture. J. Combin. Th. A 107, 153–160 (2004)
Rotem, D.: Stack-sortable permutations. Discrete Math. 33, 185–196 (1981)
West, J.: Generating trees and the Catalan and Schröder numbers. Discrete Mathematics 146, 247–262 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouvel, M., Rossin, D., Vialette, S. (2007). Longest Common Separable Pattern Among Permutations. In: Ma, B., Zhang, K. (eds) Combinatorial Pattern Matching. CPM 2007. Lecture Notes in Computer Science, vol 4580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73437-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-73437-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73436-9
Online ISBN: 978-3-540-73437-6
eBook Packages: Computer ScienceComputer Science (R0)