Algorithms for testing length four permutations

Yijie Han; Sanjeev Saxena

Conference Proceedings

Algorithms for testing length four permutations

Han Y
Saxena S

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7924 LNCS 17-23

DOI: 10.1007/978-3-642-38756-2_5

1Citations

1Readers

Get full text

Abstract

We present new θ(n) time algorithms for testing pattern involvement for all length 4 permutations. For most of these permutations the previous best algorithms require O(nlogn) time. © 2013 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Separable permutations
optimal algorithms
pattern matching

Cite

CITATION STYLE

APA

Han, Y., & Saxena, S. (2013). Algorithms for testing length four permutations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7924 LNCS, pp. 17–23). https://doi.org/10.1007/978-3-642-38756-2_5

Algorithms for testing length four permutations

Abstract

Author supplied keywords

Cite

Register to see more suggestions