English

Computing the Number of Longest Common Subsequences

Data Structures and Algorithms 2007-05-23 v1 Discrete Mathematics
Authors: Ronald I. Greenberg
View on arXiv ↗ PDF ↗

Abstract

This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.

Keywords

string algorithms sequence design matrix multiplication

Cite

@article{arxiv.cs/0301034,
  title  = {Computing the Number of Longest Common Subsequences},
  author = {Ronald I. Greenberg},
  journal= {arXiv preprint arXiv:cs/0301034},
  year   = {2007}
}

Comments

3 pages, LaTeX

Related papers

View all related →
Discrete Mathematics · Computer Science
Bounds on the Number of Longest Common Subsequences
Ronald I. Greenberg
2007-05-23
Data Structures and Algorithms · Computer Science
A Fast Randomized Algorithm for Finding the Maximal Common Subsequences
Jin Cao, Dewei Zhong
2020-09-09
Data Structures and Algorithms · Computer Science
Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$
Filip Pavetić, Ivan Katanić, Gustav Matula, Goran Žužić +1
2018-05-25
Data Structures and Algorithms · Computer Science
Efficient algorithms for enumerating maximal common subsequences of two strings
Miyuji Hirota, Yoshifumi Sakai
2023-07-21
Data Structures and Algorithms · Computer Science
A simple linear space algorithm for computing a longest common increasing subsequence
Daxin Zhu, Lei Wang, Tinran Wang, Xiaodong Wang
2016-08-26
Data Structures and Algorithms · Computer Science
Efficient algorithms for the longest common subsequence in $k$-length substrings
Sebastian Deorowicz, Szymon Grabowski
2013-11-20
Genomics · Quantitative Biology
Algorithms for the uniqueness of the longest common subsequence
Yue Wang
2023-11-21
Data Structures and Algorithms · Computer Science
Approximating binary longest common subsequence in almost-linear time
Xiaoyu He, Ray Li
2023-02-13
Data Structures and Algorithms · Computer Science
Longest Common Subsequence in at Least $k$ Length Order-Isomorphic Substrings
Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka +5
2017-02-07
Data Structures and Algorithms · Computer Science
An Algorithm for the Longest Common Subsequence and Substring Problem
R. Li, J. Deka, K. Deka
2023-08-03
Data Structures and Algorithms · Computer Science
The Complexity of Maximal Common Subsequence Enumeration
Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita +1
2025-04-08
Artificial Intelligence · Computer Science
Longest Common Substring in Longest Common Subsequence's Solution Service: A Novel Hyper-Heuristic
Alireza Abdi, Masih Hajsaeedi, Mohsen Hooshmand
2023-06-07
Data Structures and Algorithms · Computer Science
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
Szymon Grabowski
2014-05-22
Data Structures and Algorithms · Computer Science
Reducing approximate Longest Common Subsequence to approximate Edit Distance
Aviad Rubinstein, Zhao Song
2019-04-12
Data Structures and Algorithms · Computer Science
Improved Approximation for Longest Common Subsequence over Small Alphabets
Shyan Akmal, Virginia Vassilevska Williams
2021-05-10
Data Structures and Algorithms · Computer Science
An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence
Shihabur Rahman Chowdhury, Masud Hasan, Sumaiya Iqbal, M. Sohel Rahman
2010-04-20
Data Structures and Algorithms · Computer Science
Fast and Simple Computation of All Longest Common Subsequences
Ronald I. Greenberg
2011-03-09
Data Structures and Algorithms · Computer Science
Longest Common Subsequence in k-length substrings
Gary Benson, Avivit Levy, Riva Shalom
2014-02-11
Discrete Mathematics · Computer Science
Systematic assessment of the expected length, variance and distribution of Longest Common Subsequences
Kang Ning, Kwok Pui Choi
2013-06-19
Data Structures and Algorithms · Computer Science
A Data-Structure for Approximate Longest Common Subsequence of A Set of Strings
Sepideh Aghamolaei
2021-01-13
Data Structures and Algorithms · Computer Science
Computing a Longest Common Palindromic Subsequence
Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman
2011-10-25
Data Structures and Algorithms · Computer Science
A Practical O(R\log\log n+n) time Algorithm for Computing the Longest Common Subsequence
Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang
2015-08-25
Data Structures and Algorithms · Computer Science
Quadratic-time Algorithm for the String Constrained LCS Problem
Sebastian Deorowicz
2011-07-01
Data Structures and Algorithms · Computer Science
An Algorithm for the Constrained Longest Common Subsequence and Substring Problem
R. Li, J. Deka, K. Deka, D. Li
2023-08-04
Data Structures and Algorithms · Computer Science
An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
Lei Wang, Xiaodong Wang, Yingjie Wu, Daxin Zhu
2013-03-11