Maximum-scoring path sets on pangenome graphs of constant treewidth

We generalize a problem of finding maximum-scoring segment sets, previously studied by Csűrös (IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004, 1, 139–150), from sequences to graphs. Namely, given a vertex-weighted graph G and a non-negative startup penalty c , we can find a...

Full description

Bibliographic Details

Published in:	Frontiers in bioinformatics Vol. 4; p. 1391086
Main Authors:	Brejová, Broňa, Gagie, Travis, Herencsárová, Eva, Vinař, Tomáš
Format:	Journal Article
Language:	English
Published:	Switzerland Frontiers Media S.A 01.07.2024
Subjects:	Bioinformatics dynamic programming elastic degenerate strings pangenomics treewidth weighted paths dynamic programming elastic degenerate strings weighted paths pangenomics treewidth
ISSN:	2673-7647, 2673-7647
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!