Abstract
Searching Longest Common Subsequences (LCS) of Multiple (i.e., three or more) sequences, denoted as MLCS for short, is a fundamental problem in computational biology, pattern recognition, file comparison and information retrieval, to name a few. Basically, an MLCS problem is more challenging than the LCS of two sequences which can be solved by a dynamic programming (DP) method whose running time and memory space are both O(n2) , where n is the length of the sequences.
Original language | English |
---|---|
Title of host publication | 2022 IEEE 38th International Conference on Data Engineering (ICDE) |
Publisher | IEEE |
Pages | 1485-1486 |
Number of pages | 2 |
ISBN (Electronic) | 9781665408837 |
ISBN (Print) | 9781665408844 |
DOIs | |
Publication status | Published - 9 May 2022 |
Event | 38th IEEE International Conference on Data Engineering, ICDE 2022 - Virtual, Kuala Lumpur, Malaysia Duration: 9 May 2022 → 12 May 2022 https://icde2022.ieeecomputer.my/ https://ieeexplore.ieee.org/xpl/conhome/9835153/proceeding |
Publication series
Name | IEEE International Conference on Data Engineering (ICDE) |
---|---|
ISSN (Print) | 1063-6382 |
ISSN (Electronic) | 2375-026X |
Conference
Conference | 38th IEEE International Conference on Data Engineering, ICDE 2022 |
---|---|
Country/Territory | Malaysia |
City | Kuala Lumpur |
Period | 9/05/22 → 12/05/22 |
Internet address |