From 7c19896dc95fd2264d826e1d327a724f22b0c18f Mon Sep 17 00:00:00 2001 From: efischer Date: Tue, 22 Feb 2022 16:09:50 -0600 Subject: [PATCH] update readme --- readme.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/readme.md b/readme.md index 108e643..8e250d0 100644 --- a/readme.md +++ b/readme.md @@ -20,8 +20,8 @@ The problem of pairing TCRA/TCRB sequences thus reduces to the "assignment probl matching on a bipartite graph--the subset of vertex-disjoint edges whose weights sum to the maximum possible value. This is a well-studied combinatorial optimization problem, with many known solutions. -The most efficient known algorithm for maximum weight matching is from Duan and Su (2012), and requires a bipartite graph -with strictly integer edge weights. For a graph with m edges, n vertices per side, and maximum integer edge weight N, +The most efficient algorithm known to the author for maximum weight matching of a bipartite graph with strictly integral weights +is from Duan and Su (2012). For a graph with m edges, n vertices per side, and maximum integer edge weight N, their algorithm runs in **O(m sqrt(n) log(N))** time. As the graph representation of a pairSEQ experiment is bipartite with integer weights, this algorithm is ideal for BiGpairSEQ.