Lastly, the definition of the custom algorithm was removed and minor improvements have been made to the text, as suggested by reviewers.
We note that the results for predictions at the known width are generally lower than when the motif discovery phase of the algorithm was removed.
In these tests, the motif discovery phase of the algorithm was removed and the set of candidate models constructed as if the motif discovery algorithm had performed as well as possible at each candidate width.
The resulting DNA histograms were visually inspected and nuclei, which should have been removed on the basis of features such as shape and texture automatically, but were missed by the classification algorithms, were removed manually.
As opposed to MMax-MDFN, we denote this scheme as the MMax-MDF algorithm since normalization by is removed.
Finally, to increase the efficiency of the algorithm, a walking monomer is removed from the simulation if it diffuses too far away from the aggregate, i.e., when the distance to the aggregate is larger than R + D R, where D R ≫ d R.
where Var denotes the variance of a random variable and B f,t) and V f,t) are finite constants with respect to both M and N. The results in Theorem 2 can be adapted to the case where the island-level resampling step is removed from Algorithm 3, effectively converting the double bootstrap method into an ensemble of non-interacting PFs.
In contrast, if a necessary residue is removed, the algorithm will pick up many mismatches.
At the same time, every time a node is removed, the algorithm removes the edges attached to it.
The redundancy of the joint motion search is removed, and the algorithm is simplified.
