A Branch Elimination-based Efficient Algorithm for Large-scale Multiple Longest Common Subsequence Problem (Extended Abstract)

Shiwei Wei, Yuping Wang, Yiu-ming Cheung

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

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 languageEnglish
Title of host publication2022 IEEE 38th International Conference on Data Engineering (ICDE)
PublisherIEEE
Pages1485-1486
Number of pages2
ISBN (Electronic)9781665408837
ISBN (Print)9781665408844
DOIs
Publication statusPublished - 9 May 2022
Event38th IEEE International Conference on Data Engineering, ICDE 2022 - Virtual, Kuala Lumpur, Malaysia
Duration: 9 May 202212 May 2022
https://icde2022.ieeecomputer.my/
https://ieeexplore.ieee.org/xpl/conhome/9835153/proceeding

Publication series

NameIEEE International Conference on Data Engineering (ICDE)
ISSN (Print)1063-6382
ISSN (Electronic)2375-026X

Conference

Conference38th IEEE International Conference on Data Engineering, ICDE 2022
Country/TerritoryMalaysia
CityKuala Lumpur
Period9/05/2212/05/22
Internet address

Fingerprint

Dive into the research topics of 'A Branch Elimination-based Efficient Algorithm for Large-scale Multiple Longest Common Subsequence Problem (Extended Abstract)'. Together they form a unique fingerprint.

Cite this