Longest alternating subsequences of permutations

被引：36

作者：

Stanley, Richard P. ^{[1
]}

机构：

[1] MIT, Dept Math 2 375, Cambridge, MA 02139 USA

来源：

MICHIGAN MATHEMATICAL JOURNAL | 2008年 / 57卷

基金：

美国国家科学基金会;

关键词：

D O I：

10.1307/mmj/1220879431

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：675 / 687

页数：13

共 50 条

[31] ASCENDING SUBSEQUENCES OF PERMUTATIONS AND YOUNG TABLEAUX
WILF, HS
ADVANCES IN APPLIED PROBABILITY, 1992, 24 (04) : 772 - 773
[32] Partitioning permutations into increasing and decreasing subsequences
Kezdy, AE
Snevily, HS
Wang, C
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 73 (02) : 353 - 359
[33] ASCENDING SUBSEQUENCES OF PERMUTATIONS AND THE SHAPES OF TABLEAUX
WILF, HS
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1992, 60 (01) : 155 - 157
[34] On the longest upsequence problem for permutations
Mäkinen, E
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2001, 77 (01) : 45 - 53
[35] New approximation algorithms for longest common subsequences
Bergroth, L
Hakonen, H
Raita, T
STRING PROCESSING AND INFORMATION RETRIEVAL - PROCEEDINGS: A SOUTH AMERICAN SYMPOSIUM, 1998, : 32 - 40
[36] Locating Longest Common Subsequences with Limited Penalty
Wang, Bin
Yang, Xiaochun
Li, Jinxu
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2017), PT II, 2017, 10178 : 187 - 201
[37] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES
HUNT, JW
SZYMANSKI, TG
COMMUNICATIONS OF THE ACM, 1977, 20 (05) : 350 - 353
[38] Efficient computation of all longest common subsequences
Rick, C
ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 407 - 418
[39] Enumerating longest increasing subsequences and patience sorting
Bespamyatnikh, S
Segal, M
INFORMATION PROCESSING LETTERS, 2000, 76 (1-2) : 7 - 11
[40] The longest commonly positioned increasing subsequences problem
He, Xiaozhou
Xu, Yinfeng
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (02) : 331 - 340

← 1 2 3 4 5 →