The matrix match threshold was 80% of the maximal match score.
The score of a sequence is defined as the maximal weighted match scores subject to the constraint that the matches cannot overlap.
The final matching score is obtained by a weighted sum of global and local matching scores.
Figures 5, 6, 7, 8, 9 and 10 illustrate the maximal matching obtained for each of the real-world network graphs with respect to both maximal node matching and maximal assortative matching.
Let M be a maximal matching in G.
Per definition, this results in a maximal matching.
To compute the maximal matching, the Edmonds's non-bipartite matching algorithm was implemented.
What is left is your maximal matching.
By keeping a running match score to find maximal matches as in BLAST, it is straightforwardly possible to reduce this to O NM) per single test, and so across the whole collection, but this is still large for large M.
The pseudomolecule derived from the 35L-20PP assembly was selected as the optimal assembly due to maximal coverage and match scores with regard to the reference Sanger pseudomolecule.
