4.3 Article

Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Software Engineering

Fast and Longest Rollercoasters

Pawel Gawrychowski et al.

Summary: This paper introduces algorithms for computing the length of a maximum-length k-rollercoaster in a given sequence, improving upon previous results in terms of complexity and output.

ALGORITHMICA (2022)

Article Computer Science, Theory & Methods

Computing a longest common almost-increasing subsequence of two sequences

Toan Thang Ta et al.

Summary: In this work, a dynamic programming algorithm is proposed to correctly compute the longest common almost-increasing subsequence (LCaIS) between two sequences with repeated elements. The algorithm has a time complexity of O(nml) and a space complexity of O(nm).

THEORETICAL COMPUTER SCIENCE (2021)

Article Computer Science, Information Systems

Longest common subsequence in sublinear space

Masashi Kiyomi et al.

Summary: The algorithm presented is the first O(n)-space polynomial-time algorithm for computing the length of a longest common subsequence. It runs in O(n^3) time with O(n log(1.5) n/2(root logn) bits of space.

INFORMATION PROCESSING LETTERS (2021)

Article Computer Science, Theory & Methods

On generalized Lyndon words

Francesco Dolce et al.

THEORETICAL COMPUTER SCIENCE (2019)

Article Computer Science, Interdisciplinary Applications

The longest commonly positioned increasing subsequences problem

Xiaozhou He et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2018)

Article Computer Science, Information Systems

A hardness result and new algorithm for the longest common palindromic subsequence problem

Shunsuke Inenaga et al.

INFORMATION PROCESSING LETTERS (2018)

Article Computer Science, Theory & Methods

THE RUNS THEOREM

Hideo Bannai et al.

SIAM JOURNAL ON COMPUTING (2017)

Proceedings Paper Computer Science, Theory & Methods

Tight Hardness Results for LCS and other Sequence Similarity Measures

Amir Abboud et al.

2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2015)

Article Computer Science, Theory & Methods

New algorithms on wavelet trees and applications to information retrieval

Travis Gagie et al.

THEORETICAL COMPUTER SCIENCE (2012)

Article Mathematics, Applied

Faster algorithms for computing longest common increasing subsequences

Martin Kutz et al.

JOURNAL OF DISCRETE ALGORITHMS (2011)

Article Computer Science, Information Systems

The longest almost-increasing subsequence

Amr Elmasry

INFORMATION PROCESSING LETTERS (2010)

Article Computer Science, Theory & Methods

Lowest common ancestors in trees and directed acyclic graphs

MA Bender et al.

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2005)

Article Computer Science, Theory & Methods

Dynamic LCA queries on trees

R Cole et al.

SIAM JOURNAL ON COMPUTING (2005)