2 papers
cs.DS2024
Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing
Manuel Lafond
Given a bipartite graph , the \textsc{Bicluster Editing} problem asks for the minimum number of edges to insert or delete in so that every connected component is a bicluster…
cs.DS2017
Consistency of orthology and paralogy constraints in the presence of gene transfers
Mark Jones, Manuel Lafond, Celine Scornavacca
Orthology and paralogy relations are often inferred by methods based on gene similarity, which usually yield a graph depicting the relationships between gene pairs. Such relation g…