A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem
Searching for the Multiple Longest Common Subsequences (MLCS) of multiple sequences is a classical NP-hard problem, which has been used in many applications. One of the most effective exact approaches for the MLCS problem is based on dominant point graph, which is a kind of directed acyclic graph (D...
Main Authors: | Zhan Peng, Yuping Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2017-08-01
|
Series: | Frontiers in Genetics |
Subjects: | |
Online Access: | http://journal.frontiersin.org/article/10.3389/fgene.2017.00104/full |
Similar Items
-
Using the longest run subsequence problem within homology-based scaffolding
by: Sven Schrinner, et al.
Published: (2021-06-01) -
Using the longest run subsequence problem within homology-based scaffolding
by: Goel, M., et al.
Published: (2021) -
Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings
by: Bojan Nikolic, et al.
Published: (2021-06-01) -
Small Longest Tandem Scattered Subsequences
by: Luıs M. S. Russo, et al.
Published: (2021-08-01) -
An OpenMP-based tool for finding longest common subsequence in bioinformatics
by: Rayhan Shikder, et al.
Published: (2019-04-01)