A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems | Zendy

Shiwei Wei | Zendy; Yuping Wang | Zendy; Yuanchao Yang | Zendy; Sen Liu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems

Author(s) -

Shiwei Wei,

Yuping Wang,

Yuanchao Yang,

Sen Liu

Publication year - 2020

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btaa134

Subject(s) - directed acyclic graph , computer science , path (computing) , algorithm , longest common subsequence problem , node (physics) , benchmark (surveying) , graph , theoretical computer science , structural engineering , geodesy , engineering , programming language , geography

Searching the Longest Common Subsequences of many sequences is called a Multiple Longest Common Subsequence (MLCS) problem which is a very fundamental and challenging problem in many fields of data mining. The existing algorithms cannot be applicable to problems with long and large-scale sequences due to their huge time and space consumption. To efficiently handle large-scale MLCS problems, a Path Recorder Directed Acyclic Graph (PRDAG) model and a novel Path Recorder Algorithm (PRA) are proposed.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research