A branch and bound irredundant graph algorithm for large-scale MLCS problems

•Design a branch and bound strategy for identifying non-contributed points and non-longest paths.•Construct a much smaller DAG than those constructed by the existing algorithms.•Design a strategy for deleting points in the Hash table timely.•Propose a new data structure for storing Small-DAG to avoi...

Full description

Bibliographic Details

Published in:	Pattern recognition Vol. 119; p. 108059
Main Authors:	Wang, Chunyang, Wang, Yuping, Cheung, Yiuming
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.11.2021
Subjects:	Branch and bound Gene alignment Multiple longest common subsequences Small DAG Small DAG Gene alignment Branch and bound Multiple longest common subsequences
ISSN:	0031-3203, 1873-5142
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!