$$\textsc {McDag}$$ M C D A G : indexing maximal common subsequences for k strings

$$\textsc {McDag}$$ M C D A G : indexing maximal common subsequences for k strings

Abstract Analyzing and comparing sequences of symbols is among the most fundamental problems in computer science, possibly even more so in bioinformatics. Maximal Common Subsequences (MCSs), i.e., inclusion-maximal sequences of non-contiguous symbols common to two or more strings, have only recently...

Full description

Saved in:
Bibliographic Details
Main Authors: Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi
Format: Article
Language:English
Published: BMC 2025-04-01
Series:Algorithms for Molecular Biology
Subjects:
Common subsequences
Inclusion maximality
Directed acyclic graph
Index data structure
Online Access:https://doi.org/10.1186/s13015-025-00271-z
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://doi.org/10.1186/s13015-025-00271-z

Similar Items