UULsNalTppjbriC26rhysZX7ksVQR4l0758dfrP58bT7CEgZjtgWXlc1e9Uw
Current position: Home >> Scientific Research >> Paper Publications

A Branch Elimination-based Effificient Algorithm for Large-scale Multiple Longest Common Subsequence Problem

Hits:

Title of Paper:A Branch Elimination-based Effificient Algorithm for Large-scale Multiple Longest Common Subsequence Problem

Journal:IEEE Transactions on Knowledge and Data Engineering

Indexed by:Journal paper

Correspondence Author:Yuping Wang

Discipline:Engineering

First-Level Discipline:Computer Science and Technology

Document Type:J

Volume:54

Issue:4

Page Number:234

Translation or Not:No

Date:2023-06-11

Prev One:A Distributed Storage MLCS Algorithm with Time Efficient Upper Bound and Precise Lower Bound

Next One:A Branch Elimination-based Effificient Algorithm for Large-scale Multiple Longest Common Subsequence Problem