Jul 1, 2024 · We study the maximum-scoring path set (MSPS) problem where the input is a directed or undirected graph with weighted vertices and a non-negative startup ...

We call this new problem maximum-scoring path sets (MSPS). We present an algorithm that has a linear-time complexity for graphs with a constant treewidth.

Jul 1, 2024 · We present an algorithm that has a linear-time complexity for graphs with a constant treewidth. Generalization from sequences to graphs allows ...

Oct 22, 2024 · We call this new problem maximum-scoring path sets (MSPS). We present an algorithm that has a linear-time complexity for graphs with a constant treewidth.

Generalization from sequences to graphs allows the algorithm to be used on pangenome graphs representing several related genomes and can be seen as a common ...

We call this new problem maximum-scoring path sets (MSPS). We present an algorithm that has a linear-time complexity for graphs with a constant treewidth.

... path graphs, but also on graphs with the treewidth bounded by a constant. ... pangenome graphs ... maximum-scoring segment sets in a sequence of scores to graphs.

Pangenome reference graphs are useful in genomics because they ... Maximum-scoring path sets on pangenome graphs of constant treewidth · Brejova ...

We generalize a problem of finding maximum-scoring segment sets, previously studied by Csűrös (IEEE/ACM Transactions on Computational Biology and ...

We examine the problem of finding maximum-scoring sets of disjoint segments in a sequence of scores. The problem arises in DNA and protein segmentation and in ...