Algorithms for the Uniqueness of the Longest Common Subsequence-Reference-Cited by-同舟云学术

Algorithms for the Uniqueness of the Longest Common Subsequence

Published:2023-12 Issue:06 Volume:21 Page:
ISSN:0219-7200
Container-title:Journal of Bioinformatics and Computational Biology
language:en
Short-container-title:J. Bioinform. Comput. Biol.

Author:

Wang Yue¹²^ORCID

Affiliation:

1. Department of Computational Medicine, University of California, Los Angeles, California, USA

2. Irving Institute for Cancer Dynamics and Department of Statistics, Columbia University, New York, New York, USA

Abstract

Given several number sequences, determining the longest common subsequence is a classical problem in computer science. This problem has applications in bioinformatics, especially determining transposable genes. Nevertheless, related works only consider how to find one longest common subsequence. In this paper, we consider how to determine the uniqueness of the longest common subsequence. If there are multiple longest common subsequences, we also determine which number appears in all/some/none of the longest common subsequences. We focus on four scenarios: (1) linear sequences without duplicated numbers; (2) circular sequences without duplicated numbers; (3) linear sequences with duplicated numbers; (4) circular sequences with duplicated numbers. We develop corresponding algorithms and apply them to gene sequencing data.

Publisher

World Scientific Pub Co Pte Ltd

Subject

Computer Science Applications,Molecular Biology,Biochemistry

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219720023500270

Reference95 articles.

1. Automatic evaluation of machine translation quality using longest common subsequence and skip-bigram statistics

2. Using longest common subsequence and character models to predict word forms

3. A space-efficient algorithm for sequence alignment with inversions and reversals

4. KRAB zinc-finger proteins contribute to the evolution of gene regulatory networks