3 papers
cs.DS2026
Maximum Coverage -Antichains and Chains: A Greedy Approach
Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak +1
Given an acyclic digraph and a positive integer , the problem of Maximum Coverage -Antichains (resp. Chains) denoted as MA- (resp. MC-) asks to find set…
q-bio.QM2026
EMERALD-UI: An interactive web application to unveil novel protein biology hidden in the suboptimal-alignment space
Andrei Preoteasa, Andreas Grigorjew, Alexandru I. Tomescu +1
Life over the past four billion years has been shaped by proteins and their capacity to assemble into three dimensional conformations. Protein sequence alignments have been the ena…
cs.DS2025
Width Parameters for Minimum Flow Decomposition
Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey +1
Minimum flow decomposition (MFD) is the strongly NP-hard problem of finding a smallest set of integer weighted - paths in an - DAG whose weighted sum is equal to a…