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...

Celý popis

Podrobná bibliografia

Vydané v:	Pattern recognition Ročník 119; s. 108059
Hlavní autori:	Wang, Chunyang, Wang, Yuping, Cheung, Yiuming
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.11.2021
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!