Article ; Online: Algorithms for the Uniqueness of the Longest Common Subsequence.
Journal of bioinformatics and computational biology
2024 Volume 21, Issue 6, Page(s) 2350027
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 ... ...
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. |
---|---|
MeSH term(s) | Algorithms ; Computational Biology |
Language | English |
Publishing date | 2024-01-10 |
Publishing country | Singapore |
Document type | Journal Article |
ZDB-ID | 2115015-1 |
ISSN | 1757-6334 ; 0219-7200 |
ISSN (online) | 1757-6334 |
ISSN | 0219-7200 |
DOI | 10.1142/S0219720023500270 |
Database | MEDical Literature Analysis and Retrieval System OnLINE |
More links
Kategorien
Order via subito
This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.