POTTR: Identifying Recurrent Trajectories in Evolutionary and Developmental Processes using Posets
This paper introduces POTTR, a novel combinatorial algorithm that utilizes incomplete partially ordered sets (posets) and a conflict graph approach to solve the NP-hard maximum k-common induced incomplete subposet problem, thereby identifying statistically significant recurrent genetic trajectories and conserved differentiation routes across diverse biological datasets while effectively resolving uncertainties inherent in tumor phylogenies and lineage tracing.