LONGEST INCREASING AND DECREASING SUBSEQUENCES

被引：465
|
作者：
SCHENSTED, C
机构：
来源：
CANADIAN JOURNAL OF MATHEMATICS | 1961年 / 13卷 / 02期
关键词：
D O I：
10.4153/CJM-1961-015-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：179 / &
相关论文
共 50 条
  • [21] Faster algorithms for computing longest common increasing subsequences
    Kutz, Martin
    Brodal, Gerth Stolting
    Kaligosi, Kanela
    Katriel, Irit
    JOURNAL OF DISCRETE ALGORITHMS, 2011, 9 (04) : 314 - 325
  • [22] HAMMERSLEYS INTERACTING PARTICLE PROCESS AND LONGEST INCREASING SUBSEQUENCES
    ALDOUS, D
    DIACONIS, P
    PROBABILITY THEORY AND RELATED FIELDS, 1995, 103 (02) : 199 - 213
  • [23] Finding longest increasing and common subsequences in streaming data
    David Liben-Nowell
    Erik Vee
    An Zhu
    Journal of Combinatorial Optimization, 2006, 11 : 155 - 175
  • [24] An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences
    Lin, Chun
    Huang, Chao-Yuan
    Tsai, Ming-Jer
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 25 - 36
  • [25] Faster algorithms for computing longest common increasing subsequences
    Stolting Brodal, Gerth
    Kaligosi, Kanela
    Katriel, Irit
    Kutz, Martin
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 330 - 341
  • [26] Finding a Reconfiguration Sequence between Longest Increasing Subsequences
    Aoike, Yuuki
    Kiyomi, Masashi
    Kobayashi, Yasuaki
    Otachi, Yota
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2024, E107D (04) : 559 - 563
  • [27] Moderate deviations for longest increasing subsequences:: The lower tail
    Löwe, M
    Merkl, F
    Rolles, S
    JOURNAL OF THEORETICAL PROBABILITY, 2002, 15 (04) : 1031 - 1047
  • [28] Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
    Bannai, Hideo
    Tomohiro, I
    Kociumaka, Tomasz
    Koeppl, Dominik
    Puglisi, Simon J.
    ALGORITHMICA, 2024, 86 (03) : 735 - 756
  • [29] ASYMPTOTIC EXPANSIONS RELATING TO THE DISTRIBUTION OF THE LENGTH OF LONGEST INCREASING SUBSEQUENCES
    Bornemann, Folkmar
    arXiv, 2023,
  • [30] The Communication and Streaming Complexity of Computing the Longest Common and Increasing Subsequences
    Sun, Xiaoming
    Woodruff, David P.
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 336 - +
12345